{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:NAJZYQUL44OB2WCGMXFJFQR4VZ","short_pith_number":"pith:NAJZYQUL","schema_version":"1.0","canonical_sha256":"68139c428be71c1d584665ca92c23cae5dac0b8bd452f6645b3bf16c20ac32bb","source":{"kind":"arxiv","id":"2206.02700","version":1},"attestation_state":"computed","paper":{"title":"Forbidding Edges between Points in the Plane to Disconnect the Triangulation Flip Graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anna Lubiw, Reza Bigdeli","submitted_at":"2022-06-06T15:57:28Z","abstract_excerpt":"The flip graph for a set $P$ of points in the plane has a vertex for every triangulation of $P$, and an edge when two triangulations differ by one flip that replaces one triangulation edge by another. The flip graph is known to have some connectivity properties: (1) the flip graph is connected; (2) connectivity still holds when restricted to triangulations containing some constrained edges between the points; (3) for $P$ in general position of size $n$, the flip graph is $\\lceil \\frac{n}{2} -2 \\rceil$-connected, a recent result of Wagner and Welzl (SODA 2020).\n  We introduce the study of conne"},"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":"2206.02700","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2022-06-06T15:57:28Z","cross_cats_sorted":[],"title_canon_sha256":"24a74c376fe1ddd53264b857f45083bdaeb073a983925fe52020856670522bad","abstract_canon_sha256":"0c99e28bf29fe7fa13efaa33d0c9bccf03bf902c8a2a4d5113d7e17c8000346c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:29:20.417353Z","signature_b64":"GS386R+/Ibcjqi/90GVOoEts2/oTXMPUUS+LLU724/f4gNglSynTg/AccrnLhTYycNsOLzTeE+H7UH6R1kuBDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68139c428be71c1d584665ca92c23cae5dac0b8bd452f6645b3bf16c20ac32bb","last_reissued_at":"2026-07-05T04:29:20.416803Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:29:20.416803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Forbidding Edges between Points in the Plane to Disconnect the Triangulation Flip Graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anna Lubiw, Reza Bigdeli","submitted_at":"2022-06-06T15:57:28Z","abstract_excerpt":"The flip graph for a set $P$ of points in the plane has a vertex for every triangulation of $P$, and an edge when two triangulations differ by one flip that replaces one triangulation edge by another. The flip graph is known to have some connectivity properties: (1) the flip graph is connected; (2) connectivity still holds when restricted to triangulations containing some constrained edges between the points; (3) for $P$ in general position of size $n$, the flip graph is $\\lceil \\frac{n}{2} -2 \\rceil$-connected, a recent result of Wagner and Welzl (SODA 2020).\n  We introduce the study of conne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.02700","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2206.02700/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2206.02700","created_at":"2026-07-05T04:29:20.416873+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.02700v1","created_at":"2026-07-05T04:29:20.416873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.02700","created_at":"2026-07-05T04:29:20.416873+00:00"},{"alias_kind":"pith_short_12","alias_value":"NAJZYQUL44OB","created_at":"2026-07-05T04:29:20.416873+00:00"},{"alias_kind":"pith_short_16","alias_value":"NAJZYQUL44OB2WCG","created_at":"2026-07-05T04:29:20.416873+00:00"},{"alias_kind":"pith_short_8","alias_value":"NAJZYQUL","created_at":"2026-07-05T04:29:20.416873+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.11108","citing_title":"History-Aware Cross-Attention Reinforcement: Self-Supervised Multi Turn and Chain-of-Thought Fine-Tuning with vLLM","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NAJZYQUL44OB2WCGMXFJFQR4VZ","json":"https://pith.science/pith/NAJZYQUL44OB2WCGMXFJFQR4VZ.json","graph_json":"https://pith.science/api/pith-number/NAJZYQUL44OB2WCGMXFJFQR4VZ/graph.json","events_json":"https://pith.science/api/pith-number/NAJZYQUL44OB2WCGMXFJFQR4VZ/events.json","paper":"https://pith.science/paper/NAJZYQUL"},"agent_actions":{"view_html":"https://pith.science/pith/NAJZYQUL44OB2WCGMXFJFQR4VZ","download_json":"https://pith.science/pith/NAJZYQUL44OB2WCGMXFJFQR4VZ.json","view_paper":"https://pith.science/paper/NAJZYQUL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.02700&json=true","fetch_graph":"https://pith.science/api/pith-number/NAJZYQUL44OB2WCGMXFJFQR4VZ/graph.json","fetch_events":"https://pith.science/api/pith-number/NAJZYQUL44OB2WCGMXFJFQR4VZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NAJZYQUL44OB2WCGMXFJFQR4VZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NAJZYQUL44OB2WCGMXFJFQR4VZ/action/storage_attestation","attest_author":"https://pith.science/pith/NAJZYQUL44OB2WCGMXFJFQR4VZ/action/author_attestation","sign_citation":"https://pith.science/pith/NAJZYQUL44OB2WCGMXFJFQR4VZ/action/citation_signature","submit_replication":"https://pith.science/pith/NAJZYQUL44OB2WCGMXFJFQR4VZ/action/replication_record"}},"created_at":"2026-07-05T04:29:20.416873+00:00","updated_at":"2026-07-05T04:29:20.416873+00:00"}