{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MPZCFU2AZ3N6KYZGTNRKVMOZBO","short_pith_number":"pith:MPZCFU2A","schema_version":"1.0","canonical_sha256":"63f222d340cedbe563269b62aab1d90b91785be850d08945d16d332364824649","source":{"kind":"arxiv","id":"1402.4037","version":2},"attestation_state":"computed","paper":{"title":"Near-Linear Query Complexity for Graph Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Claire Mathieu, Hang Zhou, Sampath Kannan","submitted_at":"2014-02-17T15:44:34Z","abstract_excerpt":"How efficiently can we find an unknown graph using distance or shortest path queries between its vertices? Let $G = (V,E)$ be an unweighted, connected graph of bounded degree. The edge set $E$ is initially unknown, and the graph can be accessed using a \\emph{distance oracle}, which receives a pair of vertices $(u,v)$ and returns the distance between $u$ and $v$. In the \\emph{verification} problem, we are given a hypothetical graph $\\hat G = (V,\\hat E)$ and want to check whether $G$ is equal to $\\hat G$. We analyze a natural greedy algorithm and prove that it uses $n^{1+o(1)}$ distance queries."},"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":"1402.4037","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-17T15:44:34Z","cross_cats_sorted":[],"title_canon_sha256":"ce33b6d2a2e0c2c175594a23767341f48594943f6498d4f26d6ef7c5c9902ad4","abstract_canon_sha256":"acc3b30f17c7587d53148d337ad28344dbc14aa4a9691aecf6dddef9d78e310c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:52.978742Z","signature_b64":"7XfvxkTFgJShb2KBuaZ+8iaxo4ouyYx3aEj3cJa172kESBjGXAJTcvB/fY6R3pZCTqpfOJ+0XplRRoeGR4NgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63f222d340cedbe563269b62aab1d90b91785be850d08945d16d332364824649","last_reissued_at":"2026-05-18T02:26:52.978292Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:52.978292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Linear Query Complexity for Graph Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Claire Mathieu, Hang Zhou, Sampath Kannan","submitted_at":"2014-02-17T15:44:34Z","abstract_excerpt":"How efficiently can we find an unknown graph using distance or shortest path queries between its vertices? Let $G = (V,E)$ be an unweighted, connected graph of bounded degree. The edge set $E$ is initially unknown, and the graph can be accessed using a \\emph{distance oracle}, which receives a pair of vertices $(u,v)$ and returns the distance between $u$ and $v$. In the \\emph{verification} problem, we are given a hypothetical graph $\\hat G = (V,\\hat E)$ and want to check whether $G$ is equal to $\\hat G$. We analyze a natural greedy algorithm and prove that it uses $n^{1+o(1)}$ distance queries."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4037","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":"1402.4037","created_at":"2026-05-18T02:26:52.978392+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.4037v2","created_at":"2026-05-18T02:26:52.978392+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4037","created_at":"2026-05-18T02:26:52.978392+00:00"},{"alias_kind":"pith_short_12","alias_value":"MPZCFU2AZ3N6","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MPZCFU2AZ3N6KYZG","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MPZCFU2A","created_at":"2026-05-18T12:28:38.356838+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/MPZCFU2AZ3N6KYZGTNRKVMOZBO","json":"https://pith.science/pith/MPZCFU2AZ3N6KYZGTNRKVMOZBO.json","graph_json":"https://pith.science/api/pith-number/MPZCFU2AZ3N6KYZGTNRKVMOZBO/graph.json","events_json":"https://pith.science/api/pith-number/MPZCFU2AZ3N6KYZGTNRKVMOZBO/events.json","paper":"https://pith.science/paper/MPZCFU2A"},"agent_actions":{"view_html":"https://pith.science/pith/MPZCFU2AZ3N6KYZGTNRKVMOZBO","download_json":"https://pith.science/pith/MPZCFU2AZ3N6KYZGTNRKVMOZBO.json","view_paper":"https://pith.science/paper/MPZCFU2A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.4037&json=true","fetch_graph":"https://pith.science/api/pith-number/MPZCFU2AZ3N6KYZGTNRKVMOZBO/graph.json","fetch_events":"https://pith.science/api/pith-number/MPZCFU2AZ3N6KYZGTNRKVMOZBO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MPZCFU2AZ3N6KYZGTNRKVMOZBO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MPZCFU2AZ3N6KYZGTNRKVMOZBO/action/storage_attestation","attest_author":"https://pith.science/pith/MPZCFU2AZ3N6KYZGTNRKVMOZBO/action/author_attestation","sign_citation":"https://pith.science/pith/MPZCFU2AZ3N6KYZGTNRKVMOZBO/action/citation_signature","submit_replication":"https://pith.science/pith/MPZCFU2AZ3N6KYZGTNRKVMOZBO/action/replication_record"}},"created_at":"2026-05-18T02:26:52.978392+00:00","updated_at":"2026-05-18T02:26:52.978392+00:00"}