{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DG6JJGUINMOJOCB5G2I7OOVXYL","short_pith_number":"pith:DG6JJGUI","schema_version":"1.0","canonical_sha256":"19bc949a886b1c97083d3691f73ab7c2c7b4e759a56984ac5fe55fc15a279edd","source":{"kind":"arxiv","id":"1607.03483","version":1},"attestation_state":"computed","paper":{"title":"Block Models and Personalized PageRank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Isabel Kloumann, Johan Ugander, Jon Kleinberg","submitted_at":"2016-07-12T19:58:58Z","abstract_excerpt":"Methods for ranking the importance of nodes in a network have a rich history in machine learning and across domains that analyze structured data. Recent work has evaluated these methods though the seed set expansion problem: given a subset $S$ of nodes from a community of interest in an underlying graph, can we reliably identify the rest of the community? We start from the observation that the most widely used techniques for this problem, personalized PageRank and heat kernel methods, operate in the space of landing probabilities of a random walk rooted at the seed set, ranking nodes according"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1607.03483","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-07-12T19:58:58Z","cross_cats_sorted":["math.PR","physics.soc-ph"],"title_canon_sha256":"d05aa14146ccdac07023ed9a5100cab9a83b27d5beb1abb440fa032320038491","abstract_canon_sha256":"7c0910579316e7e5b97edfa289eb92ef1a5143cb42c80cb4a881fb5f02ffe2d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:15.868098Z","signature_b64":"N8By7lk5G0/7QxLfwp3Iz17kek29DCr8Z1N4uhxi/oSdN6oUOscI/gLLmbBnZSDrM0Ty5HbKXqSaRFXyedw2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19bc949a886b1c97083d3691f73ab7c2c7b4e759a56984ac5fe55fc15a279edd","last_reissued_at":"2026-05-18T00:45:15.867452Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:15.867452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Block Models and Personalized PageRank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Isabel Kloumann, Johan Ugander, Jon Kleinberg","submitted_at":"2016-07-12T19:58:58Z","abstract_excerpt":"Methods for ranking the importance of nodes in a network have a rich history in machine learning and across domains that analyze structured data. Recent work has evaluated these methods though the seed set expansion problem: given a subset $S$ of nodes from a community of interest in an underlying graph, can we reliably identify the rest of the community? We start from the observation that the most widely used techniques for this problem, personalized PageRank and heat kernel methods, operate in the space of landing probabilities of a random walk rooted at the seed set, ranking nodes according"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03483","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.03483","created_at":"2026-05-18T00:45:15.867544+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.03483v1","created_at":"2026-05-18T00:45:15.867544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03483","created_at":"2026-05-18T00:45:15.867544+00:00"},{"alias_kind":"pith_short_12","alias_value":"DG6JJGUINMOJ","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DG6JJGUINMOJOCB5","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DG6JJGUI","created_at":"2026-05-18T12:30:12.583610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DG6JJGUINMOJOCB5G2I7OOVXYL","json":"https://pith.science/pith/DG6JJGUINMOJOCB5G2I7OOVXYL.json","graph_json":"https://pith.science/api/pith-number/DG6JJGUINMOJOCB5G2I7OOVXYL/graph.json","events_json":"https://pith.science/api/pith-number/DG6JJGUINMOJOCB5G2I7OOVXYL/events.json","paper":"https://pith.science/paper/DG6JJGUI"},"agent_actions":{"view_html":"https://pith.science/pith/DG6JJGUINMOJOCB5G2I7OOVXYL","download_json":"https://pith.science/pith/DG6JJGUINMOJOCB5G2I7OOVXYL.json","view_paper":"https://pith.science/paper/DG6JJGUI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.03483&json=true","fetch_graph":"https://pith.science/api/pith-number/DG6JJGUINMOJOCB5G2I7OOVXYL/graph.json","fetch_events":"https://pith.science/api/pith-number/DG6JJGUINMOJOCB5G2I7OOVXYL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DG6JJGUINMOJOCB5G2I7OOVXYL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DG6JJGUINMOJOCB5G2I7OOVXYL/action/storage_attestation","attest_author":"https://pith.science/pith/DG6JJGUINMOJOCB5G2I7OOVXYL/action/author_attestation","sign_citation":"https://pith.science/pith/DG6JJGUINMOJOCB5G2I7OOVXYL/action/citation_signature","submit_replication":"https://pith.science/pith/DG6JJGUINMOJOCB5G2I7OOVXYL/action/replication_record"}},"created_at":"2026-05-18T00:45:15.867544+00:00","updated_at":"2026-05-18T00:45:15.867544+00:00"}