{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TXSSTMV7NU456KSF26UIQ64TAC","short_pith_number":"pith:TXSSTMV7","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"},"canonical_sha256":"9de529b2bf6d39df2a45d7a8887b9300833d873d67627c0843e1e996303a0fe2","source":{"kind":"arxiv","id":"1402.3876","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3876","created_at":"2026-05-18T02:46:39Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3876v2","created_at":"2026-05-18T02:46:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3876","created_at":"2026-05-18T02:46:39Z"},{"alias_kind":"pith_short_12","alias_value":"TXSSTMV7NU45","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TXSSTMV7NU456KSF","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TXSSTMV7","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TXSSTMV7NU456KSF26UIQ64TAC","target":"record","payload":{"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"},"canonical_sha256":"9de529b2bf6d39df2a45d7a8887b9300833d873d67627c0843e1e996303a0fe2","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"},"source_kind":"arxiv","source_id":"1402.3876","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:46:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eS1lZ/qOMdSBZm59+TeuVRrcSgvjBdVrz+ddP1f+QdyOzh1GglDKiN1vXaGBkRS0QT6HnH7AkW+OLhhV9CBgBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:32:20.303573Z"},"content_sha256":"d2d40101becbd3801e417a53a3f5fb502272371139bed7868f57ac55608f041f","schema_version":"1.0","event_id":"sha256:d2d40101becbd3801e417a53a3f5fb502272371139bed7868f57ac55608f041f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TXSSTMV7NU456KSF26UIQ64TAC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:46:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+k8GkoeMsSIjohaFkJfxgMB8Cgosjg2NkM3Gtt5YphNFkewcVzdhcv1WiZffbCh3ws3zbgElwZxjKEa7wOqiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:32:20.304329Z"},"content_sha256":"b0423a696fa1ff93049af7537374c10d0d599df6796e5d8a870e1669e05aeac9","schema_version":"1.0","event_id":"sha256:b0423a696fa1ff93049af7537374c10d0d599df6796e5d8a870e1669e05aeac9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TXSSTMV7NU456KSF26UIQ64TAC/bundle.json","state_url":"https://pith.science/pith/TXSSTMV7NU456KSF26UIQ64TAC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TXSSTMV7NU456KSF26UIQ64TAC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T23:32:20Z","links":{"resolver":"https://pith.science/pith/TXSSTMV7NU456KSF26UIQ64TAC","bundle":"https://pith.science/pith/TXSSTMV7NU456KSF26UIQ64TAC/bundle.json","state":"https://pith.science/pith/TXSSTMV7NU456KSF26UIQ64TAC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TXSSTMV7NU456KSF26UIQ64TAC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TXSSTMV7NU456KSF26UIQ64TAC","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":"636420e4aa364783b437d8c65c81ddb2f6e197dc53ce05aaf858e5137c05f00c","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2014-02-17T03:06:07Z","title_canon_sha256":"5fe0403880d1c367fec7b9f9c76bcc5f21cada2dcbf6c73d75650f8fdb920c1d"},"schema_version":"1.0","source":{"id":"1402.3876","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3876","created_at":"2026-05-18T02:46:39Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3876v2","created_at":"2026-05-18T02:46:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3876","created_at":"2026-05-18T02:46:39Z"},{"alias_kind":"pith_short_12","alias_value":"TXSSTMV7NU45","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TXSSTMV7NU456KSF","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TXSSTMV7","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:b0423a696fa1ff93049af7537374c10d0d599df6796e5d8a870e1669e05aeac9","target":"graph","created_at":"2026-05-18T02:46:39Z","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":"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","authors_text":"Benjamin A. Burton, William Pettersson","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2014-02-17T03:06:07Z","title":"Fixed parameter tractable algorithms in combinatorial topology"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3876","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:d2d40101becbd3801e417a53a3f5fb502272371139bed7868f57ac55608f041f","target":"record","created_at":"2026-05-18T02:46:39Z","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":"636420e4aa364783b437d8c65c81ddb2f6e197dc53ce05aaf858e5137c05f00c","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2014-02-17T03:06:07Z","title_canon_sha256":"5fe0403880d1c367fec7b9f9c76bcc5f21cada2dcbf6c73d75650f8fdb920c1d"},"schema_version":"1.0","source":{"id":"1402.3876","kind":"arxiv","version":2}},"canonical_sha256":"9de529b2bf6d39df2a45d7a8887b9300833d873d67627c0843e1e996303a0fe2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9de529b2bf6d39df2a45d7a8887b9300833d873d67627c0843e1e996303a0fe2","first_computed_at":"2026-05-18T02:46:39.192738Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:39.192738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0DZknvp7QLVFzekhyeSdWhD+mKITNs0z5bcbLrz/6UF+D+0sDWFgTMIFAs2tMHdvOUCL/JQv5VCzm+JF4ebgAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:39.193298Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.3876","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2d40101becbd3801e417a53a3f5fb502272371139bed7868f57ac55608f041f","sha256:b0423a696fa1ff93049af7537374c10d0d599df6796e5d8a870e1669e05aeac9"],"state_sha256":"0a7a7808f479d95dce6c111508ac60ee8c9b9a5e284d3130d0514cc886f6ba34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jdip7ejz9Z6uQr7mUAUcdG32feIzmHAcC98nbgfuLjfSdNDneHc7tUt5utDOZpH1RsVW53qd8wl8cXxLhEPvDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:32:20.308204Z","bundle_sha256":"91ad2d30f17b6d9d084945d2e4bc6cd174a7c59cf069502676c4498f968556de"}}