{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KUCPMCYFD4X5M7DYO6VNROMFES","short_pith_number":"pith:KUCPMCYF","canonical_record":{"source":{"id":"1211.3234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2012-11-14T08:23:03Z","cross_cats_sorted":["cs.CG","math.CO"],"title_canon_sha256":"61a4bc27eb1cc34d222c2a37ae4d8681f00dcee36c85d88ff43cf56d55eb6225","abstract_canon_sha256":"b3fbf5ccc86fee97f03e94546ce6bfab266d4fa3fb238bf88d9993ea3c120c0d"},"schema_version":"1.0"},"canonical_sha256":"5504f60b051f2fd67c7877aad8b98524889529958a3803cb09dc6c5bc39b62d6","source":{"kind":"arxiv","id":"1211.3234","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3234","created_at":"2026-05-18T00:02:36Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3234v1","created_at":"2026-05-18T00:02:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3234","created_at":"2026-05-18T00:02:36Z"},{"alias_kind":"pith_short_12","alias_value":"KUCPMCYFD4X5","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KUCPMCYFD4X5M7DY","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KUCPMCYF","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KUCPMCYFD4X5M7DYO6VNROMFES","target":"record","payload":{"canonical_record":{"source":{"id":"1211.3234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2012-11-14T08:23:03Z","cross_cats_sorted":["cs.CG","math.CO"],"title_canon_sha256":"61a4bc27eb1cc34d222c2a37ae4d8681f00dcee36c85d88ff43cf56d55eb6225","abstract_canon_sha256":"b3fbf5ccc86fee97f03e94546ce6bfab266d4fa3fb238bf88d9993ea3c120c0d"},"schema_version":"1.0"},"canonical_sha256":"5504f60b051f2fd67c7877aad8b98524889529958a3803cb09dc6c5bc39b62d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:36.991588Z","signature_b64":"U7UrAQ3R90T53UIqlzOEdS2qdxoIlGXhl2SQAXihTkeClb+yPFL+R1ZQPDLCSGWD8H7rUGhM7mQ/PG1eCJ1QDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5504f60b051f2fd67c7877aad8b98524889529958a3803cb09dc6c5bc39b62d6","last_reissued_at":"2026-05-18T00:02:36.990994Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:36.990994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.3234","source_version":1,"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-18T00:02:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LOyHy9aSrmtqiW409DcwNBcOoalYMSc92JdQVIsjFWrbI1lNq+XwLQwXvX2oZZ6GAKD0AK0gWn7yl06w3SxQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:53:01.712888Z"},"content_sha256":"962a7d596667910af3483afaf91045f6d859f16ac3e3393d929ffa64abd5a375","schema_version":"1.0","event_id":"sha256:962a7d596667910af3483afaf91045f6d859f16ac3e3393d929ffa64abd5a375"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KUCPMCYFD4X5M7DYO6VNROMFES","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational topology and normal surfaces: Theoretical and experimental complexity bounds","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, Jo\\~ao Paix\\~ao, Jonathan Spreer","submitted_at":"2012-11-14T08:23:03Z","abstract_excerpt":"In three-dimensional computational topology, the theory of normal surfaces is a tool of great theoretical and practical significance. Although this theory typically leads to exponential time algorithms, very little is known about how these algorithms perform in \"typical\" scenarios, or how far the best known theoretical bounds are from the real worst-case scenarios. Here we study the combinatorial and algebraic complexity of normal surfaces from both the theoretical and experimental viewpoints. Theoretically, we obtain new exponential lower bounds on the worst-case complexities in a variety of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3234","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"},"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-18T00:02:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VuRNYHAEqTrtVCNfkHY4TuYBPXz+4w9+7MJ3yXE8W9lHSYFZ9JyQRr9g5n7akxWg/3ALVZq+iO9Fv05T+lr+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:53:01.713619Z"},"content_sha256":"18719eed57eccd0b850a90348ff5036782ce8867c1b2da18ab83fafb32ead60e","schema_version":"1.0","event_id":"sha256:18719eed57eccd0b850a90348ff5036782ce8867c1b2da18ab83fafb32ead60e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KUCPMCYFD4X5M7DYO6VNROMFES/bundle.json","state_url":"https://pith.science/pith/KUCPMCYFD4X5M7DYO6VNROMFES/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KUCPMCYFD4X5M7DYO6VNROMFES/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-05-31T23:53:01Z","links":{"resolver":"https://pith.science/pith/KUCPMCYFD4X5M7DYO6VNROMFES","bundle":"https://pith.science/pith/KUCPMCYFD4X5M7DYO6VNROMFES/bundle.json","state":"https://pith.science/pith/KUCPMCYFD4X5M7DYO6VNROMFES/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KUCPMCYFD4X5M7DYO6VNROMFES/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KUCPMCYFD4X5M7DYO6VNROMFES","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":"b3fbf5ccc86fee97f03e94546ce6bfab266d4fa3fb238bf88d9993ea3c120c0d","cross_cats_sorted":["cs.CG","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2012-11-14T08:23:03Z","title_canon_sha256":"61a4bc27eb1cc34d222c2a37ae4d8681f00dcee36c85d88ff43cf56d55eb6225"},"schema_version":"1.0","source":{"id":"1211.3234","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3234","created_at":"2026-05-18T00:02:36Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3234v1","created_at":"2026-05-18T00:02:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3234","created_at":"2026-05-18T00:02:36Z"},{"alias_kind":"pith_short_12","alias_value":"KUCPMCYFD4X5","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KUCPMCYFD4X5M7DY","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KUCPMCYF","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:18719eed57eccd0b850a90348ff5036782ce8867c1b2da18ab83fafb32ead60e","target":"graph","created_at":"2026-05-18T00:02:36Z","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 three-dimensional computational topology, the theory of normal surfaces is a tool of great theoretical and practical significance. Although this theory typically leads to exponential time algorithms, very little is known about how these algorithms perform in \"typical\" scenarios, or how far the best known theoretical bounds are from the real worst-case scenarios. Here we study the combinatorial and algebraic complexity of normal surfaces from both the theoretical and experimental viewpoints. Theoretically, we obtain new exponential lower bounds on the worst-case complexities in a variety of ","authors_text":"Benjamin A. Burton, Jo\\~ao Paix\\~ao, Jonathan Spreer","cross_cats":["cs.CG","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2012-11-14T08:23:03Z","title":"Computational topology and normal surfaces: Theoretical and experimental complexity bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3234","kind":"arxiv","version":1},"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:962a7d596667910af3483afaf91045f6d859f16ac3e3393d929ffa64abd5a375","target":"record","created_at":"2026-05-18T00:02:36Z","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":"b3fbf5ccc86fee97f03e94546ce6bfab266d4fa3fb238bf88d9993ea3c120c0d","cross_cats_sorted":["cs.CG","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2012-11-14T08:23:03Z","title_canon_sha256":"61a4bc27eb1cc34d222c2a37ae4d8681f00dcee36c85d88ff43cf56d55eb6225"},"schema_version":"1.0","source":{"id":"1211.3234","kind":"arxiv","version":1}},"canonical_sha256":"5504f60b051f2fd67c7877aad8b98524889529958a3803cb09dc6c5bc39b62d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5504f60b051f2fd67c7877aad8b98524889529958a3803cb09dc6c5bc39b62d6","first_computed_at":"2026-05-18T00:02:36.990994Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:36.990994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U7UrAQ3R90T53UIqlzOEdS2qdxoIlGXhl2SQAXihTkeClb+yPFL+R1ZQPDLCSGWD8H7rUGhM7mQ/PG1eCJ1QDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:36.991588Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.3234","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:962a7d596667910af3483afaf91045f6d859f16ac3e3393d929ffa64abd5a375","sha256:18719eed57eccd0b850a90348ff5036782ce8867c1b2da18ab83fafb32ead60e"],"state_sha256":"cdd684698ad869f391f612914f2add8a2a3e3a53807811629c33a43462b98a94"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2NSxYYfpilXbMmhwwC6WuvS4nkzhUJg2BYAf0TD8+eojl9zYLN54o42oAf6ONqqWYqKycT5fMQ0H5239mUXKCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:53:01.717712Z","bundle_sha256":"5842c3cd136256496790a2a5426ee845e40f2ec0cc742fd970847e2d9a796fc4"}}