{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:EIT3LTUQTLXOSCNPAY6Z2EKNIS","short_pith_number":"pith:EIT3LTUQ","schema_version":"1.0","canonical_sha256":"2227b5ce909aeee909af063d9d114d44a8e45d0fef9244a43d54b38740977345","source":{"kind":"arxiv","id":"0903.2184","version":5},"attestation_state":"computed","paper":{"title":"Flip Graphs of Degree-Bounded (Pseudo-)Triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Andr\\'e Schulz, Bettina Speckmann, David Orden, G\\\"unter Rote, Oswin Aichholzer, Pedro Ramos, Thomas Hackl","submitted_at":"2009-03-12T15:55:12Z","abstract_excerpt":"We study flip graphs of triangulations whose maximum vertex degree is bounded by a constant $k$. In particular, we consider triangulations of sets of $n$ points in convex position in the plane and prove that their flip graph is connected if and only if $k > 6$; the diameter of the flip graph is $O(n^2)$. We also show that, for general point sets, flip graphs of pointed pseudo-triangulations can be disconnected for $k \\leq 9$, and flip graphs of triangulations can be disconnected for any $k$. Additionally, we consider a relaxed version of the original problem. We allow the violation of the degr"},"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":"0903.2184","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-03-12T15:55:12Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"2054cfd0f8dfd654247d454fecc2287d38d52a00c4af76b83c20d5aa651ee887","abstract_canon_sha256":"88398f482db982b8a0c0692eae640cdc5231c331cb1d86e99f37d7184b665ef6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:59.318022Z","signature_b64":"WOYuDedVpMydGxn/aR4GW22/OYVLYnSaxLHDgzIzj8npauR9FZ87oG9pz1EQHR4K8p8iMdFcxD2S7k0t8H5SCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2227b5ce909aeee909af063d9d114d44a8e45d0fef9244a43d54b38740977345","last_reissued_at":"2026-05-18T02:26:59.317665Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:59.317665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flip Graphs of Degree-Bounded (Pseudo-)Triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Andr\\'e Schulz, Bettina Speckmann, David Orden, G\\\"unter Rote, Oswin Aichholzer, Pedro Ramos, Thomas Hackl","submitted_at":"2009-03-12T15:55:12Z","abstract_excerpt":"We study flip graphs of triangulations whose maximum vertex degree is bounded by a constant $k$. In particular, we consider triangulations of sets of $n$ points in convex position in the plane and prove that their flip graph is connected if and only if $k > 6$; the diameter of the flip graph is $O(n^2)$. We also show that, for general point sets, flip graphs of pointed pseudo-triangulations can be disconnected for $k \\leq 9$, and flip graphs of triangulations can be disconnected for any $k$. Additionally, we consider a relaxed version of the original problem. We allow the violation of the degr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.2184","kind":"arxiv","version":5},"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":"0903.2184","created_at":"2026-05-18T02:26:59.317726+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.2184v5","created_at":"2026-05-18T02:26:59.317726+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.2184","created_at":"2026-05-18T02:26:59.317726+00:00"},{"alias_kind":"pith_short_12","alias_value":"EIT3LTUQTLXO","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"EIT3LTUQTLXOSCNP","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"EIT3LTUQ","created_at":"2026-05-18T12:25:59.703012+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/EIT3LTUQTLXOSCNPAY6Z2EKNIS","json":"https://pith.science/pith/EIT3LTUQTLXOSCNPAY6Z2EKNIS.json","graph_json":"https://pith.science/api/pith-number/EIT3LTUQTLXOSCNPAY6Z2EKNIS/graph.json","events_json":"https://pith.science/api/pith-number/EIT3LTUQTLXOSCNPAY6Z2EKNIS/events.json","paper":"https://pith.science/paper/EIT3LTUQ"},"agent_actions":{"view_html":"https://pith.science/pith/EIT3LTUQTLXOSCNPAY6Z2EKNIS","download_json":"https://pith.science/pith/EIT3LTUQTLXOSCNPAY6Z2EKNIS.json","view_paper":"https://pith.science/paper/EIT3LTUQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.2184&json=true","fetch_graph":"https://pith.science/api/pith-number/EIT3LTUQTLXOSCNPAY6Z2EKNIS/graph.json","fetch_events":"https://pith.science/api/pith-number/EIT3LTUQTLXOSCNPAY6Z2EKNIS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EIT3LTUQTLXOSCNPAY6Z2EKNIS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EIT3LTUQTLXOSCNPAY6Z2EKNIS/action/storage_attestation","attest_author":"https://pith.science/pith/EIT3LTUQTLXOSCNPAY6Z2EKNIS/action/author_attestation","sign_citation":"https://pith.science/pith/EIT3LTUQTLXOSCNPAY6Z2EKNIS/action/citation_signature","submit_replication":"https://pith.science/pith/EIT3LTUQTLXOSCNPAY6Z2EKNIS/action/replication_record"}},"created_at":"2026-05-18T02:26:59.317726+00:00","updated_at":"2026-05-18T02:26:59.317726+00:00"}