{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZFDK4KUWEPNNLRRAG255Q7S52N","short_pith_number":"pith:ZFDK4KUW","schema_version":"1.0","canonical_sha256":"c946ae2a9623dad5c62036bbd87e5dd369f35446daefe6b520a0cec5d01979d9","source":{"kind":"arxiv","id":"2605.16525","version":1},"attestation_state":"computed","paper":{"title":"Mayer Path Homology","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Mayer path homology equips directed path complexes with an N-nilpotent differential to produce a finer invariant than standard path homology.","cross_cats":[],"primary_cat":"math.AT","authors_text":"Dilan Karaguler, Guo-Wei Wei","submitted_at":"2026-05-15T18:21:42Z","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 "},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.16525","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.AT","submitted_at":"2026-05-15T18:21:42Z","cross_cats_sorted":[],"title_canon_sha256":"1be795c64949c265b1588e906b458ae5084b613e9ab1b2197c03afbe28f7e945","abstract_canon_sha256":"50031f932e63c4f58f9b3de84fcf182be561c9e00d7e51288fffd9a4acfe3b81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:27.342670Z","signature_b64":"ILiDjYsWoqOuVrB459IdyNda52Zh7EsPFNTwiQOUf6TRVXgaEWU1eM4DeGK98J2OcX8fNqTccdPsszF1bAEADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c946ae2a9623dad5c62036bbd87e5dd369f35446daefe6b520a0cec5d01979d9","last_reissued_at":"2026-05-20T00:02:27.341842Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:27.341842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mayer Path Homology","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Mayer path homology equips directed path complexes with an N-nilpotent differential to produce a finer invariant than standard path homology.","cross_cats":[],"primary_cat":"math.AT","authors_text":"Dilan Karaguler, Guo-Wei Wei","submitted_at":"2026-05-15T18:21:42Z","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 "},"claims":{"count":4,"items":[{"kind":"strongest_claim","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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","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.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Mayer path homology equips directed path complexes with an N-nilpotent differential to produce a finer invariant than standard path homology.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"7dd77192ca706b8d6523fdbfcd5e294fa770a1f0495f51a54928c8dccf386e07"},"source":{"id":"2605.16525","kind":"arxiv","version":1},"verdict":{"id":"fb3abfd2-750c-4656-9387-c84d5452041d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T21:24:39.481057Z","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.","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","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.","pith_extraction_headline":"Mayer path homology equips directed path complexes with an N-nilpotent differential to produce a finer invariant than standard path homology."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16525/integrity.json","findings":[],"available":true,"detectors_run":[{"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","findings_count":0}],"snapshot_sha256":"5d0a2cd2908ab40b53b8bd667bc30bdccb354949788e462653b35265bd915ca8"},"references":{"count":20,"sample":[{"doi":"","year":2023,"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","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Samir Chowdhury and Facundo M´ emoli.Persistent Path Homology of Directed Networks, pages 1152–1169","work_id":"1412e272-93b2-4ab0-9b84-b334800fabc0","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Dey, Tianqi Li, and Yusu Wang","work_id":"3a592b28-a1af-40c5-a576-782aa0a1656c","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"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","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Network modeling and topology of aging.Physics Reports, 1101:1–65, 2025","work_id":"3a5bdc33-846f-4b7f-b793-8f006030160a","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":20,"snapshot_sha256":"979c3f61102a52e7548f987f64d311b40333e5ab0a883cda93506aaab2990e45","internal_anchors":1},"formal_canon":{"evidence_count":2,"snapshot_sha256":"fb2d75a562cb0ac8b6c577c8bc678f808ac702b5a24bce674b3ba0677b259447"},"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.16525","created_at":"2026-05-20T00:02:27.341972+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.16525v1","created_at":"2026-05-20T00:02:27.341972+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16525","created_at":"2026-05-20T00:02:27.341972+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZFDK4KUWEPNN","created_at":"2026-05-20T00:02:27.341972+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZFDK4KUWEPNNLRRA","created_at":"2026-05-20T00:02:27.341972+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZFDK4KUW","created_at":"2026-05-20T00:02:27.341972+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZFDK4KUWEPNNLRRAG255Q7S52N","json":"https://pith.science/pith/ZFDK4KUWEPNNLRRAG255Q7S52N.json","graph_json":"https://pith.science/api/pith-number/ZFDK4KUWEPNNLRRAG255Q7S52N/graph.json","events_json":"https://pith.science/api/pith-number/ZFDK4KUWEPNNLRRAG255Q7S52N/events.json","paper":"https://pith.science/paper/ZFDK4KUW"},"agent_actions":{"view_html":"https://pith.science/pith/ZFDK4KUWEPNNLRRAG255Q7S52N","download_json":"https://pith.science/pith/ZFDK4KUWEPNNLRRAG255Q7S52N.json","view_paper":"https://pith.science/paper/ZFDK4KUW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.16525&json=true","fetch_graph":"https://pith.science/api/pith-number/ZFDK4KUWEPNNLRRAG255Q7S52N/graph.json","fetch_events":"https://pith.science/api/pith-number/ZFDK4KUWEPNNLRRAG255Q7S52N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZFDK4KUWEPNNLRRAG255Q7S52N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZFDK4KUWEPNNLRRAG255Q7S52N/action/storage_attestation","attest_author":"https://pith.science/pith/ZFDK4KUWEPNNLRRAG255Q7S52N/action/author_attestation","sign_citation":"https://pith.science/pith/ZFDK4KUWEPNNLRRAG255Q7S52N/action/citation_signature","submit_replication":"https://pith.science/pith/ZFDK4KUWEPNNLRRAG255Q7S52N/action/replication_record"}},"created_at":"2026-05-20T00:02:27.341972+00:00","updated_at":"2026-05-20T00:02:27.341972+00:00"}