{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YUWTUG3LEF56TZKPF3F4E4S7FK","short_pith_number":"pith:YUWTUG3L","schema_version":"1.0","canonical_sha256":"c52d3a1b6b217be9e54f2ecbc2725f2aa078173ea303ed7d423ff91e2209888d","source":{"kind":"arxiv","id":"1304.4985","version":2},"attestation_state":"computed","paper":{"title":"Non Total-Unimodularity Neutralized Simplicial Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.OC"],"primary_cat":"math.AT","authors_text":"Bala Krishnamoorthy, Gavin Smith","submitted_at":"2013-04-17T22:48:56Z","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 "},"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":"1304.4985","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2013-04-17T22:48:56Z","cross_cats_sorted":["cs.CG","math.OC"],"title_canon_sha256":"85afa23d50d5247735a47f68772f94616c4b2993f31d550d9f90223209c3256f","abstract_canon_sha256":"90910c468bd3399d187f1840ab2d01b8271264dcd0ff4386280d2689594d8781"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:01.153765Z","signature_b64":"9QL+Qppu0vS5ZVovA5od+eQnsnpxYm4W7OXLx5nZ84Lq3y2n4kkGFUKASgphDBvNxbvEOIDrmT5nPmPv+rJOCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c52d3a1b6b217be9e54f2ecbc2725f2aa078173ea303ed7d423ff91e2209888d","last_reissued_at":"2026-05-18T03:19:01.153013Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:01.153013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non Total-Unimodularity Neutralized Simplicial Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.OC"],"primary_cat":"math.AT","authors_text":"Bala Krishnamoorthy, Gavin Smith","submitted_at":"2013-04-17T22:48:56Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4985","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1304.4985","created_at":"2026-05-18T03:19:01.153111+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.4985v2","created_at":"2026-05-18T03:19:01.153111+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4985","created_at":"2026-05-18T03:19:01.153111+00:00"},{"alias_kind":"pith_short_12","alias_value":"YUWTUG3LEF56","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"YUWTUG3LEF56TZKP","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"YUWTUG3L","created_at":"2026-05-18T12:28:09.283467+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/YUWTUG3LEF56TZKPF3F4E4S7FK","json":"https://pith.science/pith/YUWTUG3LEF56TZKPF3F4E4S7FK.json","graph_json":"https://pith.science/api/pith-number/YUWTUG3LEF56TZKPF3F4E4S7FK/graph.json","events_json":"https://pith.science/api/pith-number/YUWTUG3LEF56TZKPF3F4E4S7FK/events.json","paper":"https://pith.science/paper/YUWTUG3L"},"agent_actions":{"view_html":"https://pith.science/pith/YUWTUG3LEF56TZKPF3F4E4S7FK","download_json":"https://pith.science/pith/YUWTUG3LEF56TZKPF3F4E4S7FK.json","view_paper":"https://pith.science/paper/YUWTUG3L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.4985&json=true","fetch_graph":"https://pith.science/api/pith-number/YUWTUG3LEF56TZKPF3F4E4S7FK/graph.json","fetch_events":"https://pith.science/api/pith-number/YUWTUG3LEF56TZKPF3F4E4S7FK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YUWTUG3LEF56TZKPF3F4E4S7FK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YUWTUG3LEF56TZKPF3F4E4S7FK/action/storage_attestation","attest_author":"https://pith.science/pith/YUWTUG3LEF56TZKPF3F4E4S7FK/action/author_attestation","sign_citation":"https://pith.science/pith/YUWTUG3LEF56TZKPF3F4E4S7FK/action/citation_signature","submit_replication":"https://pith.science/pith/YUWTUG3LEF56TZKPF3F4E4S7FK/action/replication_record"}},"created_at":"2026-05-18T03:19:01.153111+00:00","updated_at":"2026-05-18T03:19:01.153111+00:00"}