{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:L7A45FOUFUDRRBAQXIS2D5DYIS","short_pith_number":"pith:L7A45FOU","canonical_record":{"source":{"id":"1604.05350","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-04-18T21:03:31Z","cross_cats_sorted":[],"title_canon_sha256":"9dc8a57c6f4cdf504afe8ba5d8c4e8cc0128ac0692f38931f8a73d80e20adff1","abstract_canon_sha256":"ff08a80429427b46eeb5a86ea977f3e327fe06f6e3e607c0576250502924ee12"},"schema_version":"1.0"},"canonical_sha256":"5fc1ce95d42d07188410ba25a1f47844a56380fe7b6ba82dbef62bce81869014","source":{"kind":"arxiv","id":"1604.05350","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.05350","created_at":"2026-05-18T01:16:54Z"},{"alias_kind":"arxiv_version","alias_value":"1604.05350v1","created_at":"2026-05-18T01:16:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05350","created_at":"2026-05-18T01:16:54Z"},{"alias_kind":"pith_short_12","alias_value":"L7A45FOUFUDR","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"L7A45FOUFUDRRBAQ","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"L7A45FOU","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:L7A45FOUFUDRRBAQXIS2D5DYIS","target":"record","payload":{"canonical_record":{"source":{"id":"1604.05350","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-04-18T21:03:31Z","cross_cats_sorted":[],"title_canon_sha256":"9dc8a57c6f4cdf504afe8ba5d8c4e8cc0128ac0692f38931f8a73d80e20adff1","abstract_canon_sha256":"ff08a80429427b46eeb5a86ea977f3e327fe06f6e3e607c0576250502924ee12"},"schema_version":"1.0"},"canonical_sha256":"5fc1ce95d42d07188410ba25a1f47844a56380fe7b6ba82dbef62bce81869014","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:54.224745Z","signature_b64":"c/EEbUhSjjuGNS+IPn/OeqNN6hkkgEdK6ciptchG/XsCcph1U4zEP1aukR4d3QC3ZnhyGY3gtEqmkGEqvK33BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fc1ce95d42d07188410ba25a1f47844a56380fe7b6ba82dbef62bce81869014","last_reissued_at":"2026-05-18T01:16:54.224143Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:54.224143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.05350","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-18T01:16:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mJRrimZ7MiXp/MHOTRAX4x0qudIqgqr062ce1hliYzmW/fOJHp/EkXjdnMvsPCaHkF6rL+BOMZvMEGOSBvlXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:55:55.528971Z"},"content_sha256":"85e0c35d25a63871d8c69036d8a40429fc5a0529d38e423935a76732a4ccfad4","schema_version":"1.0","event_id":"sha256:85e0c35d25a63871d8c69036d8a40429fc5a0529d38e423935a76732a4ccfad4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:L7A45FOUFUDRRBAQXIS2D5DYIS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting and Enumerating Crossing-free Geometric Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Manuel Wettstein","submitted_at":"2016-04-18T21:03:31Z","abstract_excerpt":"We describe a framework for counting and enumerating various types of crossing-free geometric graphs on a planar point set. The framework generalizes ideas of Alvarez and Seidel, who used them to count triangulations in time $O(2^nn^2)$ where $n$ is the number of points. The main idea is to reduce the problem of counting geometric graphs to counting source-sink paths in a directed acyclic graph.\n  The following new results will emerge. The number of all crossing-free geometric graphs can be computed in time $O(c^nn^4)$ for some $c < 2.83929$. The number of crossing-free convex partitions can b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05350","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-18T01:16:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nuYMFeBIhgyx1uUqQK99u92XWDDaR/9KHYYRon9FThE2UkrU/3+mfRiUJdPc3CVZELeqTi1/QAxMNPmZ9KbQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:55:55.529676Z"},"content_sha256":"fe6fe80e6083515a09746368944c836c8089d3618cf61c79f8cd07a92cb92c6c","schema_version":"1.0","event_id":"sha256:fe6fe80e6083515a09746368944c836c8089d3618cf61c79f8cd07a92cb92c6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L7A45FOUFUDRRBAQXIS2D5DYIS/bundle.json","state_url":"https://pith.science/pith/L7A45FOUFUDRRBAQXIS2D5DYIS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L7A45FOUFUDRRBAQXIS2D5DYIS/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-29T14:55:55Z","links":{"resolver":"https://pith.science/pith/L7A45FOUFUDRRBAQXIS2D5DYIS","bundle":"https://pith.science/pith/L7A45FOUFUDRRBAQXIS2D5DYIS/bundle.json","state":"https://pith.science/pith/L7A45FOUFUDRRBAQXIS2D5DYIS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L7A45FOUFUDRRBAQXIS2D5DYIS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:L7A45FOUFUDRRBAQXIS2D5DYIS","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":"ff08a80429427b46eeb5a86ea977f3e327fe06f6e3e607c0576250502924ee12","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-04-18T21:03:31Z","title_canon_sha256":"9dc8a57c6f4cdf504afe8ba5d8c4e8cc0128ac0692f38931f8a73d80e20adff1"},"schema_version":"1.0","source":{"id":"1604.05350","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.05350","created_at":"2026-05-18T01:16:54Z"},{"alias_kind":"arxiv_version","alias_value":"1604.05350v1","created_at":"2026-05-18T01:16:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05350","created_at":"2026-05-18T01:16:54Z"},{"alias_kind":"pith_short_12","alias_value":"L7A45FOUFUDR","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"L7A45FOUFUDRRBAQ","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"L7A45FOU","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:fe6fe80e6083515a09746368944c836c8089d3618cf61c79f8cd07a92cb92c6c","target":"graph","created_at":"2026-05-18T01:16:54Z","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 describe a framework for counting and enumerating various types of crossing-free geometric graphs on a planar point set. The framework generalizes ideas of Alvarez and Seidel, who used them to count triangulations in time $O(2^nn^2)$ where $n$ is the number of points. The main idea is to reduce the problem of counting geometric graphs to counting source-sink paths in a directed acyclic graph.\n  The following new results will emerge. The number of all crossing-free geometric graphs can be computed in time $O(c^nn^4)$ for some $c < 2.83929$. The number of crossing-free convex partitions can b","authors_text":"Manuel Wettstein","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-04-18T21:03:31Z","title":"Counting and Enumerating Crossing-free Geometric Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05350","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:85e0c35d25a63871d8c69036d8a40429fc5a0529d38e423935a76732a4ccfad4","target":"record","created_at":"2026-05-18T01:16:54Z","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":"ff08a80429427b46eeb5a86ea977f3e327fe06f6e3e607c0576250502924ee12","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-04-18T21:03:31Z","title_canon_sha256":"9dc8a57c6f4cdf504afe8ba5d8c4e8cc0128ac0692f38931f8a73d80e20adff1"},"schema_version":"1.0","source":{"id":"1604.05350","kind":"arxiv","version":1}},"canonical_sha256":"5fc1ce95d42d07188410ba25a1f47844a56380fe7b6ba82dbef62bce81869014","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fc1ce95d42d07188410ba25a1f47844a56380fe7b6ba82dbef62bce81869014","first_computed_at":"2026-05-18T01:16:54.224143Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:54.224143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c/EEbUhSjjuGNS+IPn/OeqNN6hkkgEdK6ciptchG/XsCcph1U4zEP1aukR4d3QC3ZnhyGY3gtEqmkGEqvK33BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:54.224745Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.05350","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85e0c35d25a63871d8c69036d8a40429fc5a0529d38e423935a76732a4ccfad4","sha256:fe6fe80e6083515a09746368944c836c8089d3618cf61c79f8cd07a92cb92c6c"],"state_sha256":"26724afc285c0dbf99c29a19f4993bc49b519b631545091d43b9237471091f47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JIWklu6NZZUN/w3PXtadIRvDcJ7ED7Es6RYt1obyEj4tBmxVUvl7BifJ/SUNTXMTo2w0JKnTA3rexmCGHM94Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T14:55:55.533257Z","bundle_sha256":"372e27fac3dc4482efde08bc6894ca9ce08fd1bd26ab751e04ab1924b499000d"}}