{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:CKHX3O77YF7B2ZWAKKUNXSFGEH","short_pith_number":"pith:CKHX3O77","canonical_record":{"source":{"id":"2006.12196","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-06-22T12:47:46Z","cross_cats_sorted":[],"title_canon_sha256":"f14640e02894ca8cd1b0b7a7eb98a977fa98c4ad475c31ddd4a249be94b438b2","abstract_canon_sha256":"6c32f30ba1a6b2c46e73bc5ecbec754f7cb4c7c88d513f1c8d9d0860d18f54f2"},"schema_version":"1.0"},"canonical_sha256":"128f7dbbffc17e1d66c052a8dbc8a621c41f598b86103fc58735f30b46f31bb4","source":{"kind":"arxiv","id":"2006.12196","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.12196","created_at":"2026-07-05T01:18:03Z"},{"alias_kind":"arxiv_version","alias_value":"2006.12196v2","created_at":"2026-07-05T01:18:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.12196","created_at":"2026-07-05T01:18:03Z"},{"alias_kind":"pith_short_12","alias_value":"CKHX3O77YF7B","created_at":"2026-07-05T01:18:03Z"},{"alias_kind":"pith_short_16","alias_value":"CKHX3O77YF7B2ZWA","created_at":"2026-07-05T01:18:03Z"},{"alias_kind":"pith_short_8","alias_value":"CKHX3O77","created_at":"2026-07-05T01:18:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:CKHX3O77YF7B2ZWAKKUNXSFGEH","target":"record","payload":{"canonical_record":{"source":{"id":"2006.12196","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-06-22T12:47:46Z","cross_cats_sorted":[],"title_canon_sha256":"f14640e02894ca8cd1b0b7a7eb98a977fa98c4ad475c31ddd4a249be94b438b2","abstract_canon_sha256":"6c32f30ba1a6b2c46e73bc5ecbec754f7cb4c7c88d513f1c8d9d0860d18f54f2"},"schema_version":"1.0"},"canonical_sha256":"128f7dbbffc17e1d66c052a8dbc8a621c41f598b86103fc58735f30b46f31bb4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:18:03.762893Z","signature_b64":"QW8YDye9Vlo+SE+1njHaykrxhI8U16BtYGgLg5Nyeog9ROkoedLlkVD9UYMJDAjtZ/iJdqRVieAe4vydGlO7Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"128f7dbbffc17e1d66c052a8dbc8a621c41f598b86103fc58735f30b46f31bb4","last_reissued_at":"2026-07-05T01:18:03.762436Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:18:03.762436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.12196","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-07-05T01:18:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lhj9OWRcRSxOdDLGArXG2hClKWl9VWoStA+1VoqvEGVXLKL5rJKTq468ABsSkd+3OH3lxJU9l7qO/BFErTnmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T11:37:32.792286Z"},"content_sha256":"78c7e2a4a13565f4faf467eb8b5c7566ec94dc3c60a942b587c21cc202bedc36","schema_version":"1.0","event_id":"sha256:78c7e2a4a13565f4faf467eb8b5c7566ec94dc3c60a942b587c21cc202bedc36"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:CKHX3O77YF7B2ZWAKKUNXSFGEH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Estimating Properties of Social Networks via Random Walk considering 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":"2020-06-22T12:47:46Z","abstract_excerpt":"Accurately analyzing graph properties of social networks is a challenging task because of access limitations to the graph data. To address this challenge, several algorithms to obtain unbiased estimates of properties from few samples via a random walk have been studied. However, existing algorithms do not consider private nodes who hide their neighbors in real social networks, leading to some practical problems. Here we design random walk-based algorithms to accurately estimate properties without any problems caused by private nodes. First, we design a random walk-based sampling algorithm that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.12196","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.12196/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-05T01:18:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FGRuoGgYZMVAiSOzRUY3RsKBzSbLFDoAqLscnOpTBZkBUKpbjsnOhUltx0LVAa/ZRmTF6ZTFkb1ZeySb+ru1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T11:37:32.792663Z"},"content_sha256":"4ec860a0c972e08cc34a63533d2646f2fcd941c34ef2d2062162813c3cb857e2","schema_version":"1.0","event_id":"sha256:4ec860a0c972e08cc34a63533d2646f2fcd941c34ef2d2062162813c3cb857e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CKHX3O77YF7B2ZWAKKUNXSFGEH/bundle.json","state_url":"https://pith.science/pith/CKHX3O77YF7B2ZWAKKUNXSFGEH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CKHX3O77YF7B2ZWAKKUNXSFGEH/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-22T11:37:32Z","links":{"resolver":"https://pith.science/pith/CKHX3O77YF7B2ZWAKKUNXSFGEH","bundle":"https://pith.science/pith/CKHX3O77YF7B2ZWAKKUNXSFGEH/bundle.json","state":"https://pith.science/pith/CKHX3O77YF7B2ZWAKKUNXSFGEH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CKHX3O77YF7B2ZWAKKUNXSFGEH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:CKHX3O77YF7B2ZWAKKUNXSFGEH","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":"6c32f30ba1a6b2c46e73bc5ecbec754f7cb4c7c88d513f1c8d9d0860d18f54f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-06-22T12:47:46Z","title_canon_sha256":"f14640e02894ca8cd1b0b7a7eb98a977fa98c4ad475c31ddd4a249be94b438b2"},"schema_version":"1.0","source":{"id":"2006.12196","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.12196","created_at":"2026-07-05T01:18:03Z"},{"alias_kind":"arxiv_version","alias_value":"2006.12196v2","created_at":"2026-07-05T01:18:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.12196","created_at":"2026-07-05T01:18:03Z"},{"alias_kind":"pith_short_12","alias_value":"CKHX3O77YF7B","created_at":"2026-07-05T01:18:03Z"},{"alias_kind":"pith_short_16","alias_value":"CKHX3O77YF7B2ZWA","created_at":"2026-07-05T01:18:03Z"},{"alias_kind":"pith_short_8","alias_value":"CKHX3O77","created_at":"2026-07-05T01:18:03Z"}],"graph_snapshots":[{"event_id":"sha256:4ec860a0c972e08cc34a63533d2646f2fcd941c34ef2d2062162813c3cb857e2","target":"graph","created_at":"2026-07-05T01:18: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2006.12196/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Accurately analyzing graph properties of social networks is a challenging task because of access limitations to the graph data. To address this challenge, several algorithms to obtain unbiased estimates of properties from few samples via a random walk have been studied. However, existing algorithms do not consider private nodes who hide their neighbors in real social networks, leading to some practical problems. Here we design random walk-based algorithms to accurately estimate properties without any problems caused by private nodes. First, we design a random walk-based sampling algorithm that","authors_text":"Kazuki Nakajima, Kazuyuki Shudo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-06-22T12:47:46Z","title":"Estimating Properties of Social Networks via Random Walk considering Private Nodes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.12196","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:78c7e2a4a13565f4faf467eb8b5c7566ec94dc3c60a942b587c21cc202bedc36","target":"record","created_at":"2026-07-05T01:18: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":"6c32f30ba1a6b2c46e73bc5ecbec754f7cb4c7c88d513f1c8d9d0860d18f54f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-06-22T12:47:46Z","title_canon_sha256":"f14640e02894ca8cd1b0b7a7eb98a977fa98c4ad475c31ddd4a249be94b438b2"},"schema_version":"1.0","source":{"id":"2006.12196","kind":"arxiv","version":2}},"canonical_sha256":"128f7dbbffc17e1d66c052a8dbc8a621c41f598b86103fc58735f30b46f31bb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"128f7dbbffc17e1d66c052a8dbc8a621c41f598b86103fc58735f30b46f31bb4","first_computed_at":"2026-07-05T01:18:03.762436Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:18:03.762436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QW8YDye9Vlo+SE+1njHaykrxhI8U16BtYGgLg5Nyeog9ROkoedLlkVD9UYMJDAjtZ/iJdqRVieAe4vydGlO7Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:18:03.762893Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.12196","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78c7e2a4a13565f4faf467eb8b5c7566ec94dc3c60a942b587c21cc202bedc36","sha256:4ec860a0c972e08cc34a63533d2646f2fcd941c34ef2d2062162813c3cb857e2"],"state_sha256":"4d7aca91402b85e8b3d8c83591c08537104f1a7a251b5ae3d507a4c5afc42d97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qYMEk1vCRBbCNH4+EF+UqgL4ae9gLZ09BX+OofPvWWKfqUqBMCrkE7WwwBczBGS46KAqZmho/Fc4cXh+jkJ4BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T11:37:32.795326Z","bundle_sha256":"5eb0509c9a2cc32b1d6df4904cb33af02d659f6dfbefa946a6ab16e06b9b01e5"}}