{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4IIBR3EKGH2CZDAMGHT7PPLXDV","short_pith_number":"pith:4IIBR3EK","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"},"canonical_sha256":"e21018ec8a31f42c8c0c31e7f7bd771d6e829c0cd32c95834fd71903948364f9","source":{"kind":"arxiv","id":"1709.00869","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00869","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00869v2","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00869","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"pith_short_12","alias_value":"4IIBR3EKGH2C","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4IIBR3EKGH2CZDAM","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4IIBR3EK","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4IIBR3EKGH2CZDAMGHT7PPLXDV","target":"record","payload":{"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"},"canonical_sha256":"e21018ec8a31f42c8c0c31e7f7bd771d6e829c0cd32c95834fd71903948364f9","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"},"source_kind":"arxiv","source_id":"1709.00869","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-18T00:07:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OaacydINV6fm0Xxzn/myGGQjJVxKYTtP05mJKRcGNUgstUbn3tQi+y9xDn2h1ra8hdox37wy1EEQMMqRZDVEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T21:25:33.047562Z"},"content_sha256":"dad628221f7355dab296c20ad20ff66da76b1c16d99989c93eb5135ca729530c","schema_version":"1.0","event_id":"sha256:dad628221f7355dab296c20ad20ff66da76b1c16d99989c93eb5135ca729530c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4IIBR3EKGH2CZDAMGHT7PPLXDV","target":"graph","payload":{"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"},"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-18T00:07:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q2LiUQ1Q9wwl6jfi+Gc0U9h6jVI5xGws63jCwVN5lKbY5aBQ+STA8475lePdFgN2PpogrUQceR7lshXOxDofDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T21:25:33.047931Z"},"content_sha256":"d36e962e089194ca24320b49684c377cde10ec71fbd6366a0130190c961a8c66","schema_version":"1.0","event_id":"sha256:d36e962e089194ca24320b49684c377cde10ec71fbd6366a0130190c961a8c66"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4IIBR3EKGH2CZDAMGHT7PPLXDV/bundle.json","state_url":"https://pith.science/pith/4IIBR3EKGH2CZDAMGHT7PPLXDV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4IIBR3EKGH2CZDAMGHT7PPLXDV/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-07-01T21:25:33Z","links":{"resolver":"https://pith.science/pith/4IIBR3EKGH2CZDAMGHT7PPLXDV","bundle":"https://pith.science/pith/4IIBR3EKGH2CZDAMGHT7PPLXDV/bundle.json","state":"https://pith.science/pith/4IIBR3EKGH2CZDAMGHT7PPLXDV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4IIBR3EKGH2CZDAMGHT7PPLXDV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4IIBR3EKGH2CZDAMGHT7PPLXDV","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":"e90d07e049841197493cf84554ae55b0ab3007a96018218b9019dde6db59af21","cross_cats_sorted":["cs.DM","cs.DS","math.PR","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-09-04T08:58:43Z","title_canon_sha256":"163d9be4b0785e8c07f69cbbc4c794efe432d4a75874c9d00ebd3e40204031b4"},"schema_version":"1.0","source":{"id":"1709.00869","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00869","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00869v2","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00869","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"pith_short_12","alias_value":"4IIBR3EKGH2C","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4IIBR3EKGH2CZDAM","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4IIBR3EK","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:d36e962e089194ca24320b49684c377cde10ec71fbd6366a0130190c961a8c66","target":"graph","created_at":"2026-05-18T00:07:55Z","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":"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}","authors_text":"Anna Ben-Hamou, Roberto I. Oliveira, Yuval Peres","cross_cats":["cs.DM","cs.DS","math.PR","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-09-04T08:58:43Z","title":"Estimating graph parameters with random walks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00869","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:dad628221f7355dab296c20ad20ff66da76b1c16d99989c93eb5135ca729530c","target":"record","created_at":"2026-05-18T00:07:55Z","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":"e90d07e049841197493cf84554ae55b0ab3007a96018218b9019dde6db59af21","cross_cats_sorted":["cs.DM","cs.DS","math.PR","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-09-04T08:58:43Z","title_canon_sha256":"163d9be4b0785e8c07f69cbbc4c794efe432d4a75874c9d00ebd3e40204031b4"},"schema_version":"1.0","source":{"id":"1709.00869","kind":"arxiv","version":2}},"canonical_sha256":"e21018ec8a31f42c8c0c31e7f7bd771d6e829c0cd32c95834fd71903948364f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e21018ec8a31f42c8c0c31e7f7bd771d6e829c0cd32c95834fd71903948364f9","first_computed_at":"2026-05-18T00:07:55.524641Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:55.524641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jfR79Ut29N7X3Y7zYsZVK7soXypMBMmHM/rkOolgCsYUhT3Xzs6HX3QF54QhqoG/cArbxQUyBTAYrGKvMAihCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:55.525387Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.00869","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dad628221f7355dab296c20ad20ff66da76b1c16d99989c93eb5135ca729530c","sha256:d36e962e089194ca24320b49684c377cde10ec71fbd6366a0130190c961a8c66"],"state_sha256":"5a6235006c567c23c98b3edd662a2f8018631f99d7622698c241d69315279d97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LTNf+S3QJI2JI2RroKJZ7iYBDsoC68DWwUHxJA7CkkfEzs9EmMch7ALZlLnh5vVx4mU2GiFeoLXnkrDxebxGAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T21:25:33.050792Z","bundle_sha256":"01389d716a55c8a88adf4a410ab6c44d916ead84beddc21e501d04da8f8ff283"}}