{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:FHEIKLTDZTV47355XYSZBIJXAD","short_pith_number":"pith:FHEIKLTD","canonical_record":{"source":{"id":"2404.18318","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-04-28T21:04:46Z","cross_cats_sorted":[],"title_canon_sha256":"e68ca225fe2ca95e50ac7092dd301738f01967aa6fe56be9dcfda12668b50de5","abstract_canon_sha256":"19cdad6718deb3aebcd64520db173ee7faa9f46075d84f8ad190d02884a66932"},"schema_version":"1.0"},"canonical_sha256":"29c8852e63ccebcfefbdbe2590a13700e061e8db1bb185a004894731dbe3c2e0","source":{"kind":"arxiv","id":"2404.18318","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.18318","created_at":"2026-07-05T08:49:53Z"},{"alias_kind":"arxiv_version","alias_value":"2404.18318v2","created_at":"2026-07-05T08:49:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.18318","created_at":"2026-07-05T08:49:53Z"},{"alias_kind":"pith_short_12","alias_value":"FHEIKLTDZTV4","created_at":"2026-07-05T08:49:53Z"},{"alias_kind":"pith_short_16","alias_value":"FHEIKLTDZTV47355","created_at":"2026-07-05T08:49:53Z"},{"alias_kind":"pith_short_8","alias_value":"FHEIKLTD","created_at":"2026-07-05T08:49:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:FHEIKLTDZTV47355XYSZBIJXAD","target":"record","payload":{"canonical_record":{"source":{"id":"2404.18318","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-04-28T21:04:46Z","cross_cats_sorted":[],"title_canon_sha256":"e68ca225fe2ca95e50ac7092dd301738f01967aa6fe56be9dcfda12668b50de5","abstract_canon_sha256":"19cdad6718deb3aebcd64520db173ee7faa9f46075d84f8ad190d02884a66932"},"schema_version":"1.0"},"canonical_sha256":"29c8852e63ccebcfefbdbe2590a13700e061e8db1bb185a004894731dbe3c2e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:49:53.134519Z","signature_b64":"K/mgTd0nK3cH+hVCe4l7U8JL9WenaTOxWDaEhWgNECpsRJPweR9j5FkkshiRDCyjisJ704I6P5P3N3xHDxPRCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29c8852e63ccebcfefbdbe2590a13700e061e8db1bb185a004894731dbe3c2e0","last_reissued_at":"2026-07-05T08:49:53.134164Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:49:53.134164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.18318","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-07-05T08:49:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3L0IAwPMfR08Yil48iImjJMJ+TZ1xvTSVQor/uRj9x3H5WwOAO8wRZL8T/0HIj8OljJ6qVO7SUVA6NOtA60IAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T17:05:57.507702Z"},"content_sha256":"d7dba9f14704c381d46426d3474c400abd02023ba2e375e3c841086752bfe693","schema_version":"1.0","event_id":"sha256:d7dba9f14704c381d46426d3474c400abd02023ba2e375e3c841086752bfe693"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:FHEIKLTDZTV47355XYSZBIJXAD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reconstructing random graphs from distance queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maksim Zhukovskii, Michael Krivelevich","submitted_at":"2024-04-28T21:04:46Z","abstract_excerpt":"We estimate the minimum number of distance queries that is sufficient to reconstruct the binomial random graph $G(n,p)$ with constant diameter with high probability. We get a tight (up to a constant factor) answer for all $p>n^{-1+o(1)}$ outside \"threshold windows\" around $n^{-k/(k+1)+o(1)}$, $k\\in\\mathbb{Z}_{>0}$: with high probability the query complexity equals $\\Theta(n^{4-d}p^{2-d})$, where $d$ is the diameter of the random graph. This demonstrates the following non-monotone behaviour: the query complexity jumps down at moments when the diameter gets larger; yet, between these moments the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.18318","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.18318/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:49:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JDwrLmi9H8iVccKaSbD8Y+4hdygP8cSfsKdKkwYC8wVU9E6C44h8DNSjpD4XSTPIK0SmukddWxOtNDhliwUUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T17:05:57.508687Z"},"content_sha256":"78d22b198b114f7c9afae16ebf1aaf3dea4c4f39516444454506e8a7a522692f","schema_version":"1.0","event_id":"sha256:78d22b198b114f7c9afae16ebf1aaf3dea4c4f39516444454506e8a7a522692f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FHEIKLTDZTV47355XYSZBIJXAD/bundle.json","state_url":"https://pith.science/pith/FHEIKLTDZTV47355XYSZBIJXAD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FHEIKLTDZTV47355XYSZBIJXAD/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-08-14T17:05:57Z","links":{"resolver":"https://pith.science/pith/FHEIKLTDZTV47355XYSZBIJXAD","bundle":"https://pith.science/pith/FHEIKLTDZTV47355XYSZBIJXAD/bundle.json","state":"https://pith.science/pith/FHEIKLTDZTV47355XYSZBIJXAD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FHEIKLTDZTV47355XYSZBIJXAD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:FHEIKLTDZTV47355XYSZBIJXAD","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":"19cdad6718deb3aebcd64520db173ee7faa9f46075d84f8ad190d02884a66932","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-04-28T21:04:46Z","title_canon_sha256":"e68ca225fe2ca95e50ac7092dd301738f01967aa6fe56be9dcfda12668b50de5"},"schema_version":"1.0","source":{"id":"2404.18318","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.18318","created_at":"2026-07-05T08:49:53Z"},{"alias_kind":"arxiv_version","alias_value":"2404.18318v2","created_at":"2026-07-05T08:49:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.18318","created_at":"2026-07-05T08:49:53Z"},{"alias_kind":"pith_short_12","alias_value":"FHEIKLTDZTV4","created_at":"2026-07-05T08:49:53Z"},{"alias_kind":"pith_short_16","alias_value":"FHEIKLTDZTV47355","created_at":"2026-07-05T08:49:53Z"},{"alias_kind":"pith_short_8","alias_value":"FHEIKLTD","created_at":"2026-07-05T08:49:53Z"}],"graph_snapshots":[{"event_id":"sha256:78d22b198b114f7c9afae16ebf1aaf3dea4c4f39516444454506e8a7a522692f","target":"graph","created_at":"2026-07-05T08:49:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2404.18318/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We estimate the minimum number of distance queries that is sufficient to reconstruct the binomial random graph $G(n,p)$ with constant diameter with high probability. We get a tight (up to a constant factor) answer for all $p>n^{-1+o(1)}$ outside \"threshold windows\" around $n^{-k/(k+1)+o(1)}$, $k\\in\\mathbb{Z}_{>0}$: with high probability the query complexity equals $\\Theta(n^{4-d}p^{2-d})$, where $d$ is the diameter of the random graph. This demonstrates the following non-monotone behaviour: the query complexity jumps down at moments when the diameter gets larger; yet, between these moments the","authors_text":"Maksim Zhukovskii, Michael Krivelevich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-04-28T21:04:46Z","title":"Reconstructing random graphs from distance queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.18318","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:d7dba9f14704c381d46426d3474c400abd02023ba2e375e3c841086752bfe693","target":"record","created_at":"2026-07-05T08:49:53Z","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":"19cdad6718deb3aebcd64520db173ee7faa9f46075d84f8ad190d02884a66932","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-04-28T21:04:46Z","title_canon_sha256":"e68ca225fe2ca95e50ac7092dd301738f01967aa6fe56be9dcfda12668b50de5"},"schema_version":"1.0","source":{"id":"2404.18318","kind":"arxiv","version":2}},"canonical_sha256":"29c8852e63ccebcfefbdbe2590a13700e061e8db1bb185a004894731dbe3c2e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29c8852e63ccebcfefbdbe2590a13700e061e8db1bb185a004894731dbe3c2e0","first_computed_at":"2026-07-05T08:49:53.134164Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:49:53.134164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K/mgTd0nK3cH+hVCe4l7U8JL9WenaTOxWDaEhWgNECpsRJPweR9j5FkkshiRDCyjisJ704I6P5P3N3xHDxPRCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:49:53.134519Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.18318","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7dba9f14704c381d46426d3474c400abd02023ba2e375e3c841086752bfe693","sha256:78d22b198b114f7c9afae16ebf1aaf3dea4c4f39516444454506e8a7a522692f"],"state_sha256":"05192e84572b4c2879d305404361d23a6e316d3a5b09949e1ec266d125e0f35c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kZV4tq6fmQi+wKtg+fZgx4ULcFwznRikq5XKKZFjP8YdiLWbE+4fV7rVmrhAFE4Z0qVSF6pmx4s2qPFQ7o03BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T17:05:57.515834Z","bundle_sha256":"b4ff4da1c28cf9947005d1e3284c8430a1822fd0737a57fe25991ec5f0b6744a"}}