{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PVIQUF2EOSRVJQNVOAYKW4KPQV","short_pith_number":"pith:PVIQUF2E","canonical_record":{"source":{"id":"1901.03466","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2019-01-11T03:16:30Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"79eff5102161293480ef1da4691c505ba464a19ff09d994a4b30fc71cad1cd4a","abstract_canon_sha256":"878ee4c7861dee886fcb86dfa0e2ef21b50c32866e2151282024a763bf6183a9"},"schema_version":"1.0"},"canonical_sha256":"7d510a174474a354c1b57030ab714f85502a9502ba96d1e1fe8e6231fde8e2d7","source":{"kind":"arxiv","id":"1901.03466","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03466","created_at":"2026-05-17T23:56:31Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03466v1","created_at":"2026-05-17T23:56:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03466","created_at":"2026-05-17T23:56:31Z"},{"alias_kind":"pith_short_12","alias_value":"PVIQUF2EOSRV","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PVIQUF2EOSRVJQNV","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PVIQUF2E","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PVIQUF2EOSRVJQNVOAYKW4KPQV","target":"record","payload":{"canonical_record":{"source":{"id":"1901.03466","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2019-01-11T03:16:30Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"79eff5102161293480ef1da4691c505ba464a19ff09d994a4b30fc71cad1cd4a","abstract_canon_sha256":"878ee4c7861dee886fcb86dfa0e2ef21b50c32866e2151282024a763bf6183a9"},"schema_version":"1.0"},"canonical_sha256":"7d510a174474a354c1b57030ab714f85502a9502ba96d1e1fe8e6231fde8e2d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:31.180876Z","signature_b64":"x+ATL1PxO7Ia9/Pz0Cc9xOSzzdgFK0Xfv20XKXUSmFsF1XDGf0zSji6tHglhDop2G0IOFTt7uZ6AHlgzUMpEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d510a174474a354c1b57030ab714f85502a9502ba96d1e1fe8e6231fde8e2d7","last_reissued_at":"2026-05-17T23:56:31.180477Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:31.180477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.03466","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-17T23:56:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dgQab1Ax2isgechCpwGiXtzRY9ET4BMdGZbl26S/9BusqbTX+A55c+pNrCLkLM3unEx9cs85zp02ggTY+kY6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T11:01:50.346376Z"},"content_sha256":"77d9432a93ea3669c1295ecfdffaacb5e6ca91282b5d26206ba2b0e687fefcb9","schema_version":"1.0","event_id":"sha256:77d9432a93ea3669c1295ecfdffaacb5e6ca91282b5d26206ba2b0e687fefcb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PVIQUF2EOSRVJQNVOAYKW4KPQV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Sampling for Selecting Important Nodes in Random Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"stat.ME","authors_text":"Chun-Hung Chen, Haidong Li, Xiaoyun Xu, Yijie Peng","submitted_at":"2019-01-11T03:16:30Z","abstract_excerpt":"We consider the problem of selecting important nodes in a random network, where the nodes connect to each other randomly with certain transition probabilities. The node importance is characterized by the stationary probabilities of the corresponding nodes in a Markov chain defined over the network, as in Google's PageRank. Unlike deterministic network, the transition probabilities in random network are unknown but can be estimated by sampling. Under a Bayesian learning framework, we apply the first-order Taylor expansion and normal approximation to provide a computationally efficient posterior"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03466","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-17T23:56:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H2B03jGozCWpUoPPvlsRWSeZ13Ka47OyPes3y/8R76XadzenpSzVIVuytOqRkDX3zMpBb83lyBtLRL4HylNABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T11:01:50.347137Z"},"content_sha256":"e1989a8a68eebc4a11d868fa2d5f10cd145769edc2662cfcd8bc5fa97605a3f9","schema_version":"1.0","event_id":"sha256:e1989a8a68eebc4a11d868fa2d5f10cd145769edc2662cfcd8bc5fa97605a3f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PVIQUF2EOSRVJQNVOAYKW4KPQV/bundle.json","state_url":"https://pith.science/pith/PVIQUF2EOSRVJQNVOAYKW4KPQV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PVIQUF2EOSRVJQNVOAYKW4KPQV/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-22T11:01:50Z","links":{"resolver":"https://pith.science/pith/PVIQUF2EOSRVJQNVOAYKW4KPQV","bundle":"https://pith.science/pith/PVIQUF2EOSRVJQNVOAYKW4KPQV/bundle.json","state":"https://pith.science/pith/PVIQUF2EOSRVJQNVOAYKW4KPQV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PVIQUF2EOSRVJQNVOAYKW4KPQV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PVIQUF2EOSRVJQNVOAYKW4KPQV","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":"878ee4c7861dee886fcb86dfa0e2ef21b50c32866e2151282024a763bf6183a9","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2019-01-11T03:16:30Z","title_canon_sha256":"79eff5102161293480ef1da4691c505ba464a19ff09d994a4b30fc71cad1cd4a"},"schema_version":"1.0","source":{"id":"1901.03466","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03466","created_at":"2026-05-17T23:56:31Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03466v1","created_at":"2026-05-17T23:56:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03466","created_at":"2026-05-17T23:56:31Z"},{"alias_kind":"pith_short_12","alias_value":"PVIQUF2EOSRV","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PVIQUF2EOSRVJQNV","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PVIQUF2E","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:e1989a8a68eebc4a11d868fa2d5f10cd145769edc2662cfcd8bc5fa97605a3f9","target":"graph","created_at":"2026-05-17T23:56:31Z","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 consider the problem of selecting important nodes in a random network, where the nodes connect to each other randomly with certain transition probabilities. The node importance is characterized by the stationary probabilities of the corresponding nodes in a Markov chain defined over the network, as in Google's PageRank. Unlike deterministic network, the transition probabilities in random network are unknown but can be estimated by sampling. Under a Bayesian learning framework, we apply the first-order Taylor expansion and normal approximation to provide a computationally efficient posterior","authors_text":"Chun-Hung Chen, Haidong Li, Xiaoyun Xu, Yijie Peng","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2019-01-11T03:16:30Z","title":"Efficient Sampling for Selecting Important Nodes in Random Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03466","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:77d9432a93ea3669c1295ecfdffaacb5e6ca91282b5d26206ba2b0e687fefcb9","target":"record","created_at":"2026-05-17T23:56:31Z","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":"878ee4c7861dee886fcb86dfa0e2ef21b50c32866e2151282024a763bf6183a9","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2019-01-11T03:16:30Z","title_canon_sha256":"79eff5102161293480ef1da4691c505ba464a19ff09d994a4b30fc71cad1cd4a"},"schema_version":"1.0","source":{"id":"1901.03466","kind":"arxiv","version":1}},"canonical_sha256":"7d510a174474a354c1b57030ab714f85502a9502ba96d1e1fe8e6231fde8e2d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d510a174474a354c1b57030ab714f85502a9502ba96d1e1fe8e6231fde8e2d7","first_computed_at":"2026-05-17T23:56:31.180477Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:31.180477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x+ATL1PxO7Ia9/Pz0Cc9xOSzzdgFK0Xfv20XKXUSmFsF1XDGf0zSji6tHglhDop2G0IOFTt7uZ6AHlgzUMpEAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:31.180876Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.03466","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77d9432a93ea3669c1295ecfdffaacb5e6ca91282b5d26206ba2b0e687fefcb9","sha256:e1989a8a68eebc4a11d868fa2d5f10cd145769edc2662cfcd8bc5fa97605a3f9"],"state_sha256":"ad461c739fbf77c20a8f9368958af100feb4b93a069ae0794636ea382dc11138"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eX3g+lp20KDLu1RfxT0CtDDwgxILE0pb9lCoVfLLLo4j3HDLhNjVIndHR8vSXQLkaN/EVskJ23evBYPIvXDCBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T11:01:50.351013Z","bundle_sha256":"3d8c871c5e476efa1def8e6b3777fddaf76d201466986c303ab6daddb1d9392e"}}