{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:M4I6IB5CS57R4IVKJU7WFJ3EAK","short_pith_number":"pith:M4I6IB5C","schema_version":"1.0","canonical_sha256":"6711e407a2977f1e22aa4d3f62a76402a381e45b064512536b1be3e5aa22f3f0","source":{"kind":"arxiv","id":"1012.0591","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1012.0591","created_at":"2026-05-18T02:23:16.439191+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.0591v2","created_at":"2026-05-18T02:23:16.439191+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0591","created_at":"2026-05-18T02:23:16.439191+00:00"},{"alias_kind":"pith_short_12","alias_value":"M4I6IB5CS57R","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"M4I6IB5CS57R4IVK","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"M4I6IB5C","created_at":"2026-05-18T12:26:10.704358+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M4I6IB5CS57R4IVKJU7WFJ3EAK","json":"https://pith.science/pith/M4I6IB5CS57R4IVKJU7WFJ3EAK.json","graph_json":"https://pith.science/api/pith-number/M4I6IB5CS57R4IVKJU7WFJ3EAK/graph.json","events_json":"https://pith.science/api/pith-number/M4I6IB5CS57R4IVKJU7WFJ3EAK/events.json","paper":"https://pith.science/paper/M4I6IB5C"},"agent_actions":{"view_html":"https://pith.science/pith/M4I6IB5CS57R4IVKJU7WFJ3EAK","download_json":"https://pith.science/pith/M4I6IB5CS57R4IVKJU7WFJ3EAK.json","view_paper":"https://pith.science/paper/M4I6IB5C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.0591&json=true","fetch_graph":"https://pith.science/api/pith-number/M4I6IB5CS57R4IVKJU7WFJ3EAK/graph.json","fetch_events":"https://pith.science/api/pith-number/M4I6IB5CS57R4IVKJU7WFJ3EAK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M4I6IB5CS57R4IVKJU7WFJ3EAK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M4I6IB5CS57R4IVKJU7WFJ3EAK/action/storage_attestation","attest_author":"https://pith.science/pith/M4I6IB5CS57R4IVKJU7WFJ3EAK/action/author_attestation","sign_citation":"https://pith.science/pith/M4I6IB5CS57R4IVKJU7WFJ3EAK/action/citation_signature","submit_replication":"https://pith.science/pith/M4I6IB5CS57R4IVKJU7WFJ3EAK/action/replication_record"}},"created_at":"2026-05-18T02:23:16.439191+00:00","updated_at":"2026-05-18T02:23:16.439191+00:00"}