{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:E5USL7GPQCXU6WHVUI7FACNSI7","short_pith_number":"pith:E5USL7GP","canonical_record":{"source":{"id":"2305.12314","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2023-05-21T01:37:50Z","cross_cats_sorted":[],"title_canon_sha256":"64a83b0256fcb4d686b44dffdfb3a0cf40d98988655fb1211240bd721589b6e2","abstract_canon_sha256":"e25f200c2f9a2816b4232e15374975d9888009678f4a4b0b5aca0a01343871ed"},"schema_version":"1.0"},"canonical_sha256":"276925fccf80af4f58f5a23e5009b247c574599746531f01f132725ffcf9c0bf","source":{"kind":"arxiv","id":"2305.12314","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.12314","created_at":"2026-07-05T06:12:09Z"},{"alias_kind":"arxiv_version","alias_value":"2305.12314v1","created_at":"2026-07-05T06:12:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.12314","created_at":"2026-07-05T06:12:09Z"},{"alias_kind":"pith_short_12","alias_value":"E5USL7GPQCXU","created_at":"2026-07-05T06:12:09Z"},{"alias_kind":"pith_short_16","alias_value":"E5USL7GPQCXU6WHV","created_at":"2026-07-05T06:12:09Z"},{"alias_kind":"pith_short_8","alias_value":"E5USL7GP","created_at":"2026-07-05T06:12:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:E5USL7GPQCXU6WHVUI7FACNSI7","target":"record","payload":{"canonical_record":{"source":{"id":"2305.12314","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2023-05-21T01:37:50Z","cross_cats_sorted":[],"title_canon_sha256":"64a83b0256fcb4d686b44dffdfb3a0cf40d98988655fb1211240bd721589b6e2","abstract_canon_sha256":"e25f200c2f9a2816b4232e15374975d9888009678f4a4b0b5aca0a01343871ed"},"schema_version":"1.0"},"canonical_sha256":"276925fccf80af4f58f5a23e5009b247c574599746531f01f132725ffcf9c0bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:12:09.226286Z","signature_b64":"ZeE3tRlhdT0S+22O1HTJP9cm4TuFPp0nZauG2zbDKq4mFIjFAImmW4cSsd62cgWFFmaaJtoVPfo19yUAQRLhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"276925fccf80af4f58f5a23e5009b247c574599746531f01f132725ffcf9c0bf","last_reissued_at":"2026-07-05T06:12:09.225887Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:12:09.225887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.12314","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-07-05T06:12:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A33AR4NMbWdS/+0KbjM7k5e70UNDQTeoW3yOyvqa+rU7fdjCBvU1jvlxoW6vjSEwG+9LFD2YMBzOv3ftany0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T08:27:34.607412Z"},"content_sha256":"346b8edb8911d9913b206ab28e6ff75a96cc9b3bc3a35810e994646e8b2e4497","schema_version":"1.0","event_id":"sha256:346b8edb8911d9913b206ab28e6ff75a96cc9b3bc3a35810e994646e8b2e4497"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:E5USL7GPQCXU6WHVUI7FACNSI7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random Walk Sampling in Social Networks Involving Private Nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Kazuki Nakajima, Kazuyuki Shudo","submitted_at":"2023-05-21T01:37:50Z","abstract_excerpt":"Analysis of social networks with limited data access is challenging for third parties. To address this challenge, a number of studies have developed algorithms that estimate properties of social networks via a simple random walk. However, most existing algorithms do not assume private nodes that do not publish their neighbors' data when they are queried in empirical social networks. Here we propose a practical framework for estimating properties via random walk-based sampling in social networks involving private nodes. First, we develop a sampling algorithm by extending a simple random walk to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.12314","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.12314/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:12:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zoj/POx5cdxMzFI8xyZyas12jRvt1C5kWB73K5mW1sVSjpu6Y9pyBYJ53OJ39pQcMuOmZei9N/zBVzUOWUV3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T08:27:34.607955Z"},"content_sha256":"82779c956e5ea857e0ca637e544e87e5a16e15cdd72c1c0697e1f49c057abbc5","schema_version":"1.0","event_id":"sha256:82779c956e5ea857e0ca637e544e87e5a16e15cdd72c1c0697e1f49c057abbc5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E5USL7GPQCXU6WHVUI7FACNSI7/bundle.json","state_url":"https://pith.science/pith/E5USL7GPQCXU6WHVUI7FACNSI7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E5USL7GPQCXU6WHVUI7FACNSI7/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-08-22T08:27:34Z","links":{"resolver":"https://pith.science/pith/E5USL7GPQCXU6WHVUI7FACNSI7","bundle":"https://pith.science/pith/E5USL7GPQCXU6WHVUI7FACNSI7/bundle.json","state":"https://pith.science/pith/E5USL7GPQCXU6WHVUI7FACNSI7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E5USL7GPQCXU6WHVUI7FACNSI7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:E5USL7GPQCXU6WHVUI7FACNSI7","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":"e25f200c2f9a2816b4232e15374975d9888009678f4a4b0b5aca0a01343871ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2023-05-21T01:37:50Z","title_canon_sha256":"64a83b0256fcb4d686b44dffdfb3a0cf40d98988655fb1211240bd721589b6e2"},"schema_version":"1.0","source":{"id":"2305.12314","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.12314","created_at":"2026-07-05T06:12:09Z"},{"alias_kind":"arxiv_version","alias_value":"2305.12314v1","created_at":"2026-07-05T06:12:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.12314","created_at":"2026-07-05T06:12:09Z"},{"alias_kind":"pith_short_12","alias_value":"E5USL7GPQCXU","created_at":"2026-07-05T06:12:09Z"},{"alias_kind":"pith_short_16","alias_value":"E5USL7GPQCXU6WHV","created_at":"2026-07-05T06:12:09Z"},{"alias_kind":"pith_short_8","alias_value":"E5USL7GP","created_at":"2026-07-05T06:12:09Z"}],"graph_snapshots":[{"event_id":"sha256:82779c956e5ea857e0ca637e544e87e5a16e15cdd72c1c0697e1f49c057abbc5","target":"graph","created_at":"2026-07-05T06:12:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2305.12314/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Analysis of social networks with limited data access is challenging for third parties. To address this challenge, a number of studies have developed algorithms that estimate properties of social networks via a simple random walk. However, most existing algorithms do not assume private nodes that do not publish their neighbors' data when they are queried in empirical social networks. Here we propose a practical framework for estimating properties via random walk-based sampling in social networks involving private nodes. First, we develop a sampling algorithm by extending a simple random walk to","authors_text":"Kazuki Nakajima, Kazuyuki Shudo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2023-05-21T01:37:50Z","title":"Random Walk Sampling in Social Networks Involving Private Nodes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.12314","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:346b8edb8911d9913b206ab28e6ff75a96cc9b3bc3a35810e994646e8b2e4497","target":"record","created_at":"2026-07-05T06:12:09Z","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":"e25f200c2f9a2816b4232e15374975d9888009678f4a4b0b5aca0a01343871ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2023-05-21T01:37:50Z","title_canon_sha256":"64a83b0256fcb4d686b44dffdfb3a0cf40d98988655fb1211240bd721589b6e2"},"schema_version":"1.0","source":{"id":"2305.12314","kind":"arxiv","version":1}},"canonical_sha256":"276925fccf80af4f58f5a23e5009b247c574599746531f01f132725ffcf9c0bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"276925fccf80af4f58f5a23e5009b247c574599746531f01f132725ffcf9c0bf","first_computed_at":"2026-07-05T06:12:09.225887Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:12:09.225887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZeE3tRlhdT0S+22O1HTJP9cm4TuFPp0nZauG2zbDKq4mFIjFAImmW4cSsd62cgWFFmaaJtoVPfo19yUAQRLhAw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:12:09.226286Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.12314","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:346b8edb8911d9913b206ab28e6ff75a96cc9b3bc3a35810e994646e8b2e4497","sha256:82779c956e5ea857e0ca637e544e87e5a16e15cdd72c1c0697e1f49c057abbc5"],"state_sha256":"7ba384ea8b6e2e3e3768730d9d6e823f98269e49888c1f6e2741829253308532"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gzr2+TFGQGFEodATIIm6hnYInWd1OXWF/0Z17ms4y/JwEOQmX0ymVF5IWEiCQguafK4J6XTyvRDiAJ5ZIvQsBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T08:27:34.612900Z","bundle_sha256":"22562c97fae51a8f9b1be39376e8f04372bc278e34fe59110c308a8636d93aa3"}}