{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:M4I6IB5CS57R4IVKJU7WFJ3EAK","short_pith_number":"pith:M4I6IB5C","canonical_record":{"source":{"id":"1012.0591","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-12-02T22:13:16Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"0c075c2857fb192987c01e023afef39ad7f67a2e1a56ffa2027281e4e0f130a9","abstract_canon_sha256":"246400e7202b924a2d750cf069c1a0086ac6cf8529c41bb83214f3177268baec"},"schema_version":"1.0"},"canonical_sha256":"6711e407a2977f1e22aa4d3f62a76402a381e45b064512536b1be3e5aa22f3f0","source":{"kind":"arxiv","id":"1012.0591","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.0591","created_at":"2026-05-18T02:23:16Z"},{"alias_kind":"arxiv_version","alias_value":"1012.0591v2","created_at":"2026-05-18T02:23:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0591","created_at":"2026-05-18T02:23:16Z"},{"alias_kind":"pith_short_12","alias_value":"M4I6IB5CS57R","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"M4I6IB5CS57R4IVK","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"M4I6IB5C","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:M4I6IB5CS57R4IVKJU7WFJ3EAK","target":"record","payload":{"canonical_record":{"source":{"id":"1012.0591","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-12-02T22:13:16Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"0c075c2857fb192987c01e023afef39ad7f67a2e1a56ffa2027281e4e0f130a9","abstract_canon_sha256":"246400e7202b924a2d750cf069c1a0086ac6cf8529c41bb83214f3177268baec"},"schema_version":"1.0"},"canonical_sha256":"6711e407a2977f1e22aa4d3f62a76402a381e45b064512536b1be3e5aa22f3f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:16.439710Z","signature_b64":"UFBTnADJEhGFuTZ1j/heqqwGtL5x0K/CBk8jcbpH525kxBJzCRF/ZMpY5GgaDkaWOgHC4nsENNVKoc14Vrd9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6711e407a2977f1e22aa4d3f62a76402a381e45b064512536b1be3e5aa22f3f0","last_reissued_at":"2026-05-18T02:23:16.439112Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:16.439112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.0591","source_version":2,"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:23:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PxDd7jPvmC27zozC5DLd5ViXWh+4VFhZhVtk6EO4yoUY8vhubUMJs+6F6HRSU3u2rBOvnvI6qIueAuv1fA50Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:29:08.303986Z"},"content_sha256":"a6a51852fd72dd98ae6a747087fc30c6899faadfc20f74c29985526d9c05d604","schema_version":"1.0","event_id":"sha256:a6a51852fd72dd98ae6a747087fc30c6899faadfc20f74c29985526d9c05d604"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:M4I6IB5CS57R4IVKJU7WFJ3EAK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting Plane Graphs: Flippability and its Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DM","authors_text":"Adam Sheffer, Csaba D. T\\'oth, Emo Welzl, Michael Hoffmann, Micha Sharir","submitted_at":"2010-12-02T22:13:16Z","abstract_excerpt":"We generalize the notions of flippable and simultaneously flippable edges in a triangulation of a set S of points in the plane to so-called \\emph{pseudo-simultaneously flippable edges}. Such edges are related to the notion of convex decompositions spanned by S.\n  We prove a worst-case tight lower bound for the number of pseudo-simultaneously flippable edges in a triangulation in terms of the number of vertices. We use this bound for deriving new upper bounds for the maximal number of crossing-free straight-edge graphs that can be embedded on any fixed set of N points in the plane. We obtain ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.0591","kind":"arxiv","version":2},"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:23:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ddamIwHkTbhaBoW/bn4lLxBQjUz7e0jFxwC9UHf3CZ1Y1ftPzf8+M4PKGZ8UHbApgr0TeqxMH+TdMWLfaH6iDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:29:08.304656Z"},"content_sha256":"20d2aed849f5c5da463be0290699651693833d66aac8949d932eff1492f6a46b","schema_version":"1.0","event_id":"sha256:20d2aed849f5c5da463be0290699651693833d66aac8949d932eff1492f6a46b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M4I6IB5CS57R4IVKJU7WFJ3EAK/bundle.json","state_url":"https://pith.science/pith/M4I6IB5CS57R4IVKJU7WFJ3EAK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M4I6IB5CS57R4IVKJU7WFJ3EAK/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-27T18:29:08Z","links":{"resolver":"https://pith.science/pith/M4I6IB5CS57R4IVKJU7WFJ3EAK","bundle":"https://pith.science/pith/M4I6IB5CS57R4IVKJU7WFJ3EAK/bundle.json","state":"https://pith.science/pith/M4I6IB5CS57R4IVKJU7WFJ3EAK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M4I6IB5CS57R4IVKJU7WFJ3EAK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:M4I6IB5CS57R4IVKJU7WFJ3EAK","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":"246400e7202b924a2d750cf069c1a0086ac6cf8529c41bb83214f3177268baec","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-12-02T22:13:16Z","title_canon_sha256":"0c075c2857fb192987c01e023afef39ad7f67a2e1a56ffa2027281e4e0f130a9"},"schema_version":"1.0","source":{"id":"1012.0591","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.0591","created_at":"2026-05-18T02:23:16Z"},{"alias_kind":"arxiv_version","alias_value":"1012.0591v2","created_at":"2026-05-18T02:23:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0591","created_at":"2026-05-18T02:23:16Z"},{"alias_kind":"pith_short_12","alias_value":"M4I6IB5CS57R","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"M4I6IB5CS57R4IVK","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"M4I6IB5C","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:20d2aed849f5c5da463be0290699651693833d66aac8949d932eff1492f6a46b","target":"graph","created_at":"2026-05-18T02:23:16Z","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 generalize the notions of flippable and simultaneously flippable edges in a triangulation of a set S of points in the plane to so-called \\emph{pseudo-simultaneously flippable edges}. Such edges are related to the notion of convex decompositions spanned by S.\n  We prove a worst-case tight lower bound for the number of pseudo-simultaneously flippable edges in a triangulation in terms of the number of vertices. We use this bound for deriving new upper bounds for the maximal number of crossing-free straight-edge graphs that can be embedded on any fixed set of N points in the plane. We obtain ne","authors_text":"Adam Sheffer, Csaba D. T\\'oth, Emo Welzl, Michael Hoffmann, Micha Sharir","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-12-02T22:13:16Z","title":"Counting Plane Graphs: Flippability and its Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.0591","kind":"arxiv","version":2},"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:a6a51852fd72dd98ae6a747087fc30c6899faadfc20f74c29985526d9c05d604","target":"record","created_at":"2026-05-18T02:23:16Z","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":"246400e7202b924a2d750cf069c1a0086ac6cf8529c41bb83214f3177268baec","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-12-02T22:13:16Z","title_canon_sha256":"0c075c2857fb192987c01e023afef39ad7f67a2e1a56ffa2027281e4e0f130a9"},"schema_version":"1.0","source":{"id":"1012.0591","kind":"arxiv","version":2}},"canonical_sha256":"6711e407a2977f1e22aa4d3f62a76402a381e45b064512536b1be3e5aa22f3f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6711e407a2977f1e22aa4d3f62a76402a381e45b064512536b1be3e5aa22f3f0","first_computed_at":"2026-05-18T02:23:16.439112Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:16.439112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UFBTnADJEhGFuTZ1j/heqqwGtL5x0K/CBk8jcbpH525kxBJzCRF/ZMpY5GgaDkaWOgHC4nsENNVKoc14Vrd9DA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:16.439710Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.0591","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6a51852fd72dd98ae6a747087fc30c6899faadfc20f74c29985526d9c05d604","sha256:20d2aed849f5c5da463be0290699651693833d66aac8949d932eff1492f6a46b"],"state_sha256":"c4b6daddbd8ba956989497b9f51c1791713e50310edfb5a4f0f3c8a889a51849"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vMMAfKYaev7uiMEu/PzHr4Ds/f4o9/OyZGREL1qEUDgDhL+nvluEmx55OSn/w89GBJrmRL1NMAXvv4S6THjKBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:29:08.308108Z","bundle_sha256":"8bd242c0093373659f6aa0dbc0873832c3d6e3c350b4ad9f49a5b3cb694a38d8"}}