{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:H2KWLNYPWIVBEN7HNSIRLIKOOA","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":"38302a860a6509b1e3d9a80e30832aae2df091310ff10427e559cf0d2d6fa84d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-10T18:21:01Z","title_canon_sha256":"f8fbcc454dba3292ac05b9bff71d7dd7a9a741265cf53d86987c40e6a1d038d4"},"schema_version":"1.0","source":{"id":"1011.2450","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2450","created_at":"2026-05-18T03:49:12Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2450v2","created_at":"2026-05-18T03:49:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2450","created_at":"2026-05-18T03:49:12Z"},{"alias_kind":"pith_short_12","alias_value":"H2KWLNYPWIVB","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"H2KWLNYPWIVBEN7H","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"H2KWLNYP","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:ae2f73f2a01634de990f5077d8a795851ca5f11eb39672de00abdeb442dbd2ee","target":"graph","created_at":"2026-05-18T03:49:12Z","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":"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.","authors_text":"Andrew Uzzell, Mykhaylo Tyomkyn","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-10T18:21:01Z","title":"A Turan-type problem on distances in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2450","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:708336749615b12610aaa3027913c92752c377c195a6310d40be8afcd524210c","target":"record","created_at":"2026-05-18T03:49:12Z","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":"38302a860a6509b1e3d9a80e30832aae2df091310ff10427e559cf0d2d6fa84d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-10T18:21:01Z","title_canon_sha256":"f8fbcc454dba3292ac05b9bff71d7dd7a9a741265cf53d86987c40e6a1d038d4"},"schema_version":"1.0","source":{"id":"1011.2450","kind":"arxiv","version":2}},"canonical_sha256":"3e9565b70fb22a1237e76c9115a14e700ca71a826cc719d2165de97239801128","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e9565b70fb22a1237e76c9115a14e700ca71a826cc719d2165de97239801128","first_computed_at":"2026-05-18T03:49:12.152331Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:12.152331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ot0Xo0dQ83Ryk04AwnQK4If4eiC2r8sb3OM7Mpi46ijQXkFeTq32h5PuGs1jCLLZYfQ+CqHC+qLMrrsYII8bDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:12.153012Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.2450","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:708336749615b12610aaa3027913c92752c377c195a6310d40be8afcd524210c","sha256:ae2f73f2a01634de990f5077d8a795851ca5f11eb39672de00abdeb442dbd2ee"],"state_sha256":"a1cfee3918d7e2b855547d801e1e508811acb7291b542ff1ac6e72f475c794d3"}