{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YUWTUG3LEF56TZKPF3F4E4S7FK","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":"90910c468bd3399d187f1840ab2d01b8271264dcd0ff4386280d2689594d8781","cross_cats_sorted":["cs.CG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2013-04-17T22:48:56Z","title_canon_sha256":"85afa23d50d5247735a47f68772f94616c4b2993f31d550d9f90223209c3256f"},"schema_version":"1.0","source":{"id":"1304.4985","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.4985","created_at":"2026-05-18T03:19:01Z"},{"alias_kind":"arxiv_version","alias_value":"1304.4985v2","created_at":"2026-05-18T03:19:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4985","created_at":"2026-05-18T03:19:01Z"},{"alias_kind":"pith_short_12","alias_value":"YUWTUG3LEF56","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YUWTUG3LEF56TZKP","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YUWTUG3L","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:e4955d8ee0bec6f2c329ca8f2f0be4297063cc2501479d4fccb293f8b6dd1415","target":"graph","created_at":"2026-05-18T03:19:01Z","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"},"paper":{"abstract_excerpt":"Given a simplicial complex K with weights on its simplices and a chain on it, the Optimal Homologous Chain Problem (OHCP) is to find a chain with minimal weight that is homologous (over the integers) to the given chain. The OHCP is NP-complete, but if the boundary matrix of K is totally unimodular (TU), it becomes solvable in polynomial time when modeled as a linear program (LP). We define a condition on the simplicial complex called non total-unimodularity neutralized, or NTU neutralized, which ensures that even when the boundary matrix is not TU, the OHCP LP must contain an integral optimal ","authors_text":"Bala Krishnamoorthy, Gavin Smith","cross_cats":["cs.CG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2013-04-17T22:48:56Z","title":"Non Total-Unimodularity Neutralized Simplicial Complexes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4985","kind":"arxiv","version":2},"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:04b70bded098bc12371faccf4312bfb8904c0f477a07bc0cc703fc57d29d67a1","target":"record","created_at":"2026-05-18T03:19:01Z","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":"90910c468bd3399d187f1840ab2d01b8271264dcd0ff4386280d2689594d8781","cross_cats_sorted":["cs.CG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2013-04-17T22:48:56Z","title_canon_sha256":"85afa23d50d5247735a47f68772f94616c4b2993f31d550d9f90223209c3256f"},"schema_version":"1.0","source":{"id":"1304.4985","kind":"arxiv","version":2}},"canonical_sha256":"c52d3a1b6b217be9e54f2ecbc2725f2aa078173ea303ed7d423ff91e2209888d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c52d3a1b6b217be9e54f2ecbc2725f2aa078173ea303ed7d423ff91e2209888d","first_computed_at":"2026-05-18T03:19:01.153013Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:01.153013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9QL+Qppu0vS5ZVovA5od+eQnsnpxYm4W7OXLx5nZ84Lq3y2n4kkGFUKASgphDBvNxbvEOIDrmT5nPmPv+rJOCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:01.153765Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.4985","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04b70bded098bc12371faccf4312bfb8904c0f477a07bc0cc703fc57d29d67a1","sha256:e4955d8ee0bec6f2c329ca8f2f0be4297063cc2501479d4fccb293f8b6dd1415"],"state_sha256":"28fa3127b9f69e433590881163cb359e98a9a79bc0e2c75035fa418ceabbdd66"}