{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:Q4BVD5P5WFMOKNTQWL672ODRIC","short_pith_number":"pith:Q4BVD5P5","canonical_record":{"source":{"id":"1602.01886","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-04T23:34:53Z","cross_cats_sorted":[],"title_canon_sha256":"1da88ea00ba871809fb1a869798a16133ea4ea6afa7f00c6cf9bd9a8ca2ab0ca","abstract_canon_sha256":"9eb81d5aa7bce2244c71aba6d4077fdd27fc9ee57f54e7458220fa980492ab27"},"schema_version":"1.0"},"canonical_sha256":"870351f5fdb158e53670b2fdfd38714087e546e1ba122d605e93fbf7008b25a6","source":{"kind":"arxiv","id":"1602.01886","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01886","created_at":"2026-05-18T00:28:38Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01886v7","created_at":"2026-05-18T00:28:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01886","created_at":"2026-05-18T00:28:38Z"},{"alias_kind":"pith_short_12","alias_value":"Q4BVD5P5WFMO","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q4BVD5P5WFMOKNTQ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q4BVD5P5","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:Q4BVD5P5WFMOKNTQWL672ODRIC","target":"record","payload":{"canonical_record":{"source":{"id":"1602.01886","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-04T23:34:53Z","cross_cats_sorted":[],"title_canon_sha256":"1da88ea00ba871809fb1a869798a16133ea4ea6afa7f00c6cf9bd9a8ca2ab0ca","abstract_canon_sha256":"9eb81d5aa7bce2244c71aba6d4077fdd27fc9ee57f54e7458220fa980492ab27"},"schema_version":"1.0"},"canonical_sha256":"870351f5fdb158e53670b2fdfd38714087e546e1ba122d605e93fbf7008b25a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:38.194700Z","signature_b64":"F9qYHvhbOQLUnFmaexwiqJwvX2jG00cOnzPauJsw9ZD7uJB9luHfgv6/Zcfem4LrjAiv/GJREcKxZp/5W7hyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"870351f5fdb158e53670b2fdfd38714087e546e1ba122d605e93fbf7008b25a6","last_reissued_at":"2026-05-18T00:28:38.193965Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:38.193965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.01886","source_version":7,"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:28:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3A38vfy8FDrWYBZFo7AVhfbTQnuKeUG/LzjYx+U/x7zKuo6wM3CHcbd3W/9eg+3uQTPKqdTruQC+WtvLDet9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:46:55.563866Z"},"content_sha256":"f9dc72798ace249d7493498bd30b41c820a5c417c5bb0d8030bc0933644846bd","schema_version":"1.0","event_id":"sha256:f9dc72798ace249d7493498bd30b41c820a5c417c5bb0d8030bc0933644846bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:Q4BVD5P5WFMOKNTQWL672ODRIC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Variational Perspective on Local Graph Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Farbod Roosta-Khorasan, Julian Shun, Kimon Fountoulakis, Michael W. Mahoney, Xiang Cheng","submitted_at":"2016-02-04T23:34:53Z","abstract_excerpt":"Modern graph clustering applications require the analysis of large graphs and this can be computationally expensive. In this regard, local spectral graph clustering methods aim to identify well-connected clusters around a given \"seed set\" of reference nodes without accessing the entire graph. The celebrated Approximate Personalized PageRank (APPR) algorithm in the seminal paper by Andersen et al. is one such method. APPR was introduced and motivated purely from an algorithmic perspective. In other words, there is no a priori notion of objective function/optimality conditions that characterizes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01886","kind":"arxiv","version":7},"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:28:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mi5P0lYiQLcLb09R6RKqU0o65zzJBOOiTivEd9NPB8UA0lmvskK+R3YGVC4twPxzASKlpEg0fC0V33J6VsMoBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:46:55.564200Z"},"content_sha256":"0311287879a4eadba765352edb1c238b2152eb7fd1e204d651418a0079fe4e14","schema_version":"1.0","event_id":"sha256:0311287879a4eadba765352edb1c238b2152eb7fd1e204d651418a0079fe4e14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q4BVD5P5WFMOKNTQWL672ODRIC/bundle.json","state_url":"https://pith.science/pith/Q4BVD5P5WFMOKNTQWL672ODRIC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q4BVD5P5WFMOKNTQWL672ODRIC/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-01T16:46:55Z","links":{"resolver":"https://pith.science/pith/Q4BVD5P5WFMOKNTQWL672ODRIC","bundle":"https://pith.science/pith/Q4BVD5P5WFMOKNTQWL672ODRIC/bundle.json","state":"https://pith.science/pith/Q4BVD5P5WFMOKNTQWL672ODRIC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q4BVD5P5WFMOKNTQWL672ODRIC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Q4BVD5P5WFMOKNTQWL672ODRIC","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":"9eb81d5aa7bce2244c71aba6d4077fdd27fc9ee57f54e7458220fa980492ab27","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-04T23:34:53Z","title_canon_sha256":"1da88ea00ba871809fb1a869798a16133ea4ea6afa7f00c6cf9bd9a8ca2ab0ca"},"schema_version":"1.0","source":{"id":"1602.01886","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01886","created_at":"2026-05-18T00:28:38Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01886v7","created_at":"2026-05-18T00:28:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01886","created_at":"2026-05-18T00:28:38Z"},{"alias_kind":"pith_short_12","alias_value":"Q4BVD5P5WFMO","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q4BVD5P5WFMOKNTQ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q4BVD5P5","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:0311287879a4eadba765352edb1c238b2152eb7fd1e204d651418a0079fe4e14","target":"graph","created_at":"2026-05-18T00:28:38Z","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":"Modern graph clustering applications require the analysis of large graphs and this can be computationally expensive. In this regard, local spectral graph clustering methods aim to identify well-connected clusters around a given \"seed set\" of reference nodes without accessing the entire graph. The celebrated Approximate Personalized PageRank (APPR) algorithm in the seminal paper by Andersen et al. is one such method. APPR was introduced and motivated purely from an algorithmic perspective. In other words, there is no a priori notion of objective function/optimality conditions that characterizes","authors_text":"Farbod Roosta-Khorasan, Julian Shun, Kimon Fountoulakis, Michael W. Mahoney, Xiang Cheng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-04T23:34:53Z","title":"Variational Perspective on Local Graph Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01886","kind":"arxiv","version":7},"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:f9dc72798ace249d7493498bd30b41c820a5c417c5bb0d8030bc0933644846bd","target":"record","created_at":"2026-05-18T00:28:38Z","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":"9eb81d5aa7bce2244c71aba6d4077fdd27fc9ee57f54e7458220fa980492ab27","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-04T23:34:53Z","title_canon_sha256":"1da88ea00ba871809fb1a869798a16133ea4ea6afa7f00c6cf9bd9a8ca2ab0ca"},"schema_version":"1.0","source":{"id":"1602.01886","kind":"arxiv","version":7}},"canonical_sha256":"870351f5fdb158e53670b2fdfd38714087e546e1ba122d605e93fbf7008b25a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"870351f5fdb158e53670b2fdfd38714087e546e1ba122d605e93fbf7008b25a6","first_computed_at":"2026-05-18T00:28:38.193965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:38.193965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F9qYHvhbOQLUnFmaexwiqJwvX2jG00cOnzPauJsw9ZD7uJB9luHfgv6/Zcfem4LrjAiv/GJREcKxZp/5W7hyCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:38.194700Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01886","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9dc72798ace249d7493498bd30b41c820a5c417c5bb0d8030bc0933644846bd","sha256:0311287879a4eadba765352edb1c238b2152eb7fd1e204d651418a0079fe4e14"],"state_sha256":"997acbe2e5b05df16381998fcdfe6ebf25fac12cbf5b2470d2bae4a8ae443ce1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u919HPwZfset6wssPFhOr606Mh3VB/5WINPnc2LaU2nfFpjjnCLFMmkWzEavYQ2OWcK884QblNJucCB1iV9dDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:46:55.566011Z","bundle_sha256":"e0ec2cc5b761584df600128fa1f4bf69a0333d4c3c584e9ff76d96a06f74ee9c"}}