{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PP5FSYDTENINJ2YMOCMU3TNWWE","short_pith_number":"pith:PP5FSYDT","canonical_record":{"source":{"id":"1708.02574","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-08-08T17:40:04Z","cross_cats_sorted":[],"title_canon_sha256":"840b4122bb42c8797a19de6eadb72b3bd758d6444179387a69e8c54ef296e73a","abstract_canon_sha256":"15e2dd77443953cdeb24ea0a001b8cd259884353f0ef5fea2fe0931e55ee7a23"},"schema_version":"1.0"},"canonical_sha256":"7bfa5960732350d4eb0c70994dcdb6b13b580d74a0f5a5a029a75aae62aa3e42","source":{"kind":"arxiv","id":"1708.02574","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02574","created_at":"2026-05-18T00:29:01Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02574v4","created_at":"2026-05-18T00:29:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02574","created_at":"2026-05-18T00:29:01Z"},{"alias_kind":"pith_short_12","alias_value":"PP5FSYDTENIN","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PP5FSYDTENINJ2YM","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PP5FSYDT","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PP5FSYDTENINJ2YMOCMU3TNWWE","target":"record","payload":{"canonical_record":{"source":{"id":"1708.02574","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-08-08T17:40:04Z","cross_cats_sorted":[],"title_canon_sha256":"840b4122bb42c8797a19de6eadb72b3bd758d6444179387a69e8c54ef296e73a","abstract_canon_sha256":"15e2dd77443953cdeb24ea0a001b8cd259884353f0ef5fea2fe0931e55ee7a23"},"schema_version":"1.0"},"canonical_sha256":"7bfa5960732350d4eb0c70994dcdb6b13b580d74a0f5a5a029a75aae62aa3e42","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:01.236354Z","signature_b64":"qk/gvul07Ob+jn8877It7gAZAnn+KS0m5405MBn8pvOhPMspmBRh3KLGPxn0Y/wvyES6sIwYpe92eJjHqLR6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bfa5960732350d4eb0c70994dcdb6b13b580d74a0f5a5a029a75aae62aa3e42","last_reissued_at":"2026-05-18T00:29:01.235843Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:01.235843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.02574","source_version":4,"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-18T00:29:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dzc0labR3GarwgRlYJLBBUgo3Ob+sK28Kx+WABvF5IjpZeEFkg7cOZH0+4136T8u7nSEkRr6uT6B0R3vW0c4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:31:31.551833Z"},"content_sha256":"1dd7d87bce0378e58c47ca52a1a0f0c90d5db156b31844ed62af2731c8fa20ce","schema_version":"1.0","event_id":"sha256:1dd7d87bce0378e58c47ca52a1a0f0c90d5db156b31844ed62af2731c8fa20ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PP5FSYDTENINJ2YMOCMU3TNWWE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TPA: Fast, Scalable, and Accurate Method for Approximate Random Walk with Restart on Billion Scale Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Jinhong Jung, Minji Yoon, U Kang","submitted_at":"2017-08-08T17:40:04Z","abstract_excerpt":"Given a large graph, how can we determine similarity between nodes in a fast and accurate way? Random walk with restart (RWR) is a popular measure for this purpose and has been exploited in numerous data mining applications including ranking, anomaly detection, link prediction, and community detection. However, previous methods for computing exact RWR require prohibitive storage sizes and computational costs, and alternative methods which avoid such costs by computing approximate RWR have limited accuracy. In this paper, we propose TPA, a fast, scalable, and highly accurate method for computin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02574","kind":"arxiv","version":4},"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-18T00:29:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XhjffQIqk9fvp4Iry3/I1GyUpx6xF/TDzgNIPUD4MKNefxJbbp1SGlMyBuSpHx6xRvsABzHVMAAUooeaB9RYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:31:31.552179Z"},"content_sha256":"2511f7c77b9d77af9a0d17e115b3835533495fd3fda80ef47ed9300f2fd4fec1","schema_version":"1.0","event_id":"sha256:2511f7c77b9d77af9a0d17e115b3835533495fd3fda80ef47ed9300f2fd4fec1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PP5FSYDTENINJ2YMOCMU3TNWWE/bundle.json","state_url":"https://pith.science/pith/PP5FSYDTENINJ2YMOCMU3TNWWE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PP5FSYDTENINJ2YMOCMU3TNWWE/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-27T03:31:31Z","links":{"resolver":"https://pith.science/pith/PP5FSYDTENINJ2YMOCMU3TNWWE","bundle":"https://pith.science/pith/PP5FSYDTENINJ2YMOCMU3TNWWE/bundle.json","state":"https://pith.science/pith/PP5FSYDTENINJ2YMOCMU3TNWWE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PP5FSYDTENINJ2YMOCMU3TNWWE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PP5FSYDTENINJ2YMOCMU3TNWWE","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":"15e2dd77443953cdeb24ea0a001b8cd259884353f0ef5fea2fe0931e55ee7a23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-08-08T17:40:04Z","title_canon_sha256":"840b4122bb42c8797a19de6eadb72b3bd758d6444179387a69e8c54ef296e73a"},"schema_version":"1.0","source":{"id":"1708.02574","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02574","created_at":"2026-05-18T00:29:01Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02574v4","created_at":"2026-05-18T00:29:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02574","created_at":"2026-05-18T00:29:01Z"},{"alias_kind":"pith_short_12","alias_value":"PP5FSYDTENIN","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PP5FSYDTENINJ2YM","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PP5FSYDT","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:2511f7c77b9d77af9a0d17e115b3835533495fd3fda80ef47ed9300f2fd4fec1","target":"graph","created_at":"2026-05-18T00:29:01Z","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":"Given a large graph, how can we determine similarity between nodes in a fast and accurate way? Random walk with restart (RWR) is a popular measure for this purpose and has been exploited in numerous data mining applications including ranking, anomaly detection, link prediction, and community detection. However, previous methods for computing exact RWR require prohibitive storage sizes and computational costs, and alternative methods which avoid such costs by computing approximate RWR have limited accuracy. In this paper, we propose TPA, a fast, scalable, and highly accurate method for computin","authors_text":"Jinhong Jung, Minji Yoon, U Kang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-08-08T17:40:04Z","title":"TPA: Fast, Scalable, and Accurate Method for Approximate Random Walk with Restart on Billion Scale Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02574","kind":"arxiv","version":4},"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:1dd7d87bce0378e58c47ca52a1a0f0c90d5db156b31844ed62af2731c8fa20ce","target":"record","created_at":"2026-05-18T00:29:01Z","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":"15e2dd77443953cdeb24ea0a001b8cd259884353f0ef5fea2fe0931e55ee7a23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-08-08T17:40:04Z","title_canon_sha256":"840b4122bb42c8797a19de6eadb72b3bd758d6444179387a69e8c54ef296e73a"},"schema_version":"1.0","source":{"id":"1708.02574","kind":"arxiv","version":4}},"canonical_sha256":"7bfa5960732350d4eb0c70994dcdb6b13b580d74a0f5a5a029a75aae62aa3e42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7bfa5960732350d4eb0c70994dcdb6b13b580d74a0f5a5a029a75aae62aa3e42","first_computed_at":"2026-05-18T00:29:01.235843Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:01.235843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qk/gvul07Ob+jn8877It7gAZAnn+KS0m5405MBn8pvOhPMspmBRh3KLGPxn0Y/wvyES6sIwYpe92eJjHqLR6CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:01.236354Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.02574","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1dd7d87bce0378e58c47ca52a1a0f0c90d5db156b31844ed62af2731c8fa20ce","sha256:2511f7c77b9d77af9a0d17e115b3835533495fd3fda80ef47ed9300f2fd4fec1"],"state_sha256":"fcc72a53bbb84a223b9d7cf1844b96577cc626a3bee4f8664fd3e46cecec6546"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8RPDe0z512m4RdqTRwWz+6PoWn0c+UhEph9x6R4iEkhx9iaV/U1vOuxH77i+OFSmaDkfvpWH3Par6uHMKGOkBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:31:31.555616Z","bundle_sha256":"1ea448380cc9b45958b477761bce958912fe32083b6e5fb8ad9afbd83002556d"}}