{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2OT4MC3AI2SIXOFOES4JUU6HM4","short_pith_number":"pith:2OT4MC3A","schema_version":"1.0","canonical_sha256":"d3a7c60b6046a48bb8ae24b89a53c76728bb3fb7f8b018ea9efe27801750c009","source":{"kind":"arxiv","id":"1710.08815","version":1},"attestation_state":"computed","paper":{"title":"On the Complexity of Sampling Nodes Uniformly from a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Flavio Chierichetti, Shahrzad Haddadan","submitted_at":"2017-10-24T14:50:08Z","abstract_excerpt":"We study a number of graph exploration problems in the following natural scenario: an algorithm starts exploring an undirected graph from some seed node; the algorithm, for an arbitrary node $v$ that it is aware of, can ask an oracle to return the set of the neighbors of $v$. (In social network analysis, a call to this oracle corresponds to downloading the profile page of user $v$ in a social network.) The goal of the algorithm is to either learn something (e.g., average degree) about the graph, or to return some random function of the graph (e.g., a uniform-at-random node), while accessing/do"},"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":"1710.08815","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-24T14:50:08Z","cross_cats_sorted":[],"title_canon_sha256":"3cd34b4aa917c8083a3143344deec773f80f10ab657f0460cc42eced52bb6e68","abstract_canon_sha256":"d0e9a3ead7d3c0225b61cdbea46ae702a71927b27f4c96cba2117089e733a7b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:03.744098Z","signature_b64":"4XpfRd3yl0y0wD+vDOZZ+OJ/LyIczMza3tBZc1PUfB3FZ3bHHB8nsXrh3HYsNMQkLrxidOJE2PqIAxtEJV78Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3a7c60b6046a48bb8ae24b89a53c76728bb3fb7f8b018ea9efe27801750c009","last_reissued_at":"2026-05-18T00:32:03.743468Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:03.743468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Sampling Nodes Uniformly from a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Flavio Chierichetti, Shahrzad Haddadan","submitted_at":"2017-10-24T14:50:08Z","abstract_excerpt":"We study a number of graph exploration problems in the following natural scenario: an algorithm starts exploring an undirected graph from some seed node; the algorithm, for an arbitrary node $v$ that it is aware of, can ask an oracle to return the set of the neighbors of $v$. (In social network analysis, a call to this oracle corresponds to downloading the profile page of user $v$ in a social network.) The goal of the algorithm is to either learn something (e.g., average degree) about the graph, or to return some random function of the graph (e.g., a uniform-at-random node), while accessing/do"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08815","kind":"arxiv","version":1},"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":"1710.08815","created_at":"2026-05-18T00:32:03.743575+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.08815v1","created_at":"2026-05-18T00:32:03.743575+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08815","created_at":"2026-05-18T00:32:03.743575+00:00"},{"alias_kind":"pith_short_12","alias_value":"2OT4MC3AI2SI","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2OT4MC3AI2SIXOFO","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2OT4MC3A","created_at":"2026-05-18T12:30:55.937587+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/2OT4MC3AI2SIXOFOES4JUU6HM4","json":"https://pith.science/pith/2OT4MC3AI2SIXOFOES4JUU6HM4.json","graph_json":"https://pith.science/api/pith-number/2OT4MC3AI2SIXOFOES4JUU6HM4/graph.json","events_json":"https://pith.science/api/pith-number/2OT4MC3AI2SIXOFOES4JUU6HM4/events.json","paper":"https://pith.science/paper/2OT4MC3A"},"agent_actions":{"view_html":"https://pith.science/pith/2OT4MC3AI2SIXOFOES4JUU6HM4","download_json":"https://pith.science/pith/2OT4MC3AI2SIXOFOES4JUU6HM4.json","view_paper":"https://pith.science/paper/2OT4MC3A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.08815&json=true","fetch_graph":"https://pith.science/api/pith-number/2OT4MC3AI2SIXOFOES4JUU6HM4/graph.json","fetch_events":"https://pith.science/api/pith-number/2OT4MC3AI2SIXOFOES4JUU6HM4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2OT4MC3AI2SIXOFOES4JUU6HM4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2OT4MC3AI2SIXOFOES4JUU6HM4/action/storage_attestation","attest_author":"https://pith.science/pith/2OT4MC3AI2SIXOFOES4JUU6HM4/action/author_attestation","sign_citation":"https://pith.science/pith/2OT4MC3AI2SIXOFOES4JUU6HM4/action/citation_signature","submit_replication":"https://pith.science/pith/2OT4MC3AI2SIXOFOES4JUU6HM4/action/replication_record"}},"created_at":"2026-05-18T00:32:03.743575+00:00","updated_at":"2026-05-18T00:32:03.743575+00:00"}