Prüft behauptete Möbius-Intervallkoeffizienten und zurückgewonnene atomare Ganzz...
https://detect.halowerk.com/v1/F-B-NIGHT-POSET_INCIDENCE_INVERSION/finite-poset-incidence-mobius-inversionOverview
Prüft behauptete Möbius-Intervallkoeffizienten und zurückgewonnene atomare Ganzzahlwerte einer endlichen Teilordnungsaggregation; verhindert doppelte Pfadzählung und falsche Hierarchie-Subtraktion bei mehrfachen Vorgängern, ohne Quellwerte auszugeben.
Protocol
x402 (POST)
Price
$0.0030
Payment Asset
USD Coin
Payment Network
eip155:8453
Category
uncategorized
Provider
detect
Source
bazaar
Indexed
2026-11-02 19:28:37
Health
Status
unknown
Latency (p50)
—
Uptime (30d)
—
Reliability Score
—
Last Checked
Never
Last Healthy
Never
Consecutive Failures
0
x402 Payment Validation
Payment Requirements
—
Asset Verified
—
Facilitator
—
Input Schema
{
"body": {
"artifact": {
"aggregate_values": [
"-101",
"2",
"-208",
"4"
],
"claimed_atomic_values": [
"-101",
"103",
"-107",
"109"
],
"claimed_mobius": [
[
"1",
"-1",
"-1",
"1"
],
[
"0",
"1",
"0",
"-1"
],
[
"0",
"0",
"1",
"-1"
],
[
"0",
"0",
"0",
"1"
]
],
"claims": {
"incomparable_unordered_pairs": 1,
"nodes": 4,
"nonzero_mobius_entries": 9,
"strict_comparable_pairs": 5
},
"generating_edges": [
[
0,
1
],
[
0,
2
],
[
1,
3
],
[
2,
3
]
],
"node_count": 4
}
},
"bodyType": "json",
"method": "POST",
"type": "http"
}
Output Schema
{
"example": {
"billable": true,
"findings": [
{
"confidence": 100,
"evidence": [],
"limits": [
"Finite-poset incidence-algebra Möbius inversion: zeta(s,t)=1 iff s≤t, mu(s,s)=1 and mu(s,t)=-sum_{s≤u<t}mu(s,u); aggregates g(t)=sum_{s≤t}f(s) recover as f(t)=sum_{s≤t}g(s)mu(s,t). One general finite poset, not separate chain/divisibility/subset variants.",
"Caller supplies a strict DAG generating the order, not all paths as multiplicities. Own topological order/transitive closure and interval recurrence, exact integer arithmetic. Duplicate/redundant generating edges have no effect; cycles/self-generators unknown. Empty poset supported. No inferred external hierarchy, chronology, precedence scheduling or generic linear-solver SDK.",
"Maximum32nodes/512edges; aggregate signed integer strings at most32digits, claimed inverse/atomic strings at most64digits. Only bounded counts/booleans output; no matrix coefficients, atomic/aggregate values, raw claims, contact values or exceptions. Exact integer equality including tiny fractional discrete counter claims."
],
"module": "finite-poset-incidence-mobius-inversion",
"state": "not_observed",
"value": {
"atomic_values_match": true,
"claim_mismatches": 0,
"claims_match": true,
"incomparable_unordered_pairs": 1,
"mobius_matrix_matches": true,
"nodes": 4,
"nonzero_mobius_entries": 9,
"strict_comparable_pairs": 5
},
"warnings": []
}
],
"known_count": 1,
"scope": {
"contact_values_returned": false,
"network": false,
"supplied_artifact_only": true
},
"warnings": []
},
"type": "json"
}