{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MPZCFU2AZ3N6KYZGTNRKVMOZBO","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":"acc3b30f17c7587d53148d337ad28344dbc14aa4a9691aecf6dddef9d78e310c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-17T15:44:34Z","title_canon_sha256":"ce33b6d2a2e0c2c175594a23767341f48594943f6498d4f26d6ef7c5c9902ad4"},"schema_version":"1.0","source":{"id":"1402.4037","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4037","created_at":"2026-05-18T02:26:52Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4037v2","created_at":"2026-05-18T02:26:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4037","created_at":"2026-05-18T02:26:52Z"},{"alias_kind":"pith_short_12","alias_value":"MPZCFU2AZ3N6","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MPZCFU2AZ3N6KYZG","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MPZCFU2A","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:ae01ecba9cc8b10162f4b6ac7de3c460d59516b5b0e590dd2f73076a747c3453","target":"graph","created_at":"2026-05-18T02:26:52Z","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":"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.","authors_text":"Claire Mathieu, Hang Zhou, Sampath Kannan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-17T15:44:34Z","title":"Near-Linear Query Complexity for Graph Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4037","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:5bd364571eb6e557065c5dd670707c97138074445e1ec593d2ce0a4e28301edf","target":"record","created_at":"2026-05-18T02:26:52Z","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":"acc3b30f17c7587d53148d337ad28344dbc14aa4a9691aecf6dddef9d78e310c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-17T15:44:34Z","title_canon_sha256":"ce33b6d2a2e0c2c175594a23767341f48594943f6498d4f26d6ef7c5c9902ad4"},"schema_version":"1.0","source":{"id":"1402.4037","kind":"arxiv","version":2}},"canonical_sha256":"63f222d340cedbe563269b62aab1d90b91785be850d08945d16d332364824649","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63f222d340cedbe563269b62aab1d90b91785be850d08945d16d332364824649","first_computed_at":"2026-05-18T02:26:52.978292Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:52.978292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7XfvxkTFgJShb2KBuaZ+8iaxo4ouyYx3aEj3cJa172kESBjGXAJTcvB/fY6R3pZCTqpfOJ+0XplRRoeGR4NgDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:52.978742Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.4037","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5bd364571eb6e557065c5dd670707c97138074445e1ec593d2ce0a4e28301edf","sha256:ae01ecba9cc8b10162f4b6ac7de3c460d59516b5b0e590dd2f73076a747c3453"],"state_sha256":"83ac9efe260f97370022ecfda55e5514fbf37737f7c00e6e9d405666401a5d89"}