{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:H2KWLNYPWIVBEN7HNSIRLIKOOA","short_pith_number":"pith:H2KWLNYP","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"},"canonical_sha256":"3e9565b70fb22a1237e76c9115a14e700ca71a826cc719d2165de97239801128","source":{"kind":"arxiv","id":"1011.2450","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:H2KWLNYPWIVBEN7HNSIRLIKOOA","target":"record","payload":{"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"},"canonical_sha256":"3e9565b70fb22a1237e76c9115a14e700ca71a826cc719d2165de97239801128","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"},"source_kind":"arxiv","source_id":"1011.2450","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-18T03:49:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/P+OBTqyIhdSremnG3Jc7jp9eZN4dZ4H30mio6DvBOBS+1yJOkgyEccVbeK67dhfzONHuKPDlNPBi3T1x+jcAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:56:28.443693Z"},"content_sha256":"708336749615b12610aaa3027913c92752c377c195a6310d40be8afcd524210c","schema_version":"1.0","event_id":"sha256:708336749615b12610aaa3027913c92752c377c195a6310d40be8afcd524210c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:H2KWLNYPWIVBEN7HNSIRLIKOOA","target":"graph","payload":{"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"},"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-18T03:49:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bBtd4gyDE5kXUfELMlBD9LxZJuPe4YYPk2w1HQjLoEwO0d7LAJitQh362nInJJ2wPLx+wx/Cyr+mEEZtwaecAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:56:28.444033Z"},"content_sha256":"ae2f73f2a01634de990f5077d8a795851ca5f11eb39672de00abdeb442dbd2ee","schema_version":"1.0","event_id":"sha256:ae2f73f2a01634de990f5077d8a795851ca5f11eb39672de00abdeb442dbd2ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H2KWLNYPWIVBEN7HNSIRLIKOOA/bundle.json","state_url":"https://pith.science/pith/H2KWLNYPWIVBEN7HNSIRLIKOOA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H2KWLNYPWIVBEN7HNSIRLIKOOA/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-03T17:56:28Z","links":{"resolver":"https://pith.science/pith/H2KWLNYPWIVBEN7HNSIRLIKOOA","bundle":"https://pith.science/pith/H2KWLNYPWIVBEN7HNSIRLIKOOA/bundle.json","state":"https://pith.science/pith/H2KWLNYPWIVBEN7HNSIRLIKOOA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H2KWLNYPWIVBEN7HNSIRLIKOOA/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RMzLX2oq3RCrJC9us4VJPTDoY+xEOQsHHH61VTOf8esTGr8OFXHQPhKDpy7kjkPZsebnLQzC3RZtC2vLmjN3Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:56:28.445986Z","bundle_sha256":"d49ec8883f98a43847ef0857ac24ed8d825ab8b5741f596cceb1bc2a9586ed2f"}}