{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:332KW6SFCO5PD7RLXJCI27V3YW","short_pith_number":"pith:332KW6SF","canonical_record":{"source":{"id":"1404.0261","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-04-01T14:42:48Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"38f92e92032c5bda461ce7ece2facb0f033c27f600369215982667813b184733","abstract_canon_sha256":"8fec4905443e95e01b71122f39258cf674c79449b316e2737e68a88b931488c2"},"schema_version":"1.0"},"canonical_sha256":"def4ab7a4513baf1fe2bba448d7ebbc58eb09ebdf329be35952b86efb7b5feb0","source":{"kind":"arxiv","id":"1404.0261","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0261","created_at":"2026-05-18T02:55:04Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0261v1","created_at":"2026-05-18T02:55:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0261","created_at":"2026-05-18T02:55:04Z"},{"alias_kind":"pith_short_12","alias_value":"332KW6SFCO5P","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"332KW6SFCO5PD7RL","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"332KW6SF","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:332KW6SFCO5PD7RLXJCI27V3YW","target":"record","payload":{"canonical_record":{"source":{"id":"1404.0261","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-04-01T14:42:48Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"38f92e92032c5bda461ce7ece2facb0f033c27f600369215982667813b184733","abstract_canon_sha256":"8fec4905443e95e01b71122f39258cf674c79449b316e2737e68a88b931488c2"},"schema_version":"1.0"},"canonical_sha256":"def4ab7a4513baf1fe2bba448d7ebbc58eb09ebdf329be35952b86efb7b5feb0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:04.792726Z","signature_b64":"w29eb3mYO+94DytQh87+2xug6WYEQwC5/wkfZG3SyVRHdK1YcoEc9GbV7XxqdQZmaht0SAqXYVNPRXNiSMe/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"def4ab7a4513baf1fe2bba448d7ebbc58eb09ebdf329be35952b86efb7b5feb0","last_reissued_at":"2026-05-18T02:55:04.792274Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:04.792274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.0261","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-18T02:55:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ME4EJJ5HMNVjQ0Y+r5Shs/bL/P4EXr6eS28Jg25qpEM5GHylkXo+Uur5riiNwMmSPUxd/fha3japV1ofBvvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:59:06.257094Z"},"content_sha256":"b07e7525ba0c3068034608cdd097353b0b5744ef43ea268ce17d26a437796781","schema_version":"1.0","event_id":"sha256:b07e7525ba0c3068034608cdd097353b0b5744ef43ea268ce17d26a437796781"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:332KW6SFCO5PD7RLXJCI27V3YW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting Triangulations and other Crossing-Free Structures Approximately","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Karl Bringmann, Raimund Seidel, Saurabh Ray, Victor Alvarez","submitted_at":"2014-04-01T14:42:48Z","abstract_excerpt":"We consider the problem of counting straight-edge triangulations of a given set $P$ of $n$ points in the plane. Until very recently it was not known whether the exact number of triangulations of $P$ can be computed asymptotically faster than by enumerating all triangulations. We now know that the number of triangulations of $P$ can be computed in $O^{*}(2^{n})$ time, which is less than the lower bound of $\\Omega(2.43^{n})$ on the number of triangulations of any point set. In this paper we address the question of whether one can approximately count triangulations in sub-exponential time. We pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0261","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-18T02:55:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pbBqGJyt/rPoPCvKw9x3hi6kZfEOyKUGQBZELWINjAGG/p1xq2EuA47xNfnwcJxoOyD1hHyS5Yl5bVvORo3FAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:59:06.257474Z"},"content_sha256":"b7c6bf3c231457fa10045c57e9db122215ba96b63c9d6cb284ce2dba3acf4f4e","schema_version":"1.0","event_id":"sha256:b7c6bf3c231457fa10045c57e9db122215ba96b63c9d6cb284ce2dba3acf4f4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/332KW6SFCO5PD7RLXJCI27V3YW/bundle.json","state_url":"https://pith.science/pith/332KW6SFCO5PD7RLXJCI27V3YW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/332KW6SFCO5PD7RLXJCI27V3YW/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-28T07:59:06Z","links":{"resolver":"https://pith.science/pith/332KW6SFCO5PD7RLXJCI27V3YW","bundle":"https://pith.science/pith/332KW6SFCO5PD7RLXJCI27V3YW/bundle.json","state":"https://pith.science/pith/332KW6SFCO5PD7RLXJCI27V3YW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/332KW6SFCO5PD7RLXJCI27V3YW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:332KW6SFCO5PD7RLXJCI27V3YW","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":"8fec4905443e95e01b71122f39258cf674c79449b316e2737e68a88b931488c2","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-04-01T14:42:48Z","title_canon_sha256":"38f92e92032c5bda461ce7ece2facb0f033c27f600369215982667813b184733"},"schema_version":"1.0","source":{"id":"1404.0261","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0261","created_at":"2026-05-18T02:55:04Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0261v1","created_at":"2026-05-18T02:55:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0261","created_at":"2026-05-18T02:55:04Z"},{"alias_kind":"pith_short_12","alias_value":"332KW6SFCO5P","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"332KW6SFCO5PD7RL","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"332KW6SF","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:b7c6bf3c231457fa10045c57e9db122215ba96b63c9d6cb284ce2dba3acf4f4e","target":"graph","created_at":"2026-05-18T02:55:04Z","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":"We consider the problem of counting straight-edge triangulations of a given set $P$ of $n$ points in the plane. Until very recently it was not known whether the exact number of triangulations of $P$ can be computed asymptotically faster than by enumerating all triangulations. We now know that the number of triangulations of $P$ can be computed in $O^{*}(2^{n})$ time, which is less than the lower bound of $\\Omega(2.43^{n})$ on the number of triangulations of any point set. In this paper we address the question of whether one can approximately count triangulations in sub-exponential time. We pre","authors_text":"Karl Bringmann, Raimund Seidel, Saurabh Ray, Victor Alvarez","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-04-01T14:42:48Z","title":"Counting Triangulations and other Crossing-Free Structures Approximately"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0261","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:b07e7525ba0c3068034608cdd097353b0b5744ef43ea268ce17d26a437796781","target":"record","created_at":"2026-05-18T02:55:04Z","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":"8fec4905443e95e01b71122f39258cf674c79449b316e2737e68a88b931488c2","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-04-01T14:42:48Z","title_canon_sha256":"38f92e92032c5bda461ce7ece2facb0f033c27f600369215982667813b184733"},"schema_version":"1.0","source":{"id":"1404.0261","kind":"arxiv","version":1}},"canonical_sha256":"def4ab7a4513baf1fe2bba448d7ebbc58eb09ebdf329be35952b86efb7b5feb0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"def4ab7a4513baf1fe2bba448d7ebbc58eb09ebdf329be35952b86efb7b5feb0","first_computed_at":"2026-05-18T02:55:04.792274Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:04.792274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w29eb3mYO+94DytQh87+2xug6WYEQwC5/wkfZG3SyVRHdK1YcoEc9GbV7XxqdQZmaht0SAqXYVNPRXNiSMe/Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:04.792726Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.0261","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b07e7525ba0c3068034608cdd097353b0b5744ef43ea268ce17d26a437796781","sha256:b7c6bf3c231457fa10045c57e9db122215ba96b63c9d6cb284ce2dba3acf4f4e"],"state_sha256":"58733d0c5a855a7e93a1304a21b735a7c88c696bc4ce6fee5195d4fa3a4313f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j1JWEzSO8IxpEuIZlMoVVe2epANnYL+ofSPZoeY64gyAu/KK9AfP0lZc8wOS84EKwbas4QGzevLSmkI/0CudBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:59:06.259906Z","bundle_sha256":"118ce1a775d076c71fc333dee96f49669946991595ccc5300eae65505e5c85a4"}}