{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2OT4MC3AI2SIXOFOES4JUU6HM4","short_pith_number":"pith:2OT4MC3A","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"},"canonical_sha256":"d3a7c60b6046a48bb8ae24b89a53c76728bb3fb7f8b018ea9efe27801750c009","source":{"kind":"arxiv","id":"1710.08815","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08815","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08815v1","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08815","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"pith_short_12","alias_value":"2OT4MC3AI2SI","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2OT4MC3AI2SIXOFO","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2OT4MC3A","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2OT4MC3AI2SIXOFOES4JUU6HM4","target":"record","payload":{"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"},"canonical_sha256":"d3a7c60b6046a48bb8ae24b89a53c76728bb3fb7f8b018ea9efe27801750c009","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"},"source_kind":"arxiv","source_id":"1710.08815","source_version":1,"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:32:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xya5GrXZQOm5PYdVeTMVwtDrY8r6tFYBHz9BzOn4Bw9gLMpeKJ80x76OjIgzhvJMg3ZPRPOngiu1HBqppthnDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:02:11.413123Z"},"content_sha256":"11218e061b6bc7886eee89313de7e227fdc09f239d009bc0669d989cbd72da6f","schema_version":"1.0","event_id":"sha256:11218e061b6bc7886eee89313de7e227fdc09f239d009bc0669d989cbd72da6f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2OT4MC3AI2SIXOFOES4JUU6HM4","target":"graph","payload":{"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"},"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:32:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZH8yV/5/n1DyJIzKgm/VTXiv4VyZHa6y2QfIAsWeD6mFYi26lBO+TjVK8VtLOTUxgPjXH2wcp+dYyfSNmemsAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:02:11.413743Z"},"content_sha256":"4df10edb32e9694d57fae61306978b9b5fc82dc86a5e6e8a7d0188b5cb41c28a","schema_version":"1.0","event_id":"sha256:4df10edb32e9694d57fae61306978b9b5fc82dc86a5e6e8a7d0188b5cb41c28a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2OT4MC3AI2SIXOFOES4JUU6HM4/bundle.json","state_url":"https://pith.science/pith/2OT4MC3AI2SIXOFOES4JUU6HM4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2OT4MC3AI2SIXOFOES4JUU6HM4/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-06-07T21:02:11Z","links":{"resolver":"https://pith.science/pith/2OT4MC3AI2SIXOFOES4JUU6HM4","bundle":"https://pith.science/pith/2OT4MC3AI2SIXOFOES4JUU6HM4/bundle.json","state":"https://pith.science/pith/2OT4MC3AI2SIXOFOES4JUU6HM4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2OT4MC3AI2SIXOFOES4JUU6HM4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2OT4MC3AI2SIXOFOES4JUU6HM4","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":"d0e9a3ead7d3c0225b61cdbea46ae702a71927b27f4c96cba2117089e733a7b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-24T14:50:08Z","title_canon_sha256":"3cd34b4aa917c8083a3143344deec773f80f10ab657f0460cc42eced52bb6e68"},"schema_version":"1.0","source":{"id":"1710.08815","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08815","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08815v1","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08815","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"pith_short_12","alias_value":"2OT4MC3AI2SI","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2OT4MC3AI2SIXOFO","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2OT4MC3A","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:4df10edb32e9694d57fae61306978b9b5fc82dc86a5e6e8a7d0188b5cb41c28a","target":"graph","created_at":"2026-05-18T00:32:03Z","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":"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","authors_text":"Flavio Chierichetti, Shahrzad Haddadan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-24T14:50:08Z","title":"On the Complexity of Sampling Nodes Uniformly from a Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08815","kind":"arxiv","version":1},"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:11218e061b6bc7886eee89313de7e227fdc09f239d009bc0669d989cbd72da6f","target":"record","created_at":"2026-05-18T00:32:03Z","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":"d0e9a3ead7d3c0225b61cdbea46ae702a71927b27f4c96cba2117089e733a7b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-24T14:50:08Z","title_canon_sha256":"3cd34b4aa917c8083a3143344deec773f80f10ab657f0460cc42eced52bb6e68"},"schema_version":"1.0","source":{"id":"1710.08815","kind":"arxiv","version":1}},"canonical_sha256":"d3a7c60b6046a48bb8ae24b89a53c76728bb3fb7f8b018ea9efe27801750c009","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3a7c60b6046a48bb8ae24b89a53c76728bb3fb7f8b018ea9efe27801750c009","first_computed_at":"2026-05-18T00:32:03.743468Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:03.743468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4XpfRd3yl0y0wD+vDOZZ+OJ/LyIczMza3tBZc1PUfB3FZ3bHHB8nsXrh3HYsNMQkLrxidOJE2PqIAxtEJV78Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:03.744098Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.08815","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11218e061b6bc7886eee89313de7e227fdc09f239d009bc0669d989cbd72da6f","sha256:4df10edb32e9694d57fae61306978b9b5fc82dc86a5e6e8a7d0188b5cb41c28a"],"state_sha256":"b3b57299c03645c7bbd2e034f93d2504734553e4928ee4000122f4474ecc99eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1JrjEf/ufRKwc4USaZQ3ndzcaqsf2tZXXeefdhyW5o816ctP5n8ws26sWhs4Qz7GVNxbDfBCc0FkweZ2VExWCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T21:02:11.417430Z","bundle_sha256":"02a6ba1e8b54327a601da31c8bbe2f82eb85ab8449c58a859642c674f3418079"}}