{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:SBU534R5OX62CVLWAPNLKZUXLC","short_pith_number":"pith:SBU534R5","canonical_record":{"source":{"id":"1002.1751","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.DS","submitted_at":"2010-02-09T15:00:13Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"398ba1194f5d8d3f67d5d8ddb0cfd05d9b9f96c9a387f18393aca10a71427ad1","abstract_canon_sha256":"e4f7fc2124da43e0edd200e0609a8d17d78dea51c00a71ecf8ebd018e222c502"},"schema_version":"1.0"},"canonical_sha256":"9069ddf23d75fda1557603dab566975888195b78e0d382d20c52f97aba552016","source":{"kind":"arxiv","id":"1002.1751","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.1751","created_at":"2026-05-18T04:41:16Z"},{"alias_kind":"arxiv_version","alias_value":"1002.1751v2","created_at":"2026-05-18T04:41:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.1751","created_at":"2026-05-18T04:41:16Z"},{"alias_kind":"pith_short_12","alias_value":"SBU534R5OX62","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SBU534R5OX62CVLW","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SBU534R5","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:SBU534R5OX62CVLWAPNLKZUXLC","target":"record","payload":{"canonical_record":{"source":{"id":"1002.1751","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.DS","submitted_at":"2010-02-09T15:00:13Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"398ba1194f5d8d3f67d5d8ddb0cfd05d9b9f96c9a387f18393aca10a71427ad1","abstract_canon_sha256":"e4f7fc2124da43e0edd200e0609a8d17d78dea51c00a71ecf8ebd018e222c502"},"schema_version":"1.0"},"canonical_sha256":"9069ddf23d75fda1557603dab566975888195b78e0d382d20c52f97aba552016","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:16.284922Z","signature_b64":"5ZEItC3cgCMPD3y20MfrwUF1waMqvapWS6pFyvcyqmMurniHwqo5Ks9X/G6gwuCwUY65vfkSHCKOWft0mLt4AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9069ddf23d75fda1557603dab566975888195b78e0d382d20c52f97aba552016","last_reissued_at":"2026-05-18T04:41:16.284448Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:16.284448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1002.1751","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-18T04:41:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dlHAzUKfIiKNxfrwb+3+2NoViF1ltQqEwUJV2NPzmJEMApb9s+6/qSv4P1uwdtDdUMJgRPYRh3739EBTa4x/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:05:27.453398Z"},"content_sha256":"9d8ad581e4536948bc8ca113d5c1b93a8b5aeac21a87e6e744804c907ef97760","schema_version":"1.0","event_id":"sha256:9d8ad581e4536948bc8ca113d5c1b93a8b5aeac21a87e6e744804c907ef97760"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:SBU534R5OX62CVLWAPNLKZUXLC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Estimating and Sampling Graphs with Multidimensional Random Walks","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Bruno Ribeiro, Don Towsley","submitted_at":"2010-02-09T15:00:13Z","abstract_excerpt":"Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random walks are useful but have drawbacks. Random vertex sampling may require too many resources (time, bandwidth, or money). Random walks, which normally require fewer resources per sample, can suffer from large estimation errors in the presence of disconnected or loosely connected graphs. In this work we propose a new $m$-dimensional random walk that uses $m$ dependent random walkers. We show that the proposed sampling met"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.1751","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-18T04:41:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xoO8exUaaY72wKAam4HnzYYpI0CsGkC8UTr1ZHyjpn2RSEECrtSK+xVwKACL9wuAJLC9953e5K2p5o+xAesXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:05:27.454120Z"},"content_sha256":"f5e143cbe3e3db7a5609d91a52cf330c900121bd44034bb12487be74b04035fc","schema_version":"1.0","event_id":"sha256:f5e143cbe3e3db7a5609d91a52cf330c900121bd44034bb12487be74b04035fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SBU534R5OX62CVLWAPNLKZUXLC/bundle.json","state_url":"https://pith.science/pith/SBU534R5OX62CVLWAPNLKZUXLC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SBU534R5OX62CVLWAPNLKZUXLC/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-05-26T19:05:27Z","links":{"resolver":"https://pith.science/pith/SBU534R5OX62CVLWAPNLKZUXLC","bundle":"https://pith.science/pith/SBU534R5OX62CVLWAPNLKZUXLC/bundle.json","state":"https://pith.science/pith/SBU534R5OX62CVLWAPNLKZUXLC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SBU534R5OX62CVLWAPNLKZUXLC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:SBU534R5OX62CVLWAPNLKZUXLC","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":"e4f7fc2124da43e0edd200e0609a8d17d78dea51c00a71ecf8ebd018e222c502","cross_cats_sorted":["cs.NI"],"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.DS","submitted_at":"2010-02-09T15:00:13Z","title_canon_sha256":"398ba1194f5d8d3f67d5d8ddb0cfd05d9b9f96c9a387f18393aca10a71427ad1"},"schema_version":"1.0","source":{"id":"1002.1751","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.1751","created_at":"2026-05-18T04:41:16Z"},{"alias_kind":"arxiv_version","alias_value":"1002.1751v2","created_at":"2026-05-18T04:41:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.1751","created_at":"2026-05-18T04:41:16Z"},{"alias_kind":"pith_short_12","alias_value":"SBU534R5OX62","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SBU534R5OX62CVLW","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SBU534R5","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:f5e143cbe3e3db7a5609d91a52cf330c900121bd44034bb12487be74b04035fc","target":"graph","created_at":"2026-05-18T04:41:16Z","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":"Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random walks are useful but have drawbacks. Random vertex sampling may require too many resources (time, bandwidth, or money). Random walks, which normally require fewer resources per sample, can suffer from large estimation errors in the presence of disconnected or loosely connected graphs. In this work we propose a new $m$-dimensional random walk that uses $m$ dependent random walkers. We show that the proposed sampling met","authors_text":"Bruno Ribeiro, Don Towsley","cross_cats":["cs.NI"],"headline":"","license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.DS","submitted_at":"2010-02-09T15:00:13Z","title":"Estimating and Sampling Graphs with Multidimensional Random Walks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.1751","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:9d8ad581e4536948bc8ca113d5c1b93a8b5aeac21a87e6e744804c907ef97760","target":"record","created_at":"2026-05-18T04:41:16Z","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":"e4f7fc2124da43e0edd200e0609a8d17d78dea51c00a71ecf8ebd018e222c502","cross_cats_sorted":["cs.NI"],"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.DS","submitted_at":"2010-02-09T15:00:13Z","title_canon_sha256":"398ba1194f5d8d3f67d5d8ddb0cfd05d9b9f96c9a387f18393aca10a71427ad1"},"schema_version":"1.0","source":{"id":"1002.1751","kind":"arxiv","version":2}},"canonical_sha256":"9069ddf23d75fda1557603dab566975888195b78e0d382d20c52f97aba552016","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9069ddf23d75fda1557603dab566975888195b78e0d382d20c52f97aba552016","first_computed_at":"2026-05-18T04:41:16.284448Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:16.284448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5ZEItC3cgCMPD3y20MfrwUF1waMqvapWS6pFyvcyqmMurniHwqo5Ks9X/G6gwuCwUY65vfkSHCKOWft0mLt4AA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:16.284922Z","signed_message":"canonical_sha256_bytes"},"source_id":"1002.1751","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d8ad581e4536948bc8ca113d5c1b93a8b5aeac21a87e6e744804c907ef97760","sha256:f5e143cbe3e3db7a5609d91a52cf330c900121bd44034bb12487be74b04035fc"],"state_sha256":"874857973b39424318a713fb6affd67056f8baadb56fad6abd59f276aa20cb88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+QFsvJOFWpZpJKB9cgys3t3Lp0CdU3ODGYIiDPuCXB+rNCMuIAOoSkMVfxDc73qBpoN5tCoZMkGOtsZiLxN6DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:05:27.457924Z","bundle_sha256":"eb6578a3e928212e43353b576e2fb04a092ebbcfc70f0f0b392c35ad3bba5548"}}