{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:C2VJ2R2RSAVFMPSJZPYDQYU7QL","short_pith_number":"pith:C2VJ2R2R","canonical_record":{"source":{"id":"1101.3091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2011-01-16T20:58:40Z","cross_cats_sorted":["cs.CG","math.CO"],"title_canon_sha256":"6a061ab19049f6abea15b27ab2058104b0482727c33a6b391f7b51ce1e1e881c","abstract_canon_sha256":"4db31ab51d83f61114e5ede4fa112022bbfe26ce69eff690dd4656fdacf81647"},"schema_version":"1.0"},"canonical_sha256":"16aa9d4751902a563e49cbf038629f82d61d33e827ade0233fa1597fa083e366","source":{"kind":"arxiv","id":"1101.3091","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3091","created_at":"2026-05-18T02:22:52Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3091v2","created_at":"2026-05-18T02:22:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3091","created_at":"2026-05-18T02:22:52Z"},{"alias_kind":"pith_short_12","alias_value":"C2VJ2R2RSAVF","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"C2VJ2R2RSAVFMPSJ","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"C2VJ2R2R","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:C2VJ2R2RSAVFMPSJZPYDQYU7QL","target":"record","payload":{"canonical_record":{"source":{"id":"1101.3091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2011-01-16T20:58:40Z","cross_cats_sorted":["cs.CG","math.CO"],"title_canon_sha256":"6a061ab19049f6abea15b27ab2058104b0482727c33a6b391f7b51ce1e1e881c","abstract_canon_sha256":"4db31ab51d83f61114e5ede4fa112022bbfe26ce69eff690dd4656fdacf81647"},"schema_version":"1.0"},"canonical_sha256":"16aa9d4751902a563e49cbf038629f82d61d33e827ade0233fa1597fa083e366","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:52.190811Z","signature_b64":"MRQlqHD67yyHGYmDKd2jyR+4MV2qx2KovQqZMN/fPeYi5LyYJYePAYHcaMnwZMHVjTiKm+m+5Bi462OAX0ohCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16aa9d4751902a563e49cbf038629f82d61d33e827ade0233fa1597fa083e366","last_reissued_at":"2026-05-18T02:22:52.190274Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:52.190274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.3091","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:22:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MqeXBhmpscExzhzXMKIIjA9x9JzuGpW7QLGQejamT+motrW/ZtfeV1WF7Nd8Lh4xxAZvR6Qsy4oUaYB+VS9PBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:56:57.834902Z"},"content_sha256":"f06c0170fd593d4e3dfda99aa859676756fee662d34b8826a3dfb550332d757a","schema_version":"1.0","event_id":"sha256:f06c0170fd593d4e3dfda99aa859676756fee662d34b8826a3dfb550332d757a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:C2VJ2R2RSAVFMPSJZPYDQYU7QL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Detecting genus in vertex links for the fast enumeration of 3-manifold triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"math.GT","authors_text":"Benjamin A. Burton","submitted_at":"2011-01-16T20:58:40Z","abstract_excerpt":"Enumerating all 3-manifold triangulations of a given size is a difficult but increasingly important problem in computational topology. A key difficulty for enumeration algorithms is that most combinatorial triangulations must be discarded because they do not represent topological 3-manifolds. In this paper we show how to preempt bad triangulations by detecting genus in partially-constructed vertex links, allowing us to prune the enumeration tree substantially.\n  The key idea is to manipulate the boundary edges surrounding partial vertex links using expected logarithmic time operations. Practic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3091","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:22:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hCykexap8hF3H2WrUOJNytHJ5asTaxTTsUK8EAd5RSc4Nrk0qUD2S8SwOwQlhVibqcLNAaaIR1I1pdA9ndChDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:56:57.835701Z"},"content_sha256":"bbfdbfaef4c5b1cbeb4525f8a620f683d5bc2e2d04492b59e71cf3be159a5b97","schema_version":"1.0","event_id":"sha256:bbfdbfaef4c5b1cbeb4525f8a620f683d5bc2e2d04492b59e71cf3be159a5b97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C2VJ2R2RSAVFMPSJZPYDQYU7QL/bundle.json","state_url":"https://pith.science/pith/C2VJ2R2RSAVFMPSJZPYDQYU7QL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C2VJ2R2RSAVFMPSJZPYDQYU7QL/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-12T00:56:57Z","links":{"resolver":"https://pith.science/pith/C2VJ2R2RSAVFMPSJZPYDQYU7QL","bundle":"https://pith.science/pith/C2VJ2R2RSAVFMPSJZPYDQYU7QL/bundle.json","state":"https://pith.science/pith/C2VJ2R2RSAVFMPSJZPYDQYU7QL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C2VJ2R2RSAVFMPSJZPYDQYU7QL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:C2VJ2R2RSAVFMPSJZPYDQYU7QL","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":"4db31ab51d83f61114e5ede4fa112022bbfe26ce69eff690dd4656fdacf81647","cross_cats_sorted":["cs.CG","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2011-01-16T20:58:40Z","title_canon_sha256":"6a061ab19049f6abea15b27ab2058104b0482727c33a6b391f7b51ce1e1e881c"},"schema_version":"1.0","source":{"id":"1101.3091","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3091","created_at":"2026-05-18T02:22:52Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3091v2","created_at":"2026-05-18T02:22:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3091","created_at":"2026-05-18T02:22:52Z"},{"alias_kind":"pith_short_12","alias_value":"C2VJ2R2RSAVF","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"C2VJ2R2RSAVFMPSJ","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"C2VJ2R2R","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:bbfdbfaef4c5b1cbeb4525f8a620f683d5bc2e2d04492b59e71cf3be159a5b97","target":"graph","created_at":"2026-05-18T02:22:52Z","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":"Enumerating all 3-manifold triangulations of a given size is a difficult but increasingly important problem in computational topology. A key difficulty for enumeration algorithms is that most combinatorial triangulations must be discarded because they do not represent topological 3-manifolds. In this paper we show how to preempt bad triangulations by detecting genus in partially-constructed vertex links, allowing us to prune the enumeration tree substantially.\n  The key idea is to manipulate the boundary edges surrounding partial vertex links using expected logarithmic time operations. Practic","authors_text":"Benjamin A. Burton","cross_cats":["cs.CG","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2011-01-16T20:58:40Z","title":"Detecting genus in vertex links for the fast enumeration of 3-manifold triangulations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3091","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:f06c0170fd593d4e3dfda99aa859676756fee662d34b8826a3dfb550332d757a","target":"record","created_at":"2026-05-18T02:22:52Z","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":"4db31ab51d83f61114e5ede4fa112022bbfe26ce69eff690dd4656fdacf81647","cross_cats_sorted":["cs.CG","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2011-01-16T20:58:40Z","title_canon_sha256":"6a061ab19049f6abea15b27ab2058104b0482727c33a6b391f7b51ce1e1e881c"},"schema_version":"1.0","source":{"id":"1101.3091","kind":"arxiv","version":2}},"canonical_sha256":"16aa9d4751902a563e49cbf038629f82d61d33e827ade0233fa1597fa083e366","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16aa9d4751902a563e49cbf038629f82d61d33e827ade0233fa1597fa083e366","first_computed_at":"2026-05-18T02:22:52.190274Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:52.190274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MRQlqHD67yyHGYmDKd2jyR+4MV2qx2KovQqZMN/fPeYi5LyYJYePAYHcaMnwZMHVjTiKm+m+5Bi462OAX0ohCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:52.190811Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.3091","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f06c0170fd593d4e3dfda99aa859676756fee662d34b8826a3dfb550332d757a","sha256:bbfdbfaef4c5b1cbeb4525f8a620f683d5bc2e2d04492b59e71cf3be159a5b97"],"state_sha256":"314c0e44f1bc55b716eed18b23ad98681a0a10bbba80bd8ac44664b548cf8d96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PN9bReqQ4n87Kir1RMEM6ku2NFvGQHuAAOeaIU8KJis4z5dFvbNRsps9Rgyyh094e9PXYRyblhnSO+jTNh6QAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T00:56:57.840054Z","bundle_sha256":"3506db712dc8a7e9aa87d3ada94a8979e18a8ec5611bb35bea37212d8a4c933e"}}