{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:I45BW2SMK54NAN7JVB2QOFVSUQ","short_pith_number":"pith:I45BW2SM","canonical_record":{"source":{"id":"1302.4546","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-02-19T09:09:20Z","cross_cats_sorted":["cs.DS","physics.soc-ph"],"title_canon_sha256":"ad0337d75f14e2b94a939f0a793f795aee955de2a77b1cdd7ae9560e0e41d146","abstract_canon_sha256":"8a7e8faccd74de5a1ede35d91603b7c26ccf2465000fb626348dcd3971884ab1"},"schema_version":"1.0"},"canonical_sha256":"473a1b6a4c5778d037e9a8750716b2a402b3031c175ee62b06b0ec7682870115","source":{"kind":"arxiv","id":"1302.4546","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4546","created_at":"2026-05-18T03:33:12Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4546v1","created_at":"2026-05-18T03:33:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4546","created_at":"2026-05-18T03:33:12Z"},{"alias_kind":"pith_short_12","alias_value":"I45BW2SMK54N","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"I45BW2SMK54NAN7J","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"I45BW2SM","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:I45BW2SMK54NAN7JVB2QOFVSUQ","target":"record","payload":{"canonical_record":{"source":{"id":"1302.4546","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-02-19T09:09:20Z","cross_cats_sorted":["cs.DS","physics.soc-ph"],"title_canon_sha256":"ad0337d75f14e2b94a939f0a793f795aee955de2a77b1cdd7ae9560e0e41d146","abstract_canon_sha256":"8a7e8faccd74de5a1ede35d91603b7c26ccf2465000fb626348dcd3971884ab1"},"schema_version":"1.0"},"canonical_sha256":"473a1b6a4c5778d037e9a8750716b2a402b3031c175ee62b06b0ec7682870115","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:12.963352Z","signature_b64":"J69CT3rlNmxXFiw2YTBj22wnq47jLn64c51u1vgTfClxd0RpwtI0dkVBmHQLtyaI724uO2yMv0asGpXwZCv5Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"473a1b6a4c5778d037e9a8750716b2a402b3031c175ee62b06b0ec7682870115","last_reissued_at":"2026-05-18T03:33:12.962621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:12.962621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.4546","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-18T03:33:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GO10WIU+fSp5BMBQY3C8hh7kT9i/Yr3OSYUv9ppZbtOusHmE8OKOB3Xvd8xn4/EY6izWbIwDhYTjE9VOiMdVDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:41:08.400596Z"},"content_sha256":"d7e826ea14ecf03b833aded4d80025c9107a83d3924733b8bd4ec7ca54a0f2fb","schema_version":"1.0","event_id":"sha256:d7e826ea14ecf03b833aded4d80025c9107a83d3924733b8bd4ec7ca54a0f2fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:I45BW2SMK54NAN7JVB2QOFVSUQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random-walk domination in large graphs: problem definitions and fast solutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Hong Cheng, Jeffrey Xu Yu, Rong-Hua Li, Xin Huang","submitted_at":"2013-02-19T09:09:20Z","abstract_excerpt":"We introduce and formulate two types of random-walk domination problems in graphs motivated by a number of applications in practice (e.g., item-placement problem in online social network, Ads-placement problem in advertisement networks, and resource-placement problem in P2P networks). Specifically, given a graph $G$, the goal of the first type of random-walk domination problem is to target $k$ nodes such that the total hitting time of an $L$-length random walk starting from the remaining nodes to the targeted nodes is minimal. The second type of random-walk domination problem is to find $k$ no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4546","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-18T03:33:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kOa3T+8rHrdBbnlOdgYz0ytVX4j7aUBd9dQCbYzyg74BkSCNnmMqBOOMlFW+pp+M68MGyU8U9JzgrAuOMZPHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:41:08.400969Z"},"content_sha256":"e61fc8296e8a149882c270cd70bd590a8a08d38e2f68d87a5f0f8c6056575e1c","schema_version":"1.0","event_id":"sha256:e61fc8296e8a149882c270cd70bd590a8a08d38e2f68d87a5f0f8c6056575e1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I45BW2SMK54NAN7JVB2QOFVSUQ/bundle.json","state_url":"https://pith.science/pith/I45BW2SMK54NAN7JVB2QOFVSUQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I45BW2SMK54NAN7JVB2QOFVSUQ/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-03T00:41:08Z","links":{"resolver":"https://pith.science/pith/I45BW2SMK54NAN7JVB2QOFVSUQ","bundle":"https://pith.science/pith/I45BW2SMK54NAN7JVB2QOFVSUQ/bundle.json","state":"https://pith.science/pith/I45BW2SMK54NAN7JVB2QOFVSUQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I45BW2SMK54NAN7JVB2QOFVSUQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:I45BW2SMK54NAN7JVB2QOFVSUQ","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":"8a7e8faccd74de5a1ede35d91603b7c26ccf2465000fb626348dcd3971884ab1","cross_cats_sorted":["cs.DS","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-02-19T09:09:20Z","title_canon_sha256":"ad0337d75f14e2b94a939f0a793f795aee955de2a77b1cdd7ae9560e0e41d146"},"schema_version":"1.0","source":{"id":"1302.4546","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4546","created_at":"2026-05-18T03:33:12Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4546v1","created_at":"2026-05-18T03:33:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4546","created_at":"2026-05-18T03:33:12Z"},{"alias_kind":"pith_short_12","alias_value":"I45BW2SMK54N","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"I45BW2SMK54NAN7J","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"I45BW2SM","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:e61fc8296e8a149882c270cd70bd590a8a08d38e2f68d87a5f0f8c6056575e1c","target":"graph","created_at":"2026-05-18T03:33:12Z","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 introduce and formulate two types of random-walk domination problems in graphs motivated by a number of applications in practice (e.g., item-placement problem in online social network, Ads-placement problem in advertisement networks, and resource-placement problem in P2P networks). Specifically, given a graph $G$, the goal of the first type of random-walk domination problem is to target $k$ nodes such that the total hitting time of an $L$-length random walk starting from the remaining nodes to the targeted nodes is minimal. The second type of random-walk domination problem is to find $k$ no","authors_text":"Hong Cheng, Jeffrey Xu Yu, Rong-Hua Li, Xin Huang","cross_cats":["cs.DS","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-02-19T09:09:20Z","title":"Random-walk domination in large graphs: problem definitions and fast solutions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4546","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:d7e826ea14ecf03b833aded4d80025c9107a83d3924733b8bd4ec7ca54a0f2fb","target":"record","created_at":"2026-05-18T03:33:12Z","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":"8a7e8faccd74de5a1ede35d91603b7c26ccf2465000fb626348dcd3971884ab1","cross_cats_sorted":["cs.DS","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-02-19T09:09:20Z","title_canon_sha256":"ad0337d75f14e2b94a939f0a793f795aee955de2a77b1cdd7ae9560e0e41d146"},"schema_version":"1.0","source":{"id":"1302.4546","kind":"arxiv","version":1}},"canonical_sha256":"473a1b6a4c5778d037e9a8750716b2a402b3031c175ee62b06b0ec7682870115","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"473a1b6a4c5778d037e9a8750716b2a402b3031c175ee62b06b0ec7682870115","first_computed_at":"2026-05-18T03:33:12.962621Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:12.962621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J69CT3rlNmxXFiw2YTBj22wnq47jLn64c51u1vgTfClxd0RpwtI0dkVBmHQLtyaI724uO2yMv0asGpXwZCv5Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:12.963352Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.4546","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7e826ea14ecf03b833aded4d80025c9107a83d3924733b8bd4ec7ca54a0f2fb","sha256:e61fc8296e8a149882c270cd70bd590a8a08d38e2f68d87a5f0f8c6056575e1c"],"state_sha256":"76c9a1934fba58fdfb4e92fadc45138d8dcdeed7c95479f4fa9a17836cd09902"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"twkM6WIfIdtuXm9LboGyOcDbKgDvS+RFvT0OSVrWddyNH6WUlhONOwgM2TkTtmrF4aAvko3Ty1rvK6TGT92RCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T00:41:08.403033Z","bundle_sha256":"618bc2762d0e387dc22ae6a3a691be28d97c798527bdbb403a3aae3fb93c413d"}}