{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:XY2XB7RJLLBYVOUV4OM3AGGF46","short_pith_number":"pith:XY2XB7RJ","canonical_record":{"source":{"id":"1010.6200","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2010-10-29T13:13:02Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"540c38241002184de8353805240a7a7a05545a5ad693660ff4d478ac272e2a65","abstract_canon_sha256":"a5bbfe1ae2fda84e5a5f210265369d7eeb507212178e74a0380a986e6916347f"},"schema_version":"1.0"},"canonical_sha256":"be3570fe295ac38aba95e399b018c5e78e618f0527ae22a25bc86725bd74904b","source":{"kind":"arxiv","id":"1010.6200","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.6200","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"arxiv_version","alias_value":"1010.6200v2","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.6200","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"pith_short_12","alias_value":"XY2XB7RJLLBY","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XY2XB7RJLLBYVOUV","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XY2XB7RJ","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:XY2XB7RJLLBYVOUV4OM3AGGF46","target":"record","payload":{"canonical_record":{"source":{"id":"1010.6200","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2010-10-29T13:13:02Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"540c38241002184de8353805240a7a7a05545a5ad693660ff4d478ac272e2a65","abstract_canon_sha256":"a5bbfe1ae2fda84e5a5f210265369d7eeb507212178e74a0380a986e6916347f"},"schema_version":"1.0"},"canonical_sha256":"be3570fe295ac38aba95e399b018c5e78e618f0527ae22a25bc86725bd74904b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:38.137715Z","signature_b64":"RKT6IYq+nxb6jiSCGLp+dHd8gdAP9ZcGOlQUesmhrQvNAPf042au0i6eoCIWpCJAn+AJH5JJDR+t4qXxVPXjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be3570fe295ac38aba95e399b018c5e78e618f0527ae22a25bc86725bd74904b","last_reissued_at":"2026-05-18T03:33:38.136902Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:38.136902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.6200","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-18T03:33:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KgSP5CA02AC6YrGvWTrLuwrMg894s5L6i5DPjdoGwwUUX5kyMM4/31mMzWAxqyhVp1wiAsz1ypNnBWPZUsYCBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:32:11.288786Z"},"content_sha256":"e50e46d20117899b784b66dea82a7fb4958327b7a0fae2ba0d7772325caf1371","schema_version":"1.0","event_id":"sha256:e50e46d20117899b784b66dea82a7fb4958327b7a0fae2ba0d7772325caf1371"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:XY2XB7RJLLBYVOUV4OM3AGGF46","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A tree traversal algorithm for decision problems in knot theory and 3-manifold topology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.GT","authors_text":"Benjamin A. Burton, Melih Ozlen","submitted_at":"2010-10-29T13:13:02Z","abstract_excerpt":"In low-dimensional topology, many important decision algorithms are based on normal surface enumeration, which is a form of vertex enumeration over a high-dimensional and highly degenerate polytope. Because this enumeration is subject to extra combinatorial constraints, the only practical algorithms to date have been variants of the classical double description method. In this paper we present the first practical normal surface enumeration algorithm that breaks out of the double description paradigm. This new algorithm is based on a tree traversal with feasibility and domination tests, and it "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.6200","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-18T03:33:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FVfxmPw2WiQmt54ZdtDHxWO9LFHe1yLKzAltBGcVm9ifXbnp+/TIGtS/75/f+BLCLQKF8Ml4TdSLFpY589KbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:32:11.289447Z"},"content_sha256":"a9a990e1387b9bcf6230bb60463f2b0f50b8a8d5fd939bb312769e8e6dc57905","schema_version":"1.0","event_id":"sha256:a9a990e1387b9bcf6230bb60463f2b0f50b8a8d5fd939bb312769e8e6dc57905"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XY2XB7RJLLBYVOUV4OM3AGGF46/bundle.json","state_url":"https://pith.science/pith/XY2XB7RJLLBYVOUV4OM3AGGF46/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XY2XB7RJLLBYVOUV4OM3AGGF46/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:11Z","links":{"resolver":"https://pith.science/pith/XY2XB7RJLLBYVOUV4OM3AGGF46","bundle":"https://pith.science/pith/XY2XB7RJLLBYVOUV4OM3AGGF46/bundle.json","state":"https://pith.science/pith/XY2XB7RJLLBYVOUV4OM3AGGF46/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XY2XB7RJLLBYVOUV4OM3AGGF46/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:XY2XB7RJLLBYVOUV4OM3AGGF46","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":"a5bbfe1ae2fda84e5a5f210265369d7eeb507212178e74a0380a986e6916347f","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2010-10-29T13:13:02Z","title_canon_sha256":"540c38241002184de8353805240a7a7a05545a5ad693660ff4d478ac272e2a65"},"schema_version":"1.0","source":{"id":"1010.6200","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.6200","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"arxiv_version","alias_value":"1010.6200v2","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.6200","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"pith_short_12","alias_value":"XY2XB7RJLLBY","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XY2XB7RJLLBYVOUV","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XY2XB7RJ","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:a9a990e1387b9bcf6230bb60463f2b0f50b8a8d5fd939bb312769e8e6dc57905","target":"graph","created_at":"2026-05-18T03:33:38Z","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":"In low-dimensional topology, many important decision algorithms are based on normal surface enumeration, which is a form of vertex enumeration over a high-dimensional and highly degenerate polytope. Because this enumeration is subject to extra combinatorial constraints, the only practical algorithms to date have been variants of the classical double description method. In this paper we present the first practical normal surface enumeration algorithm that breaks out of the double description paradigm. This new algorithm is based on a tree traversal with feasibility and domination tests, and it ","authors_text":"Benjamin A. Burton, Melih Ozlen","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2010-10-29T13:13:02Z","title":"A tree traversal algorithm for decision problems in knot theory and 3-manifold topology"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.6200","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:e50e46d20117899b784b66dea82a7fb4958327b7a0fae2ba0d7772325caf1371","target":"record","created_at":"2026-05-18T03:33:38Z","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":"a5bbfe1ae2fda84e5a5f210265369d7eeb507212178e74a0380a986e6916347f","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2010-10-29T13:13:02Z","title_canon_sha256":"540c38241002184de8353805240a7a7a05545a5ad693660ff4d478ac272e2a65"},"schema_version":"1.0","source":{"id":"1010.6200","kind":"arxiv","version":2}},"canonical_sha256":"be3570fe295ac38aba95e399b018c5e78e618f0527ae22a25bc86725bd74904b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be3570fe295ac38aba95e399b018c5e78e618f0527ae22a25bc86725bd74904b","first_computed_at":"2026-05-18T03:33:38.136902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:38.136902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RKT6IYq+nxb6jiSCGLp+dHd8gdAP9ZcGOlQUesmhrQvNAPf042au0i6eoCIWpCJAn+AJH5JJDR+t4qXxVPXjCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:38.137715Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.6200","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e50e46d20117899b784b66dea82a7fb4958327b7a0fae2ba0d7772325caf1371","sha256:a9a990e1387b9bcf6230bb60463f2b0f50b8a8d5fd939bb312769e8e6dc57905"],"state_sha256":"38eb8de91792b93ac9a003e7e84cc8b7e41e75a1ef6c426a9f2babaacdbf0250"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iAm8rwFLLjFFaa0aowavlTd3/lOMxQJMIn01CuGeRrVEXBsebFNTiQpJbr8Snb5G92KcNMujxraZAm8om3PUCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:32:11.296561Z","bundle_sha256":"029ec6c27c3074c3bc927bc0e1c385dc414cc5fe578bff47d504cf33e2bc30e1"}}