{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TXSSTMV7NU456KSF26UIQ64TAC","short_pith_number":"pith:TXSSTMV7","schema_version":"1.0","canonical_sha256":"9de529b2bf6d39df2a45d7a8887b9300833d873d67627c0843e1e996303a0fe2","source":{"kind":"arxiv","id":"1402.3876","version":2},"attestation_state":"computed","paper":{"title":"Fixed parameter tractable algorithms in combinatorial topology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.GT","authors_text":"Benjamin A. Burton, William Pettersson","submitted_at":"2014-02-17T03:06:07Z","abstract_excerpt":"To enumerate 3-manifold triangulations with a given property, one typically begins with a set of potential face pairing graphs (also known as dual 1-skeletons), and then attempts to flesh each graph out into full triangulations using an exponential-time enumeration. However, asymptotically most graphs do not result in any 3-manifold triangulation, which leads to significant \"wasted time\" in topological enumeration algorithms. Here we give a new algorithm to determine whether a given face pairing graph supports any 3-manifold triangulation, and show this to be fixed parameter tractable in the t"},"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":"1402.3876","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2014-02-17T03:06:07Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"5fe0403880d1c367fec7b9f9c76bcc5f21cada2dcbf6c73d75650f8fdb920c1d","abstract_canon_sha256":"636420e4aa364783b437d8c65c81ddb2f6e197dc53ce05aaf858e5137c05f00c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:39.193298Z","signature_b64":"0DZknvp7QLVFzekhyeSdWhD+mKITNs0z5bcbLrz/6UF+D+0sDWFgTMIFAs2tMHdvOUCL/JQv5VCzm+JF4ebgAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9de529b2bf6d39df2a45d7a8887b9300833d873d67627c0843e1e996303a0fe2","last_reissued_at":"2026-05-18T02:46:39.192738Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:39.192738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fixed parameter tractable algorithms in combinatorial topology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.GT","authors_text":"Benjamin A. Burton, William Pettersson","submitted_at":"2014-02-17T03:06:07Z","abstract_excerpt":"To enumerate 3-manifold triangulations with a given property, one typically begins with a set of potential face pairing graphs (also known as dual 1-skeletons), and then attempts to flesh each graph out into full triangulations using an exponential-time enumeration. However, asymptotically most graphs do not result in any 3-manifold triangulation, which leads to significant \"wasted time\" in topological enumeration algorithms. Here we give a new algorithm to determine whether a given face pairing graph supports any 3-manifold triangulation, and show this to be fixed parameter tractable in the t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3876","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":"1402.3876","created_at":"2026-05-18T02:46:39.192812+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.3876v2","created_at":"2026-05-18T02:46:39.192812+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3876","created_at":"2026-05-18T02:46:39.192812+00:00"},{"alias_kind":"pith_short_12","alias_value":"TXSSTMV7NU45","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"TXSSTMV7NU456KSF","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"TXSSTMV7","created_at":"2026-05-18T12:28:52.271510+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/TXSSTMV7NU456KSF26UIQ64TAC","json":"https://pith.science/pith/TXSSTMV7NU456KSF26UIQ64TAC.json","graph_json":"https://pith.science/api/pith-number/TXSSTMV7NU456KSF26UIQ64TAC/graph.json","events_json":"https://pith.science/api/pith-number/TXSSTMV7NU456KSF26UIQ64TAC/events.json","paper":"https://pith.science/paper/TXSSTMV7"},"agent_actions":{"view_html":"https://pith.science/pith/TXSSTMV7NU456KSF26UIQ64TAC","download_json":"https://pith.science/pith/TXSSTMV7NU456KSF26UIQ64TAC.json","view_paper":"https://pith.science/paper/TXSSTMV7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.3876&json=true","fetch_graph":"https://pith.science/api/pith-number/TXSSTMV7NU456KSF26UIQ64TAC/graph.json","fetch_events":"https://pith.science/api/pith-number/TXSSTMV7NU456KSF26UIQ64TAC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TXSSTMV7NU456KSF26UIQ64TAC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TXSSTMV7NU456KSF26UIQ64TAC/action/storage_attestation","attest_author":"https://pith.science/pith/TXSSTMV7NU456KSF26UIQ64TAC/action/author_attestation","sign_citation":"https://pith.science/pith/TXSSTMV7NU456KSF26UIQ64TAC/action/citation_signature","submit_replication":"https://pith.science/pith/TXSSTMV7NU456KSF26UIQ64TAC/action/replication_record"}},"created_at":"2026-05-18T02:46:39.192812+00:00","updated_at":"2026-05-18T02:46:39.192812+00:00"}