{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:H2KWLNYPWIVBEN7HNSIRLIKOOA","short_pith_number":"pith:H2KWLNYP","schema_version":"1.0","canonical_sha256":"3e9565b70fb22a1237e76c9115a14e700ca71a826cc719d2165de97239801128","source":{"kind":"arxiv","id":"1011.2450","version":2},"attestation_state":"computed","paper":{"title":"A Turan-type problem on distances in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Uzzell, Mykhaylo Tyomkyn","submitted_at":"2010-11-10T18:21:01Z","abstract_excerpt":"We suggest a new type of problem about distances in graphs and make several conjectures. As a first step towards proving them, we show that for sufficiently large values of n and k, a graph on n vertices that has no three vertices at pairwise distance k has at most (n-k+1)^2/4 pairs of vertices at distance k."},"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":"1011.2450","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-10T18:21:01Z","cross_cats_sorted":[],"title_canon_sha256":"f8fbcc454dba3292ac05b9bff71d7dd7a9a741265cf53d86987c40e6a1d038d4","abstract_canon_sha256":"38302a860a6509b1e3d9a80e30832aae2df091310ff10427e559cf0d2d6fa84d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:12.153012Z","signature_b64":"Ot0Xo0dQ83Ryk04AwnQK4If4eiC2r8sb3OM7Mpi46ijQXkFeTq32h5PuGs1jCLLZYfQ+CqHC+qLMrrsYII8bDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e9565b70fb22a1237e76c9115a14e700ca71a826cc719d2165de97239801128","last_reissued_at":"2026-05-18T03:49:12.152331Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:12.152331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Turan-type problem on distances in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Uzzell, Mykhaylo Tyomkyn","submitted_at":"2010-11-10T18:21:01Z","abstract_excerpt":"We suggest a new type of problem about distances in graphs and make several conjectures. As a first step towards proving them, we show that for sufficiently large values of n and k, a graph on n vertices that has no three vertices at pairwise distance k has at most (n-k+1)^2/4 pairs of vertices at distance k."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2450","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":"1011.2450","created_at":"2026-05-18T03:49:12.152443+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.2450v2","created_at":"2026-05-18T03:49:12.152443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2450","created_at":"2026-05-18T03:49:12.152443+00:00"},{"alias_kind":"pith_short_12","alias_value":"H2KWLNYPWIVB","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"H2KWLNYPWIVBEN7H","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"H2KWLNYP","created_at":"2026-05-18T12:26:07.630475+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/H2KWLNYPWIVBEN7HNSIRLIKOOA","json":"https://pith.science/pith/H2KWLNYPWIVBEN7HNSIRLIKOOA.json","graph_json":"https://pith.science/api/pith-number/H2KWLNYPWIVBEN7HNSIRLIKOOA/graph.json","events_json":"https://pith.science/api/pith-number/H2KWLNYPWIVBEN7HNSIRLIKOOA/events.json","paper":"https://pith.science/paper/H2KWLNYP"},"agent_actions":{"view_html":"https://pith.science/pith/H2KWLNYPWIVBEN7HNSIRLIKOOA","download_json":"https://pith.science/pith/H2KWLNYPWIVBEN7HNSIRLIKOOA.json","view_paper":"https://pith.science/paper/H2KWLNYP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.2450&json=true","fetch_graph":"https://pith.science/api/pith-number/H2KWLNYPWIVBEN7HNSIRLIKOOA/graph.json","fetch_events":"https://pith.science/api/pith-number/H2KWLNYPWIVBEN7HNSIRLIKOOA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H2KWLNYPWIVBEN7HNSIRLIKOOA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H2KWLNYPWIVBEN7HNSIRLIKOOA/action/storage_attestation","attest_author":"https://pith.science/pith/H2KWLNYPWIVBEN7HNSIRLIKOOA/action/author_attestation","sign_citation":"https://pith.science/pith/H2KWLNYPWIVBEN7HNSIRLIKOOA/action/citation_signature","submit_replication":"https://pith.science/pith/H2KWLNYPWIVBEN7HNSIRLIKOOA/action/replication_record"}},"created_at":"2026-05-18T03:49:12.152443+00:00","updated_at":"2026-05-18T03:49:12.152443+00:00"}