{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:RNH3I4DWYZIMJOYVR5RYSUU4QF","short_pith_number":"pith:RNH3I4DW","schema_version":"1.0","canonical_sha256":"8b4fb47076c650c4bb158f6389529c817ba0d268896ad21ba10f9385c215b38b","source":{"kind":"arxiv","id":"math/0307382","version":3},"attestation_state":"computed","paper":{"title":"Face pairing graphs and 3-manifold enumeration","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GT","authors_text":"Benjamin A. Burton","submitted_at":"2003-07-30T07:07:30Z","abstract_excerpt":"The face pairing graph of a 3-manifold triangulation is a 4-valent graph denoting which tetrahedron faces are identified with which others. We present a series of properties that must be satisfied by the face pairing graph of a closed minimal P^2-irreducible triangulation. In addition we present constraints upon the combinatorial structure of such a triangulation that can be deduced from its face pairing graph. These results are then applied to the enumeration of closed minimal P^2-irreducible 3-manifold triangulations, leading to a significant improvement in the performance of the enumeration"},"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":"math/0307382","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"math.GT","submitted_at":"2003-07-30T07:07:30Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"be3957733983a2a288a383066056152e5258b5c060837f667898fdcc506c6211","abstract_canon_sha256":"22210bbdc1f2124b426049ea9b298f426c1c6792806f22873b5649f205e6273e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:54.765626Z","signature_b64":"lpVQiYmI0GFvh1fEZsy29xvCw0OTORNA3OOZqd30manjWAfwFOUniQoeKz8eLmmQMHakoXKTdr3XsOrICjFKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b4fb47076c650c4bb158f6389529c817ba0d268896ad21ba10f9385c215b38b","last_reissued_at":"2026-05-18T04:32:54.765168Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:54.765168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Face pairing graphs and 3-manifold enumeration","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GT","authors_text":"Benjamin A. Burton","submitted_at":"2003-07-30T07:07:30Z","abstract_excerpt":"The face pairing graph of a 3-manifold triangulation is a 4-valent graph denoting which tetrahedron faces are identified with which others. We present a series of properties that must be satisfied by the face pairing graph of a closed minimal P^2-irreducible triangulation. In addition we present constraints upon the combinatorial structure of such a triangulation that can be deduced from its face pairing graph. These results are then applied to the enumeration of closed minimal P^2-irreducible 3-manifold triangulations, leading to a significant improvement in the performance of the enumeration"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0307382","kind":"arxiv","version":3},"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":"math/0307382","created_at":"2026-05-18T04:32:54.765234+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0307382v3","created_at":"2026-05-18T04:32:54.765234+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0307382","created_at":"2026-05-18T04:32:54.765234+00:00"},{"alias_kind":"pith_short_12","alias_value":"RNH3I4DWYZIM","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_16","alias_value":"RNH3I4DWYZIMJOYV","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_8","alias_value":"RNH3I4DW","created_at":"2026-05-18T12:25:52.051335+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/RNH3I4DWYZIMJOYVR5RYSUU4QF","json":"https://pith.science/pith/RNH3I4DWYZIMJOYVR5RYSUU4QF.json","graph_json":"https://pith.science/api/pith-number/RNH3I4DWYZIMJOYVR5RYSUU4QF/graph.json","events_json":"https://pith.science/api/pith-number/RNH3I4DWYZIMJOYVR5RYSUU4QF/events.json","paper":"https://pith.science/paper/RNH3I4DW"},"agent_actions":{"view_html":"https://pith.science/pith/RNH3I4DWYZIMJOYVR5RYSUU4QF","download_json":"https://pith.science/pith/RNH3I4DWYZIMJOYVR5RYSUU4QF.json","view_paper":"https://pith.science/paper/RNH3I4DW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0307382&json=true","fetch_graph":"https://pith.science/api/pith-number/RNH3I4DWYZIMJOYVR5RYSUU4QF/graph.json","fetch_events":"https://pith.science/api/pith-number/RNH3I4DWYZIMJOYVR5RYSUU4QF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RNH3I4DWYZIMJOYVR5RYSUU4QF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RNH3I4DWYZIMJOYVR5RYSUU4QF/action/storage_attestation","attest_author":"https://pith.science/pith/RNH3I4DWYZIMJOYVR5RYSUU4QF/action/author_attestation","sign_citation":"https://pith.science/pith/RNH3I4DWYZIMJOYVR5RYSUU4QF/action/citation_signature","submit_replication":"https://pith.science/pith/RNH3I4DWYZIMJOYVR5RYSUU4QF/action/replication_record"}},"created_at":"2026-05-18T04:32:54.765234+00:00","updated_at":"2026-05-18T04:32:54.765234+00:00"}