{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZFDK4KUWEPNNLRRAG255Q7S52N","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"50031f932e63c4f58f9b3de84fcf182be561c9e00d7e51288fffd9a4acfe3b81","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.AT","submitted_at":"2026-05-15T18:21:42Z","title_canon_sha256":"1be795c64949c265b1588e906b458ae5084b613e9ab1b2197c03afbe28f7e945"},"schema_version":"1.0","source":{"id":"2605.16525","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16525","created_at":"2026-05-20T00:02:27Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16525v1","created_at":"2026-05-20T00:02:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16525","created_at":"2026-05-20T00:02:27Z"},{"alias_kind":"pith_short_12","alias_value":"ZFDK4KUWEPNN","created_at":"2026-05-20T00:02:27Z"},{"alias_kind":"pith_short_16","alias_value":"ZFDK4KUWEPNNLRRA","created_at":"2026-05-20T00:02:27Z"},{"alias_kind":"pith_short_8","alias_value":"ZFDK4KUW","created_at":"2026-05-20T00:02:27Z"}],"graph_snapshots":[{"event_id":"sha256:3f9e62d3d3a0909b34254120e6fa84fa01cf9ce5bda3816240f5ddae32d1b5c7","target":"graph","created_at":"2026-05-20T00:02:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"This construction defines a canonical invariant of directed graphs and is more sensitive than standard path homology, distinguishing directed network motifs that ordinary path homology cannot separate."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The N-nilpotent differential on path complexes produces well-defined homology groups that remain invariant under the directed graph structure and are strictly finer than classical path homology."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Mayer path homology equips path complexes with an N-differential to yield homology groups that distinguish directed graph motifs more finely than standard path homology."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Mayer path homology equips directed path complexes with an N-nilpotent differential to produce a finer invariant than standard path homology."}],"snapshot_sha256":"7dd77192ca706b8d6523fdbfcd5e294fa770a1f0495f51a54928c8dccf386e07"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"fb2d75a562cb0ac8b6c577c8bc678f808ac702b5a24bce674b3ba0677b259447"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T21:31:20.266601Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T21:31:19.485187Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T19:33:23.077475Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T19:21:56.941554Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.16525/integrity.json","findings":[],"snapshot_sha256":"5d0a2cd2908ab40b53b8bd667bc30bdccb354949788e462653b35265bd915ca8","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce Mayer path homology, a new homology theory for directed path complexes obtained by equipping path complexes with an $N$-nilpotent differential. The main novelty of this work is the introduction of an $N$-differential on path complexes, giving rise to $N$-chain complexes of $\\partial$-invariant paths and Mayer path homology groups $H_n^{N,q}(P)$. We prove that this construction defines a canonical invariant of directed graphs and is more sensitive than standard path homology, distinguishing directed network motifs that ordinary path homology cannot separate. We further establish a ","authors_text":"Dilan Karaguler, Guo-Wei Wei","cross_cats":[],"headline":"Mayer path homology equips directed path complexes with an N-nilpotent differential to produce a finer invariant than standard path homology.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.AT","submitted_at":"2026-05-15T18:21:42Z","title":"Mayer Path Homology"},"references":{"count":20,"internal_anchors":1,"resolved_work":20,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Path topology in molecular and materials sciences.The journal of physical chemistry letters, 14(4):954–964, 2023","work_id":"fc5be529-5a9e-4d87-817b-8480b9220f45","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Samir Chowdhury and Facundo M´ emoli.Persistent Path Homology of Directed Networks, pages 1152–1169","work_id":"1412e272-93b2-4ab0-9b84-b334800fabc0","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Dey, Tianqi Li, and Yusu Wang","work_id":"3a592b28-a1af-40c5-a576-782aa0a1656c","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Mayer-homology learning predic- tion of protein-ligand binding affinities.Journal of computational biophysics and chemistry, 24(02):253–266, 2025","work_id":"b259cbce-062b-4e8f-95d7-d00089de0475","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Network modeling and topology of aging.Physics Reports, 1101:1–65, 2025","work_id":"3a5bdc33-846f-4b7f-b793-8f006030160a","year":2025}],"snapshot_sha256":"979c3f61102a52e7548f987f64d311b40333e5ab0a883cda93506aaab2990e45"},"source":{"id":"2605.16525","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T21:24:39.481057Z","id":"fb3abfd2-750c-4656-9387-c84d5452041d","model_set":{"reader":"grok-4.3"},"one_line_summary":"Mayer path homology equips path complexes with an N-differential to yield homology groups that distinguish directed graph motifs more finely than standard path homology.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Mayer path homology equips directed path complexes with an N-nilpotent differential to produce a finer invariant than standard path homology.","strongest_claim":"This construction defines a canonical invariant of directed graphs and is more sensitive than standard path homology, distinguishing directed network motifs that ordinary path homology cannot separate.","weakest_assumption":"The N-nilpotent differential on path complexes produces well-defined homology groups that remain invariant under the directed graph structure and are strictly finer than classical path homology."}},"verdict_id":"fb3abfd2-750c-4656-9387-c84d5452041d"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:17a926742c62b0421b1212d4354f7a82ef8ece7ceed0ad2264f712f460c74ea6","target":"record","created_at":"2026-05-20T00:02:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"50031f932e63c4f58f9b3de84fcf182be561c9e00d7e51288fffd9a4acfe3b81","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.AT","submitted_at":"2026-05-15T18:21:42Z","title_canon_sha256":"1be795c64949c265b1588e906b458ae5084b613e9ab1b2197c03afbe28f7e945"},"schema_version":"1.0","source":{"id":"2605.16525","kind":"arxiv","version":1}},"canonical_sha256":"c946ae2a9623dad5c62036bbd87e5dd369f35446daefe6b520a0cec5d01979d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c946ae2a9623dad5c62036bbd87e5dd369f35446daefe6b520a0cec5d01979d9","first_computed_at":"2026-05-20T00:02:27.341842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:02:27.341842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ILiDjYsWoqOuVrB459IdyNda52Zh7EsPFNTwiQOUf6TRVXgaEWU1eM4DeGK98J2OcX8fNqTccdPsszF1bAEADg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:02:27.342670Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16525","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17a926742c62b0421b1212d4354f7a82ef8ece7ceed0ad2264f712f460c74ea6","sha256:3f9e62d3d3a0909b34254120e6fa84fa01cf9ce5bda3816240f5ddae32d1b5c7"],"state_sha256":"1c838b741ab4c35b197bf99ae2569669e752694aed23bb6cbcd4e07535ad6058"}