{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KDRNWDHYJH6E2Z6KV52R65AUG7","short_pith_number":"pith:KDRNWDHY","schema_version":"1.0","canonical_sha256":"50e2db0cf849fc4d67caaf751f741437ed09723e547faf4849ac404aefb3cbb7","source":{"kind":"arxiv","id":"1706.06456","version":2},"attestation_state":"computed","paper":{"title":"Eccentricities in the flip-graphs of convex polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lionel Pournin","submitted_at":"2017-06-20T14:15:48Z","abstract_excerpt":"The flip-graph of a convex polygon $\\pi$ is the graph whose vertices are the triangulations of $\\pi$ and whose edges correspond to flips between them. The eccentricity of a triangulation $T$ of $\\pi$ is the largest possible distance in this graph from $T$ to any triangulation of $\\pi$. It is well known that, when all $n-3$ interior edges of $T$ are incident to the same vertex, the eccentricity of $T$ in the flip-graph of $\\pi$ is exactly $n-3$, where $n$ denotes the number of vertices of $\\pi$. Here, this statement is generalized to arbitrary triangulations. Denoting by $n-3-k$ the largest num"},"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":"1706.06456","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-20T14:15:48Z","cross_cats_sorted":[],"title_canon_sha256":"865d4b667a4d2ee7b64774ed4de0c62a3193b30530322bc0ab0348f4015442dd","abstract_canon_sha256":"68978a6b0abd8b632c15cdf9e9558a895e75229eddff8da602f6c17ea89415de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:52:31.564711Z","signature_b64":"t8Y4PoX7fnytHxQ7d5R4pZmuX9ic6FtYM1WzFhumermB83YSz58pwNnKeMfZ4Zp3Ktizk11CaQ4KyrVWC+MWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50e2db0cf849fc4d67caaf751f741437ed09723e547faf4849ac404aefb3cbb7","last_reissued_at":"2026-07-04T23:52:31.564274Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:52:31.564274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Eccentricities in the flip-graphs of convex polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lionel Pournin","submitted_at":"2017-06-20T14:15:48Z","abstract_excerpt":"The flip-graph of a convex polygon $\\pi$ is the graph whose vertices are the triangulations of $\\pi$ and whose edges correspond to flips between them. The eccentricity of a triangulation $T$ of $\\pi$ is the largest possible distance in this graph from $T$ to any triangulation of $\\pi$. It is well known that, when all $n-3$ interior edges of $T$ are incident to the same vertex, the eccentricity of $T$ in the flip-graph of $\\pi$ is exactly $n-3$, where $n$ denotes the number of vertices of $\\pi$. Here, this statement is generalized to arbitrary triangulations. Denoting by $n-3-k$ the largest num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06456","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1706.06456/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":"1706.06456","created_at":"2026-07-04T23:52:31.564340+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.06456v2","created_at":"2026-07-04T23:52:31.564340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06456","created_at":"2026-07-04T23:52:31.564340+00:00"},{"alias_kind":"pith_short_12","alias_value":"KDRNWDHYJH6E","created_at":"2026-07-04T23:52:31.564340+00:00"},{"alias_kind":"pith_short_16","alias_value":"KDRNWDHYJH6E2Z6K","created_at":"2026-07-04T23:52:31.564340+00:00"},{"alias_kind":"pith_short_8","alias_value":"KDRNWDHY","created_at":"2026-07-04T23:52:31.564340+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/KDRNWDHYJH6E2Z6KV52R65AUG7","json":"https://pith.science/pith/KDRNWDHYJH6E2Z6KV52R65AUG7.json","graph_json":"https://pith.science/api/pith-number/KDRNWDHYJH6E2Z6KV52R65AUG7/graph.json","events_json":"https://pith.science/api/pith-number/KDRNWDHYJH6E2Z6KV52R65AUG7/events.json","paper":"https://pith.science/paper/KDRNWDHY"},"agent_actions":{"view_html":"https://pith.science/pith/KDRNWDHYJH6E2Z6KV52R65AUG7","download_json":"https://pith.science/pith/KDRNWDHYJH6E2Z6KV52R65AUG7.json","view_paper":"https://pith.science/paper/KDRNWDHY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.06456&json=true","fetch_graph":"https://pith.science/api/pith-number/KDRNWDHYJH6E2Z6KV52R65AUG7/graph.json","fetch_events":"https://pith.science/api/pith-number/KDRNWDHYJH6E2Z6KV52R65AUG7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KDRNWDHYJH6E2Z6KV52R65AUG7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KDRNWDHYJH6E2Z6KV52R65AUG7/action/storage_attestation","attest_author":"https://pith.science/pith/KDRNWDHYJH6E2Z6KV52R65AUG7/action/author_attestation","sign_citation":"https://pith.science/pith/KDRNWDHYJH6E2Z6KV52R65AUG7/action/citation_signature","submit_replication":"https://pith.science/pith/KDRNWDHYJH6E2Z6KV52R65AUG7/action/replication_record"}},"created_at":"2026-07-04T23:52:31.564340+00:00","updated_at":"2026-07-04T23:52:31.564340+00:00"}