{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4IIBR3EKGH2CZDAMGHT7PPLXDV","short_pith_number":"pith:4IIBR3EK","schema_version":"1.0","canonical_sha256":"e21018ec8a31f42c8c0c31e7f7bd771d6e829c0cd32c95834fd71903948364f9","source":{"kind":"arxiv","id":"1709.00869","version":2},"attestation_state":"computed","paper":{"title":"Estimating graph parameters with random walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Anna Ben-Hamou, Roberto I. Oliveira, Yuval Peres","submitted_at":"2017-09-04T08:58:43Z","abstract_excerpt":"An algorithm observes the trajectories of random walks over an unknown graph $G$, starting from the same vertex $x$, as well as the degrees along the trajectories. For all finite connected graphs, one can estimate the number of edges $m$ up to a bounded factor in $O\\left(t_{\\mathrm{rel}}^{3/4}\\sqrt{m/d}\\right)$ steps, where $t_{\\mathrm{rel}}$ is the relaxation time of the lazy random walk on $G$ and $d$ is the minimum degree in $G$. Alternatively, $m$ can be estimated in $O\\left(t_{\\mathrm{unif}} +t_{\\mathrm{rel}}^{5/6}\\sqrt{n}\\right)$, where $n$ is the number of vertices and $t_{\\mathrm{unif}"},"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":"1709.00869","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-09-04T08:58:43Z","cross_cats_sorted":["cs.DM","cs.DS","math.PR","stat.TH"],"title_canon_sha256":"163d9be4b0785e8c07f69cbbc4c794efe432d4a75874c9d00ebd3e40204031b4","abstract_canon_sha256":"e90d07e049841197493cf84554ae55b0ab3007a96018218b9019dde6db59af21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:55.525387Z","signature_b64":"jfR79Ut29N7X3Y7zYsZVK7soXypMBMmHM/rkOolgCsYUhT3Xzs6HX3QF54QhqoG/cArbxQUyBTAYrGKvMAihCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e21018ec8a31f42c8c0c31e7f7bd771d6e829c0cd32c95834fd71903948364f9","last_reissued_at":"2026-05-18T00:07:55.524641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:55.524641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Estimating graph parameters with random walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Anna Ben-Hamou, Roberto I. Oliveira, Yuval Peres","submitted_at":"2017-09-04T08:58:43Z","abstract_excerpt":"An algorithm observes the trajectories of random walks over an unknown graph $G$, starting from the same vertex $x$, as well as the degrees along the trajectories. For all finite connected graphs, one can estimate the number of edges $m$ up to a bounded factor in $O\\left(t_{\\mathrm{rel}}^{3/4}\\sqrt{m/d}\\right)$ steps, where $t_{\\mathrm{rel}}$ is the relaxation time of the lazy random walk on $G$ and $d$ is the minimum degree in $G$. Alternatively, $m$ can be estimated in $O\\left(t_{\\mathrm{unif}} +t_{\\mathrm{rel}}^{5/6}\\sqrt{n}\\right)$, where $n$ is the number of vertices and $t_{\\mathrm{unif}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00869","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":"1709.00869","created_at":"2026-05-18T00:07:55.524739+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.00869v2","created_at":"2026-05-18T00:07:55.524739+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00869","created_at":"2026-05-18T00:07:55.524739+00:00"},{"alias_kind":"pith_short_12","alias_value":"4IIBR3EKGH2C","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"4IIBR3EKGH2CZDAM","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"4IIBR3EK","created_at":"2026-05-18T12:30:58.224056+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/4IIBR3EKGH2CZDAMGHT7PPLXDV","json":"https://pith.science/pith/4IIBR3EKGH2CZDAMGHT7PPLXDV.json","graph_json":"https://pith.science/api/pith-number/4IIBR3EKGH2CZDAMGHT7PPLXDV/graph.json","events_json":"https://pith.science/api/pith-number/4IIBR3EKGH2CZDAMGHT7PPLXDV/events.json","paper":"https://pith.science/paper/4IIBR3EK"},"agent_actions":{"view_html":"https://pith.science/pith/4IIBR3EKGH2CZDAMGHT7PPLXDV","download_json":"https://pith.science/pith/4IIBR3EKGH2CZDAMGHT7PPLXDV.json","view_paper":"https://pith.science/paper/4IIBR3EK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.00869&json=true","fetch_graph":"https://pith.science/api/pith-number/4IIBR3EKGH2CZDAMGHT7PPLXDV/graph.json","fetch_events":"https://pith.science/api/pith-number/4IIBR3EKGH2CZDAMGHT7PPLXDV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4IIBR3EKGH2CZDAMGHT7PPLXDV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4IIBR3EKGH2CZDAMGHT7PPLXDV/action/storage_attestation","attest_author":"https://pith.science/pith/4IIBR3EKGH2CZDAMGHT7PPLXDV/action/author_attestation","sign_citation":"https://pith.science/pith/4IIBR3EKGH2CZDAMGHT7PPLXDV/action/citation_signature","submit_replication":"https://pith.science/pith/4IIBR3EKGH2CZDAMGHT7PPLXDV/action/replication_record"}},"created_at":"2026-05-18T00:07:55.524739+00:00","updated_at":"2026-05-18T00:07:55.524739+00:00"}