{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:Q6ULSIDH5VS4F46HASJHDJ7GL2","short_pith_number":"pith:Q6ULSIDH","schema_version":"1.0","canonical_sha256":"87a8b92067ed65c2f3c7049271a7e65ea11eab51f9ae9e0cfefd431fcf51aadc","source":{"kind":"arxiv","id":"math/0604584","version":1},"attestation_state":"computed","paper":{"title":"Enumeration of non-orientable 3-manifolds using face pairing graphs and union-find","license":"","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"math.GT","authors_text":"Benjamin A. Burton","submitted_at":"2006-04-27T06:19:44Z","abstract_excerpt":"Drawing together techniques from combinatorics and computer science, we improve the census algorithm for enumerating closed minimal P^2-irreducible 3-manifold triangulations. In particular, new constraints are proven for face pairing graphs, and pruning techniques are improved using a modification of the union-find algorithm. Using these results we catalogue all 136 closed non-orientable P^2-irreducible 3-manifolds that can be formed from at most ten tetrahedra."},"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/0604584","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.GT","submitted_at":"2006-04-27T06:19:44Z","cross_cats_sorted":["cs.CG","math.CO"],"title_canon_sha256":"7969c9009ed0dedbb31c44ba157bef1f1d73d75ec61963d51297f65d49a4790d","abstract_canon_sha256":"1a3665ac6b9c52773d29696b8a04627f789626b8a9b560fb80b75e8935dd93c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:29.534215Z","signature_b64":"Otj+WpV9kZOzvV5fIAYU6XizHXXdsi0m05ZNJecLsJqpItfFPY8XHZI6Qavpiy1+gHdJn+PA0KtVOCHGUZNwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87a8b92067ed65c2f3c7049271a7e65ea11eab51f9ae9e0cfefd431fcf51aadc","last_reissued_at":"2026-05-18T04:07:29.533721Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:29.533721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumeration of non-orientable 3-manifolds using face pairing graphs and union-find","license":"","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"math.GT","authors_text":"Benjamin A. Burton","submitted_at":"2006-04-27T06:19:44Z","abstract_excerpt":"Drawing together techniques from combinatorics and computer science, we improve the census algorithm for enumerating closed minimal P^2-irreducible 3-manifold triangulations. In particular, new constraints are proven for face pairing graphs, and pruning techniques are improved using a modification of the union-find algorithm. Using these results we catalogue all 136 closed non-orientable P^2-irreducible 3-manifolds that can be formed from at most ten tetrahedra."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0604584","kind":"arxiv","version":1},"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/0604584","created_at":"2026-05-18T04:07:29.533797+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0604584v1","created_at":"2026-05-18T04:07:29.533797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0604584","created_at":"2026-05-18T04:07:29.533797+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q6ULSIDH5VS4","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q6ULSIDH5VS4F46H","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q6ULSIDH","created_at":"2026-05-18T12:25:54.717736+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/Q6ULSIDH5VS4F46HASJHDJ7GL2","json":"https://pith.science/pith/Q6ULSIDH5VS4F46HASJHDJ7GL2.json","graph_json":"https://pith.science/api/pith-number/Q6ULSIDH5VS4F46HASJHDJ7GL2/graph.json","events_json":"https://pith.science/api/pith-number/Q6ULSIDH5VS4F46HASJHDJ7GL2/events.json","paper":"https://pith.science/paper/Q6ULSIDH"},"agent_actions":{"view_html":"https://pith.science/pith/Q6ULSIDH5VS4F46HASJHDJ7GL2","download_json":"https://pith.science/pith/Q6ULSIDH5VS4F46HASJHDJ7GL2.json","view_paper":"https://pith.science/paper/Q6ULSIDH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0604584&json=true","fetch_graph":"https://pith.science/api/pith-number/Q6ULSIDH5VS4F46HASJHDJ7GL2/graph.json","fetch_events":"https://pith.science/api/pith-number/Q6ULSIDH5VS4F46HASJHDJ7GL2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q6ULSIDH5VS4F46HASJHDJ7GL2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q6ULSIDH5VS4F46HASJHDJ7GL2/action/storage_attestation","attest_author":"https://pith.science/pith/Q6ULSIDH5VS4F46HASJHDJ7GL2/action/author_attestation","sign_citation":"https://pith.science/pith/Q6ULSIDH5VS4F46HASJHDJ7GL2/action/citation_signature","submit_replication":"https://pith.science/pith/Q6ULSIDH5VS4F46HASJHDJ7GL2/action/replication_record"}},"created_at":"2026-05-18T04:07:29.533797+00:00","updated_at":"2026-05-18T04:07:29.533797+00:00"}