{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:4ZAHMUH6KTMKQ5ZDEM7WEX3ABZ","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":"bf6ae906319276311327516a479a7950126943f6f7500141e12104439320de7c","cross_cats_sorted":["cs.CG","math.AC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.AT","submitted_at":"2024-03-16T15:58:09Z","title_canon_sha256":"b811edf63cafdcb1910754f730677c0e143c9c6876d9207a4c1318dae65b5466"},"schema_version":"1.0","source":{"id":"2403.10958","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.10958","created_at":"2026-07-05T07:57:09Z"},{"alias_kind":"arxiv_version","alias_value":"2403.10958v1","created_at":"2026-07-05T07:57:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.10958","created_at":"2026-07-05T07:57:09Z"},{"alias_kind":"pith_short_12","alias_value":"4ZAHMUH6KTMK","created_at":"2026-07-05T07:57:09Z"},{"alias_kind":"pith_short_16","alias_value":"4ZAHMUH6KTMKQ5ZD","created_at":"2026-07-05T07:57:09Z"},{"alias_kind":"pith_short_8","alias_value":"4ZAHMUH6","created_at":"2026-07-05T07:57:09Z"}],"graph_snapshots":[{"event_id":"sha256:0c840f82e064cc1d1fb806e7600f6eac383c7d084cf957027e0262aafff8f223","target":"graph","created_at":"2026-07-05T07:57:09Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2403.10958/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We extend the persistence algorithm, viewed as an algorithm computing the homology of a complex of free persistence or graded modules, to complexes of modules that are not free. We replace persistence modules by their presentations and develop an efficient algorithm to compute the homology of a complex of presentations. To deal with inputs that are not given in terms of presentations, we give an efficient algorithm to compute a presentation of a morphism of persistence modules. This allows us to compute persistent (co)homology of instances giving rise to complexes of non-free modules. Our meth","authors_text":"Florian Russold, Shreyas N. Samaga, Tamal K. Dey","cross_cats":["cs.CG","math.AC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.AT","submitted_at":"2024-03-16T15:58:09Z","title":"Efficient Algorithms for Complexes of Persistence Modules with Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.10958","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:459afd8aefff902944f5fb7b0a4dbb99eb80454c938e2540c2f56d0ab4be06b2","target":"record","created_at":"2026-07-05T07:57:09Z","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":"bf6ae906319276311327516a479a7950126943f6f7500141e12104439320de7c","cross_cats_sorted":["cs.CG","math.AC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.AT","submitted_at":"2024-03-16T15:58:09Z","title_canon_sha256":"b811edf63cafdcb1910754f730677c0e143c9c6876d9207a4c1318dae65b5466"},"schema_version":"1.0","source":{"id":"2403.10958","kind":"arxiv","version":1}},"canonical_sha256":"e6407650fe54d8a87723233f625f600e46a8cb3ab9abd7dc19d623afd8a14a18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6407650fe54d8a87723233f625f600e46a8cb3ab9abd7dc19d623afd8a14a18","first_computed_at":"2026-07-05T07:57:09.423113Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:57:09.423113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lcHdn/NK2/Cnc8Lf9/NEVaoPd8Yt9zQj6V9jqjdam/A+2f26UA2McHQu/pUPtnIK0McW1pya5p8r8d0XcrjdAg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:57:09.423505Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.10958","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:459afd8aefff902944f5fb7b0a4dbb99eb80454c938e2540c2f56d0ab4be06b2","sha256:0c840f82e064cc1d1fb806e7600f6eac383c7d084cf957027e0262aafff8f223"],"state_sha256":"a1692126258b6d21ef50aa05f2792b75543da402ccf814b9e5c5f25d71e9c89b"}