{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:B3LY7KK6CUVX4DFNXNVXLX5ENB","short_pith_number":"pith:B3LY7KK6","canonical_record":{"source":{"id":"1312.4628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-17T03:41:41Z","cross_cats_sorted":["cs.CC","cs.DS","math.CO"],"title_canon_sha256":"8de900827e48998b736feb761ea65daa5d7bed48e3d3ee014f92cecefb606049","abstract_canon_sha256":"fc1f72615256e07124d6e3dde2b4cd85e35b85807c53a1abb0b27b298d466736"},"schema_version":"1.0"},"canonical_sha256":"0ed78fa95e152b7e0cadbb6b75dfa4685ccb00bd3aa8888bcd9fd9d40b1d54e6","source":{"kind":"arxiv","id":"1312.4628","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4628","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4628v1","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4628","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"pith_short_12","alias_value":"B3LY7KK6CUVX","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"B3LY7KK6CUVX4DFN","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"B3LY7KK6","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:B3LY7KK6CUVX4DFNXNVXLX5ENB","target":"record","payload":{"canonical_record":{"source":{"id":"1312.4628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-17T03:41:41Z","cross_cats_sorted":["cs.CC","cs.DS","math.CO"],"title_canon_sha256":"8de900827e48998b736feb761ea65daa5d7bed48e3d3ee014f92cecefb606049","abstract_canon_sha256":"fc1f72615256e07124d6e3dde2b4cd85e35b85807c53a1abb0b27b298d466736"},"schema_version":"1.0"},"canonical_sha256":"0ed78fa95e152b7e0cadbb6b75dfa4685ccb00bd3aa8888bcd9fd9d40b1d54e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:23.464572Z","signature_b64":"N9+XP5+LQcWO9cDUd3gwkhK1MidKzdPGp8OXMruHrhF6+Z209NHTHULQyyiLp0P7dweYI6CQU19BOLo22GYvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ed78fa95e152b7e0cadbb6b75dfa4685ccb00bd3aa8888bcd9fd9d40b1d54e6","last_reissued_at":"2026-05-18T03:04:23.464111Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:23.464111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.4628","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-18T03:04:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NnsoKJBsGfDKhAwjnll5bkRQbUzG3/pYaQSAUDOl/7RWcWqVqQTFUOqRJW7Fi5OZjmqH1i9ttzeBuZAGKksuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:49:29.962878Z"},"content_sha256":"e232100e396f96bd0a67f5ab7e503b7788d6655d320ccb5c67bb9c7bf82fa6d0","schema_version":"1.0","event_id":"sha256:e232100e396f96bd0a67f5ab7e503b7788d6655d320ccb5c67bb9c7bf82fa6d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:B3LY7KK6CUVX4DFNXNVXLX5ENB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting Triangulations and other Crossing-free Structures via Onion Layers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.CO"],"primary_cat":"cs.CG","authors_text":"Karl Bringmann, Radu Curticapean, Saurabh Ray, Victor Alvarez","submitted_at":"2013-12-17T03:41:41Z","abstract_excerpt":"Let $P$ be a set of $n$ points in the plane. A crossing-free structure on $P$ is a plane graph with vertex set $P$. Examples of crossing-free structures include triangulations of $P$, spanning cycles of $P$, also known as polygonalizations of $P$, among others. In this paper we develop a general technique for computing the number of crossing-free structures of an input set $P$. We apply the technique to obtain algorithms for computing the number of triangulations, matchings, and spanning cycles of $P$. The running time of our algorithms is upper bounded by $n^{O(k)}$, where $k$ is the number o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4628","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-18T03:04:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7zLvUMbcTCfl+NhSI5014svCMDOi8K7K8aq5EY5ll2SofBvF/b8O3XpiZl7PPWWUZxLMzP0oyxDcxbOGoyJKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:49:29.963235Z"},"content_sha256":"158496309770d4f74e227eedf88820564cc925289c509be58938bffaa4f68bfc","schema_version":"1.0","event_id":"sha256:158496309770d4f74e227eedf88820564cc925289c509be58938bffaa4f68bfc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B3LY7KK6CUVX4DFNXNVXLX5ENB/bundle.json","state_url":"https://pith.science/pith/B3LY7KK6CUVX4DFNXNVXLX5ENB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B3LY7KK6CUVX4DFNXNVXLX5ENB/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-31T07:49:29Z","links":{"resolver":"https://pith.science/pith/B3LY7KK6CUVX4DFNXNVXLX5ENB","bundle":"https://pith.science/pith/B3LY7KK6CUVX4DFNXNVXLX5ENB/bundle.json","state":"https://pith.science/pith/B3LY7KK6CUVX4DFNXNVXLX5ENB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B3LY7KK6CUVX4DFNXNVXLX5ENB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:B3LY7KK6CUVX4DFNXNVXLX5ENB","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":"fc1f72615256e07124d6e3dde2b4cd85e35b85807c53a1abb0b27b298d466736","cross_cats_sorted":["cs.CC","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-17T03:41:41Z","title_canon_sha256":"8de900827e48998b736feb761ea65daa5d7bed48e3d3ee014f92cecefb606049"},"schema_version":"1.0","source":{"id":"1312.4628","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4628","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4628v1","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4628","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"pith_short_12","alias_value":"B3LY7KK6CUVX","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"B3LY7KK6CUVX4DFN","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"B3LY7KK6","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:158496309770d4f74e227eedf88820564cc925289c509be58938bffaa4f68bfc","target":"graph","created_at":"2026-05-18T03:04:23Z","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":"Let $P$ be a set of $n$ points in the plane. A crossing-free structure on $P$ is a plane graph with vertex set $P$. Examples of crossing-free structures include triangulations of $P$, spanning cycles of $P$, also known as polygonalizations of $P$, among others. In this paper we develop a general technique for computing the number of crossing-free structures of an input set $P$. We apply the technique to obtain algorithms for computing the number of triangulations, matchings, and spanning cycles of $P$. The running time of our algorithms is upper bounded by $n^{O(k)}$, where $k$ is the number o","authors_text":"Karl Bringmann, Radu Curticapean, Saurabh Ray, Victor Alvarez","cross_cats":["cs.CC","cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-17T03:41:41Z","title":"Counting Triangulations and other Crossing-free Structures via Onion Layers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4628","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:e232100e396f96bd0a67f5ab7e503b7788d6655d320ccb5c67bb9c7bf82fa6d0","target":"record","created_at":"2026-05-18T03:04:23Z","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":"fc1f72615256e07124d6e3dde2b4cd85e35b85807c53a1abb0b27b298d466736","cross_cats_sorted":["cs.CC","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-17T03:41:41Z","title_canon_sha256":"8de900827e48998b736feb761ea65daa5d7bed48e3d3ee014f92cecefb606049"},"schema_version":"1.0","source":{"id":"1312.4628","kind":"arxiv","version":1}},"canonical_sha256":"0ed78fa95e152b7e0cadbb6b75dfa4685ccb00bd3aa8888bcd9fd9d40b1d54e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ed78fa95e152b7e0cadbb6b75dfa4685ccb00bd3aa8888bcd9fd9d40b1d54e6","first_computed_at":"2026-05-18T03:04:23.464111Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:23.464111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N9+XP5+LQcWO9cDUd3gwkhK1MidKzdPGp8OXMruHrhF6+Z209NHTHULQyyiLp0P7dweYI6CQU19BOLo22GYvBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:23.464572Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.4628","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e232100e396f96bd0a67f5ab7e503b7788d6655d320ccb5c67bb9c7bf82fa6d0","sha256:158496309770d4f74e227eedf88820564cc925289c509be58938bffaa4f68bfc"],"state_sha256":"7b31db344437788116e4480ee9735f7cfd305bf8b766244fc9da65160af583d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y758r2jCFgW+2TUjnTyFinrMuARh/UYm1EuE1ozG7ZsztpAtMLTZKa1o382471C6bSB3VadaAGNsHbXRNvtTCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:49:29.965297Z","bundle_sha256":"04d7f29dacdf7685c3d2af82e7f539eb7520ba98931f3cef8d8b1b1836677157"}}