{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YOKD6STMOUJF3KLWL63KQ5TRT7","short_pith_number":"pith:YOKD6STM","schema_version":"1.0","canonical_sha256":"c3943f4a6c75125da9765fb6a876719fd064f2db1db763d7fb885dc9e8f38163","source":{"kind":"arxiv","id":"2605.03894","version":2},"attestation_state":"computed","paper":{"title":"Quasimonophobic graphs and degree spectral sequences in discrete cubical homology","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Quasimonophobicity on graphs forces the degree spectral sequence of discrete cubical homology to vanish in selected bidegrees and identifies injective homology with the homology of the filled CW complex, enabling explicit computation of H_2 on Greene sphere graphs.","cross_cats":["math.CO"],"primary_cat":"math.AT","authors_text":"Mark Behrens, Samira Sahar Jamil","submitted_at":"2026-05-05T15:50:09Z","abstract_excerpt":"We introduce the degree filtration on the discrete cubical chain complex of a graph, defined in terms of the maximal injective dimension of the facets of singular $n$-cubes, and study the degree spectral sequence which arises from this filtration. This spectral sequence interpolates between the discrete cubical homology of a graph $H_n(G)$ and the injective homology $H_n^{inj}(G)$, a variant of the discrete cubical homology based on injective singular cubes. Building on the work of Babson et al. we introduce the combinatorial condition of quasimonophobicity on graphs, and show quasimonophobici"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.03894","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.AT","submitted_at":"2026-05-05T15:50:09Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a7cafbdc5df1eeb81fce698a8b808027038c18f8906c97a47a03d992aecbd55b","abstract_canon_sha256":"402174088ee280000f743316125f6ca70ed7cf0efa08bca54d211dc06c3eb03a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:04:06.484601Z","signature_b64":"Otgdshs41EeJLiQmkKnFXhDI4n7NQGN9X8jFkQqDtvZTyXoXIBk4VIxYmBWtxrFDwlzW2RJL8Jm5jL6GzRdMBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3943f4a6c75125da9765fb6a876719fd064f2db1db763d7fb885dc9e8f38163","last_reissued_at":"2026-06-08T01:04:06.483738Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:04:06.483738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasimonophobic graphs and degree spectral sequences in discrete cubical homology","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Quasimonophobicity on graphs forces the degree spectral sequence of discrete cubical homology to vanish in selected bidegrees and identifies injective homology with the homology of the filled CW complex, enabling explicit computation of H_2 on Greene sphere graphs.","cross_cats":["math.CO"],"primary_cat":"math.AT","authors_text":"Mark Behrens, Samira Sahar Jamil","submitted_at":"2026-05-05T15:50:09Z","abstract_excerpt":"We introduce the degree filtration on the discrete cubical chain complex of a graph, defined in terms of the maximal injective dimension of the facets of singular $n$-cubes, and study the degree spectral sequence which arises from this filtration. This spectral sequence interpolates between the discrete cubical homology of a graph $H_n(G)$ and the injective homology $H_n^{inj}(G)$, a variant of the discrete cubical homology based on injective singular cubes. Building on the work of Babson et al. we introduce the combinatorial condition of quasimonophobicity on graphs, and show quasimonophobici"},"claims":{"count":3,"items":[{"kind":"strongest_claim","text":"Quasimonophobicity implies both the vanishing of the degree spectral sequence in certain bidegrees and that H_n^{inj}(G) is isomorphic to the homology of the CW complex obtained by filling in subcubes of the graph; these results are applied to compute H_2(G_n^{sph}).","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the combinatorial condition of quasimonophobicity, once imposed, is sufficient to guarantee both the spectral-sequence vanishing and the CW-complex isomorphism without additional hidden restrictions on the graphs or on the choice of singular cubes.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Quasimonophobicity on graphs forces the degree spectral sequence of discrete cubical homology to vanish in selected bidegrees and identifies injective homology with the homology of the filled CW complex, enabling explicit computation of H_2 on Greene sphere graphs.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"}],"snapshot_sha256":"fcadcebaac5c12adfb2d411a5f950b2e5b71c95e45d0be02e51383ca1170044a"},"source":{"id":"2605.03894","kind":"arxiv","version":2},"verdict":{"id":"9fce9df4-ef14-44a8-89cc-96c15c4940b3","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-07T00:40:31.009631Z","strongest_claim":"Quasimonophobicity implies both the vanishing of the degree spectral sequence in certain bidegrees and that H_n^{inj}(G) is isomorphic to the homology of the CW complex obtained by filling in subcubes of the graph; these results are applied to compute H_2(G_n^{sph}).","one_line_summary":"Quasimonophobicity on graphs forces the degree spectral sequence of discrete cubical homology to vanish in selected bidegrees and identifies injective homology with the homology of the filled CW complex, enabling explicit computation of H_2 on Greene sphere graphs.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the combinatorial condition of quasimonophobicity, once imposed, is sufficient to guarantee both the spectral-sequence vanishing and the CW-complex isomorphism without additional hidden restrictions on the graphs or on the choice of singular cubes.","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.03894/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T12:41:24.568684Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"a305ee0c7b2473abbb2bf38e0ddba049337a0c8d6dd5005df4904528029f2990"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.03894","created_at":"2026-06-08T01:04:06.483875+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.03894v2","created_at":"2026-06-08T01:04:06.483875+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.03894","created_at":"2026-06-08T01:04:06.483875+00:00"},{"alias_kind":"pith_short_12","alias_value":"YOKD6STMOUJF","created_at":"2026-06-08T01:04:06.483875+00:00"},{"alias_kind":"pith_short_16","alias_value":"YOKD6STMOUJF3KLW","created_at":"2026-06-08T01:04:06.483875+00:00"},{"alias_kind":"pith_short_8","alias_value":"YOKD6STM","created_at":"2026-06-08T01:04:06.483875+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YOKD6STMOUJF3KLWL63KQ5TRT7","json":"https://pith.science/pith/YOKD6STMOUJF3KLWL63KQ5TRT7.json","graph_json":"https://pith.science/api/pith-number/YOKD6STMOUJF3KLWL63KQ5TRT7/graph.json","events_json":"https://pith.science/api/pith-number/YOKD6STMOUJF3KLWL63KQ5TRT7/events.json","paper":"https://pith.science/paper/YOKD6STM"},"agent_actions":{"view_html":"https://pith.science/pith/YOKD6STMOUJF3KLWL63KQ5TRT7","download_json":"https://pith.science/pith/YOKD6STMOUJF3KLWL63KQ5TRT7.json","view_paper":"https://pith.science/paper/YOKD6STM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.03894&json=true","fetch_graph":"https://pith.science/api/pith-number/YOKD6STMOUJF3KLWL63KQ5TRT7/graph.json","fetch_events":"https://pith.science/api/pith-number/YOKD6STMOUJF3KLWL63KQ5TRT7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YOKD6STMOUJF3KLWL63KQ5TRT7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YOKD6STMOUJF3KLWL63KQ5TRT7/action/storage_attestation","attest_author":"https://pith.science/pith/YOKD6STMOUJF3KLWL63KQ5TRT7/action/author_attestation","sign_citation":"https://pith.science/pith/YOKD6STMOUJF3KLWL63KQ5TRT7/action/citation_signature","submit_replication":"https://pith.science/pith/YOKD6STMOUJF3KLWL63KQ5TRT7/action/replication_record"}},"created_at":"2026-06-08T01:04:06.483875+00:00","updated_at":"2026-06-08T01:04:06.483875+00:00"}