{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:475HRIL7J5MN5SP3VLV3EIA6XY","short_pith_number":"pith:475HRIL7","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"},"canonical_sha256":"e7fa78a17f4f58dec9fbaaebb2201ebe3361b98758ac5ac24f0fe1a67cc53e4e","source":{"kind":"arxiv","id":"1103.0412","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0412","created_at":"2026-05-18T04:16:40Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0412v2","created_at":"2026-05-18T04:16:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0412","created_at":"2026-05-18T04:16:40Z"},{"alias_kind":"pith_short_12","alias_value":"475HRIL7J5MN","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"475HRIL7J5MN5SP3","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"475HRIL7","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:475HRIL7J5MN5SP3VLV3EIA6XY","target":"record","payload":{"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"},"canonical_sha256":"e7fa78a17f4f58dec9fbaaebb2201ebe3361b98758ac5ac24f0fe1a67cc53e4e","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"},"source_kind":"arxiv","source_id":"1103.0412","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:16:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cZaRTr2Gon9EH7yHDd2ygHT4jv7XsEYZWNtkxmiCerAoHphhXsGtADBymGOIXtW/3FC8Vc9o/MJtJENIzTHZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:21:11.122727Z"},"content_sha256":"ffc19487ebfaee94693c69dece6fab6726c855a00d92740ce3fa3f854514af11","schema_version":"1.0","event_id":"sha256:ffc19487ebfaee94693c69dece6fab6726c855a00d92740ce3fa3f854514af11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:475HRIL7J5MN5SP3VLV3EIA6XY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:16:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kp16a77Gx4gyGoriEDD5aKvpyEgxsnp4UveSEULsnbN0NRAuu+AMqKKxzadojWTxnd+eo3fP2jHGEHcHUDY6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:21:11.123062Z"},"content_sha256":"521b5f75576afe2a39cd35e7e8e1992f19f925dce3682e5da7d48ee89afbe549","schema_version":"1.0","event_id":"sha256:521b5f75576afe2a39cd35e7e8e1992f19f925dce3682e5da7d48ee89afbe549"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/475HRIL7J5MN5SP3VLV3EIA6XY/bundle.json","state_url":"https://pith.science/pith/475HRIL7J5MN5SP3VLV3EIA6XY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/475HRIL7J5MN5SP3VLV3EIA6XY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T16:21:11Z","links":{"resolver":"https://pith.science/pith/475HRIL7J5MN5SP3VLV3EIA6XY","bundle":"https://pith.science/pith/475HRIL7J5MN5SP3VLV3EIA6XY/bundle.json","state":"https://pith.science/pith/475HRIL7J5MN5SP3VLV3EIA6XY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/475HRIL7J5MN5SP3VLV3EIA6XY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:475HRIL7J5MN5SP3VLV3EIA6XY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"299a5a3099bf75cf3fee7c73ebfa8e50e30c69d536b97af15e319ec776281e41","cross_cats_sorted":["cs.CG"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2011-03-02T12:46:34Z","title_canon_sha256":"dd31f1f7afb0a1c66f07f7e58fb77e17b6553ab84ddeeda81a8608422b0d7ba2"},"schema_version":"1.0","source":{"id":"1103.0412","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0412","created_at":"2026-05-18T04:16:40Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0412v2","created_at":"2026-05-18T04:16:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0412","created_at":"2026-05-18T04:16:40Z"},{"alias_kind":"pith_short_12","alias_value":"475HRIL7J5MN","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"475HRIL7J5MN5SP3","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"475HRIL7","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:521b5f75576afe2a39cd35e7e8e1992f19f925dce3682e5da7d48ee89afbe549","target":"graph","created_at":"2026-05-18T04:16:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"David Pritchard, Filip Mori\\'c","cross_cats":["cs.CG"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2011-03-02T12:46:34Z","title":"Counting large distances in convex polygons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0412","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ffc19487ebfaee94693c69dece6fab6726c855a00d92740ce3fa3f854514af11","target":"record","created_at":"2026-05-18T04:16:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"299a5a3099bf75cf3fee7c73ebfa8e50e30c69d536b97af15e319ec776281e41","cross_cats_sorted":["cs.CG"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2011-03-02T12:46:34Z","title_canon_sha256":"dd31f1f7afb0a1c66f07f7e58fb77e17b6553ab84ddeeda81a8608422b0d7ba2"},"schema_version":"1.0","source":{"id":"1103.0412","kind":"arxiv","version":2}},"canonical_sha256":"e7fa78a17f4f58dec9fbaaebb2201ebe3361b98758ac5ac24f0fe1a67cc53e4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7fa78a17f4f58dec9fbaaebb2201ebe3361b98758ac5ac24f0fe1a67cc53e4e","first_computed_at":"2026-05-18T04:16:40.750543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:40.750543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n4N6W1+rs+2yc+svnsX2G4ASjPW8ow1fsANG9tC0Q5S2HCEDAFJIaMV7UYtBqOIF1yaR0hCXGxjUmZMFC/xABg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:40.751224Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.0412","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ffc19487ebfaee94693c69dece6fab6726c855a00d92740ce3fa3f854514af11","sha256:521b5f75576afe2a39cd35e7e8e1992f19f925dce3682e5da7d48ee89afbe549"],"state_sha256":"2f5b785d77cacb5b91ec9d7f9a309e00c458d45467ca6a0949cc234988262bf1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5QeLBymk6E22OtFVGGc/MS9Kb+cBil8Hx4mv0hJIpQru6PsDkxYXT6XSO/LV8HC6lzGENiXz7S2cwOlV5jiEBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T16:21:11.125375Z","bundle_sha256":"7defed5e415d22b4ca043c3aa87210494d181a7f070e7026f35b4f9773b860b4"}}