{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:YXFHAVEAGXQAWRRELEO2AMUKHN","short_pith_number":"pith:YXFHAVEA","canonical_record":{"source":{"id":"1109.5596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-09-26T15:12:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"18918855a9c16667ab1656af5d9e37151d44b99e3aae97ba355c9a6490209bd8","abstract_canon_sha256":"c464df26058bc53bf6307e6348b80f13aae72c0833a73940c99ceb6653843cb7"},"schema_version":"1.0"},"canonical_sha256":"c5ca70548035e00b4624591da0328a3b7d4543ec4f1a8ca403ea50f1dd6402f7","source":{"kind":"arxiv","id":"1109.5596","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5596","created_at":"2026-05-18T04:12:19Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5596v1","created_at":"2026-05-18T04:12:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5596","created_at":"2026-05-18T04:12:19Z"},{"alias_kind":"pith_short_12","alias_value":"YXFHAVEAGXQA","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YXFHAVEAGXQAWRRE","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YXFHAVEA","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:YXFHAVEAGXQAWRRELEO2AMUKHN","target":"record","payload":{"canonical_record":{"source":{"id":"1109.5596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-09-26T15:12:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"18918855a9c16667ab1656af5d9e37151d44b99e3aae97ba355c9a6490209bd8","abstract_canon_sha256":"c464df26058bc53bf6307e6348b80f13aae72c0833a73940c99ceb6653843cb7"},"schema_version":"1.0"},"canonical_sha256":"c5ca70548035e00b4624591da0328a3b7d4543ec4f1a8ca403ea50f1dd6402f7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:19.135466Z","signature_b64":"Aq8940wgaW7XPWbsDGg2pf/VqDwaLLpqDqBAgfjqWytGh/oAiriDkzDyEIiM1KYK7TefqeLoOTYAzeAzJFKwCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5ca70548035e00b4624591da0328a3b7d4543ec4f1a8ca403ea50f1dd6402f7","last_reissued_at":"2026-05-18T04:12:19.134915Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:19.134915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.5596","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-18T04:12:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dzgTkaz1Onlm+MZvEPWOk9oh80Hg4cAf1yel1kD9zL8aEp038QKmhStPSV7HdY/yp6h80P5y9/aN0WaNTA01AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:50:56.171260Z"},"content_sha256":"363fe33fc9db511861025307ee77b30a0dbcd1d09c08ead90afabaa1fc332d57","schema_version":"1.0","event_id":"sha256:363fe33fc9db511861025307ee77b30a0dbcd1d09c08ead90afabaa1fc332d57"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:YXFHAVEAGXQAWRRELEO2AMUKHN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting Plane Graphs: Perfect Matchings, Spanning Cycles, and Kasteleyn's Technique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Adam Sheffer, Emo Welzl, Micha Sharir","submitted_at":"2011-09-26T15:12:14Z","abstract_excerpt":"We derive improved upper bounds on the number of crossing-free straight-edge spanning cycles (also known as Hamiltonian tours and simple polygonizations) that can be embedded over any specific set of $N$ points in the plane. More specifically, we bound the ratio between the number of spanning cycles (or perfect matchings) that can be embedded over a point set and the number of triangulations that can be embedded over it. The respective bounds are $O(1.8181^N)$ for cycles and $O(1.1067^N)$ for matchings. These imply a new upper bound of $O(54.543^N)$ on the number of crossing-free straight-edge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5596","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-18T04:12:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g2Y8kjWVu+CKcTvl/RYtYteFdqMxAEMlQzcH0p+KITWjRvoTsqdaeqU7q67cRTYyGPd2lSnnsEvaYeeoM9x/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:50:56.171950Z"},"content_sha256":"9ee6ac64c8ee0cfb93868c789588afa73a459045a929b7ad33900ec165ce2949","schema_version":"1.0","event_id":"sha256:9ee6ac64c8ee0cfb93868c789588afa73a459045a929b7ad33900ec165ce2949"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YXFHAVEAGXQAWRRELEO2AMUKHN/bundle.json","state_url":"https://pith.science/pith/YXFHAVEAGXQAWRRELEO2AMUKHN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YXFHAVEAGXQAWRRELEO2AMUKHN/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-27T09:50:56Z","links":{"resolver":"https://pith.science/pith/YXFHAVEAGXQAWRRELEO2AMUKHN","bundle":"https://pith.science/pith/YXFHAVEAGXQAWRRELEO2AMUKHN/bundle.json","state":"https://pith.science/pith/YXFHAVEAGXQAWRRELEO2AMUKHN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YXFHAVEAGXQAWRRELEO2AMUKHN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:YXFHAVEAGXQAWRRELEO2AMUKHN","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":"c464df26058bc53bf6307e6348b80f13aae72c0833a73940c99ceb6653843cb7","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-09-26T15:12:14Z","title_canon_sha256":"18918855a9c16667ab1656af5d9e37151d44b99e3aae97ba355c9a6490209bd8"},"schema_version":"1.0","source":{"id":"1109.5596","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5596","created_at":"2026-05-18T04:12:19Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5596v1","created_at":"2026-05-18T04:12:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5596","created_at":"2026-05-18T04:12:19Z"},{"alias_kind":"pith_short_12","alias_value":"YXFHAVEAGXQA","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YXFHAVEAGXQAWRRE","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YXFHAVEA","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:9ee6ac64c8ee0cfb93868c789588afa73a459045a929b7ad33900ec165ce2949","target":"graph","created_at":"2026-05-18T04:12:19Z","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 derive improved upper bounds on the number of crossing-free straight-edge spanning cycles (also known as Hamiltonian tours and simple polygonizations) that can be embedded over any specific set of $N$ points in the plane. More specifically, we bound the ratio between the number of spanning cycles (or perfect matchings) that can be embedded over a point set and the number of triangulations that can be embedded over it. The respective bounds are $O(1.8181^N)$ for cycles and $O(1.1067^N)$ for matchings. These imply a new upper bound of $O(54.543^N)$ on the number of crossing-free straight-edge","authors_text":"Adam Sheffer, Emo Welzl, Micha Sharir","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-09-26T15:12:14Z","title":"Counting Plane Graphs: Perfect Matchings, Spanning Cycles, and Kasteleyn's Technique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5596","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:363fe33fc9db511861025307ee77b30a0dbcd1d09c08ead90afabaa1fc332d57","target":"record","created_at":"2026-05-18T04:12:19Z","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":"c464df26058bc53bf6307e6348b80f13aae72c0833a73940c99ceb6653843cb7","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-09-26T15:12:14Z","title_canon_sha256":"18918855a9c16667ab1656af5d9e37151d44b99e3aae97ba355c9a6490209bd8"},"schema_version":"1.0","source":{"id":"1109.5596","kind":"arxiv","version":1}},"canonical_sha256":"c5ca70548035e00b4624591da0328a3b7d4543ec4f1a8ca403ea50f1dd6402f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5ca70548035e00b4624591da0328a3b7d4543ec4f1a8ca403ea50f1dd6402f7","first_computed_at":"2026-05-18T04:12:19.134915Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:19.134915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Aq8940wgaW7XPWbsDGg2pf/VqDwaLLpqDqBAgfjqWytGh/oAiriDkzDyEIiM1KYK7TefqeLoOTYAzeAzJFKwCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:19.135466Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.5596","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:363fe33fc9db511861025307ee77b30a0dbcd1d09c08ead90afabaa1fc332d57","sha256:9ee6ac64c8ee0cfb93868c789588afa73a459045a929b7ad33900ec165ce2949"],"state_sha256":"3b2a6c05e28ebf1873170135c853e7138f0d9fb1c97198427645c42da35a9a5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"84EFaCEYK/t9HfC84rOhqjM0XzWdOg/ue+Bi1io1v3qVgX0LI7R8W4WQ6V3GNewCwiAtxtEgGv1s4sm5VSfuAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:50:56.175970Z","bundle_sha256":"747b2bcb0864fb008b7326fdcb367040066c8d97be803b76a6321a987d1c9afe"}}