{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:E6PI7ID45GUDIT7I52D5BZTU4X","short_pith_number":"pith:E6PI7ID4","schema_version":"1.0","canonical_sha256":"279e8fa07ce9a8344fe8ee87d0e674e5f33d15800e0d0586edee15889dd5cc98","source":{"kind":"arxiv","id":"1101.5463","version":2},"attestation_state":"computed","paper":{"title":"Walking on a Graph with a Magnifying Glass: Stratified Sampling via Weighted Random Walks","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":["cs.NI","physics.soc-ph","stat.ME"],"primary_cat":"cs.SI","authors_text":"A. Markopoulou, C. T. Butts, M. Gjoka, M. Kurant","submitted_at":"2011-01-28T06:27:45Z","abstract_excerpt":"Our objective is to sample the node set of a large unknown graph via crawling, to accurately estimate a given metric of interest. We design a random walk on an appropriately defined weighted graph that achieves high efficiency by preferentially crawling those nodes and edges that convey greater information regarding the target metric. Our approach begins by employing the theory of stratification to find optimal node weights, for a given estimation problem, under an independence sampler. While optimal under independence sampling, these weights may be impractical under graph crawling due to cons"},"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":"1101.5463","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.SI","submitted_at":"2011-01-28T06:27:45Z","cross_cats_sorted":["cs.NI","physics.soc-ph","stat.ME"],"title_canon_sha256":"447373cb26edd43a7f1c1789316f91813e01cc12e987ae9a3c9b274e5fb41b81","abstract_canon_sha256":"1cf9b5cf66ebedfcdd4276cf19d286b11a8c7302b5c01e2be8f05a1138367d4e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:38.849216Z","signature_b64":"VjlmD5AutQENpzsmwTm0hm1Uv6wU+X8J8YkMDUOPaKc9PXwc6vgQ+puF48G6NbTHzquZqCJEvO2XJEQlW66vCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"279e8fa07ce9a8344fe8ee87d0e674e5f33d15800e0d0586edee15889dd5cc98","last_reissued_at":"2026-05-18T04:25:38.848772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:38.848772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Walking on a Graph with a Magnifying Glass: Stratified Sampling via Weighted Random Walks","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":["cs.NI","physics.soc-ph","stat.ME"],"primary_cat":"cs.SI","authors_text":"A. Markopoulou, C. T. Butts, M. Gjoka, M. Kurant","submitted_at":"2011-01-28T06:27:45Z","abstract_excerpt":"Our objective is to sample the node set of a large unknown graph via crawling, to accurately estimate a given metric of interest. We design a random walk on an appropriately defined weighted graph that achieves high efficiency by preferentially crawling those nodes and edges that convey greater information regarding the target metric. Our approach begins by employing the theory of stratification to find optimal node weights, for a given estimation problem, under an independence sampler. While optimal under independence sampling, these weights may be impractical under graph crawling due to cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.5463","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":"1101.5463","created_at":"2026-05-18T04:25:38.848830+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.5463v2","created_at":"2026-05-18T04:25:38.848830+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.5463","created_at":"2026-05-18T04:25:38.848830+00:00"},{"alias_kind":"pith_short_12","alias_value":"E6PI7ID45GUD","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"E6PI7ID45GUDIT7I","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"E6PI7ID4","created_at":"2026-05-18T12:26:26.731475+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/E6PI7ID45GUDIT7I52D5BZTU4X","json":"https://pith.science/pith/E6PI7ID45GUDIT7I52D5BZTU4X.json","graph_json":"https://pith.science/api/pith-number/E6PI7ID45GUDIT7I52D5BZTU4X/graph.json","events_json":"https://pith.science/api/pith-number/E6PI7ID45GUDIT7I52D5BZTU4X/events.json","paper":"https://pith.science/paper/E6PI7ID4"},"agent_actions":{"view_html":"https://pith.science/pith/E6PI7ID45GUDIT7I52D5BZTU4X","download_json":"https://pith.science/pith/E6PI7ID45GUDIT7I52D5BZTU4X.json","view_paper":"https://pith.science/paper/E6PI7ID4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.5463&json=true","fetch_graph":"https://pith.science/api/pith-number/E6PI7ID45GUDIT7I52D5BZTU4X/graph.json","fetch_events":"https://pith.science/api/pith-number/E6PI7ID45GUDIT7I52D5BZTU4X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E6PI7ID45GUDIT7I52D5BZTU4X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E6PI7ID45GUDIT7I52D5BZTU4X/action/storage_attestation","attest_author":"https://pith.science/pith/E6PI7ID45GUDIT7I52D5BZTU4X/action/author_attestation","sign_citation":"https://pith.science/pith/E6PI7ID45GUDIT7I52D5BZTU4X/action/citation_signature","submit_replication":"https://pith.science/pith/E6PI7ID45GUDIT7I52D5BZTU4X/action/replication_record"}},"created_at":"2026-05-18T04:25:38.848830+00:00","updated_at":"2026-05-18T04:25:38.848830+00:00"}