{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:475HRIL7J5MN5SP3VLV3EIA6XY","short_pith_number":"pith:475HRIL7","schema_version":"1.0","canonical_sha256":"e7fa78a17f4f58dec9fbaaebb2201ebe3361b98758ac5ac24f0fe1a67cc53e4e","source":{"kind":"arxiv","id":"1103.0412","version":2},"attestation_state":"computed","paper":{"title":"Counting large distances in convex polygons","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"David Pritchard, Filip Mori\\'c","submitted_at":"2011-03-02T12:46:34Z","abstract_excerpt":"In a convex n-gon, let d[1] > d[2] > ... denote the set of all distances between pairs of vertices, and let m[i] be the number of pairs of vertices at distance d[i] from one another. Erdos, Lovasz, and Vesztergombi conjectured that m[1] + ... + m[k] <= k*n. Using a new computational approach, we prove their conjecture when k <= 4 and n is large; we also make some progress for arbitrary k by proving that m[1] + ... + m[k] <= (2k-1)n. Our main approach revolves around a few known facts about distances, together with a computer program that searches all distance configurations of two disjoint con"},"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":"1103.0412","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2011-03-02T12:46:34Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"dd31f1f7afb0a1c66f07f7e58fb77e17b6553ab84ddeeda81a8608422b0d7ba2","abstract_canon_sha256":"299a5a3099bf75cf3fee7c73ebfa8e50e30c69d536b97af15e319ec776281e41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:40.751224Z","signature_b64":"n4N6W1+rs+2yc+svnsX2G4ASjPW8ow1fsANG9tC0Q5S2HCEDAFJIaMV7UYtBqOIF1yaR0hCXGxjUmZMFC/xABg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7fa78a17f4f58dec9fbaaebb2201ebe3361b98758ac5ac24f0fe1a67cc53e4e","last_reissued_at":"2026-05-18T04:16:40.750543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:40.750543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting large distances in convex polygons","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"David Pritchard, Filip Mori\\'c","submitted_at":"2011-03-02T12:46:34Z","abstract_excerpt":"In a convex n-gon, let d[1] > d[2] > ... denote the set of all distances between pairs of vertices, and let m[i] be the number of pairs of vertices at distance d[i] from one another. Erdos, Lovasz, and Vesztergombi conjectured that m[1] + ... + m[k] <= k*n. Using a new computational approach, we prove their conjecture when k <= 4 and n is large; we also make some progress for arbitrary k by proving that m[1] + ... + m[k] <= (2k-1)n. Our main approach revolves around a few known facts about distances, together with a computer program that searches all distance configurations of two disjoint con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0412","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":"1103.0412","created_at":"2026-05-18T04:16:40.750644+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.0412v2","created_at":"2026-05-18T04:16:40.750644+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0412","created_at":"2026-05-18T04:16:40.750644+00:00"},{"alias_kind":"pith_short_12","alias_value":"475HRIL7J5MN","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"475HRIL7J5MN5SP3","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"475HRIL7","created_at":"2026-05-18T12:26:20.644004+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/475HRIL7J5MN5SP3VLV3EIA6XY","json":"https://pith.science/pith/475HRIL7J5MN5SP3VLV3EIA6XY.json","graph_json":"https://pith.science/api/pith-number/475HRIL7J5MN5SP3VLV3EIA6XY/graph.json","events_json":"https://pith.science/api/pith-number/475HRIL7J5MN5SP3VLV3EIA6XY/events.json","paper":"https://pith.science/paper/475HRIL7"},"agent_actions":{"view_html":"https://pith.science/pith/475HRIL7J5MN5SP3VLV3EIA6XY","download_json":"https://pith.science/pith/475HRIL7J5MN5SP3VLV3EIA6XY.json","view_paper":"https://pith.science/paper/475HRIL7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.0412&json=true","fetch_graph":"https://pith.science/api/pith-number/475HRIL7J5MN5SP3VLV3EIA6XY/graph.json","fetch_events":"https://pith.science/api/pith-number/475HRIL7J5MN5SP3VLV3EIA6XY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/475HRIL7J5MN5SP3VLV3EIA6XY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/475HRIL7J5MN5SP3VLV3EIA6XY/action/storage_attestation","attest_author":"https://pith.science/pith/475HRIL7J5MN5SP3VLV3EIA6XY/action/author_attestation","sign_citation":"https://pith.science/pith/475HRIL7J5MN5SP3VLV3EIA6XY/action/citation_signature","submit_replication":"https://pith.science/pith/475HRIL7J5MN5SP3VLV3EIA6XY/action/replication_record"}},"created_at":"2026-05-18T04:16:40.750644+00:00","updated_at":"2026-05-18T04:16:40.750644+00:00"}