{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FVZ4E4YCV5TVMTWCPLI3GYY7ZP","short_pith_number":"pith:FVZ4E4YC","canonical_record":{"source":{"id":"1604.07515","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-04-26T04:35:51Z","cross_cats_sorted":[],"title_canon_sha256":"1a71531820c79f65132a9cd9274fef9d0ad3b454c666275cd83eb750c470485a","abstract_canon_sha256":"9ac610fd76556bb5be5457248c2d80956bc358acc0c1338283803d613b173030"},"schema_version":"1.0"},"canonical_sha256":"2d73c27302af67564ec27ad1b3631fcbc638f676cf2b6f7470e2414510c6aacb","source":{"kind":"arxiv","id":"1604.07515","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07515","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07515v3","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07515","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"pith_short_12","alias_value":"FVZ4E4YCV5TV","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FVZ4E4YCV5TVMTWC","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FVZ4E4YC","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FVZ4E4YCV5TVMTWCPLI3GYY7ZP","target":"record","payload":{"canonical_record":{"source":{"id":"1604.07515","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-04-26T04:35:51Z","cross_cats_sorted":[],"title_canon_sha256":"1a71531820c79f65132a9cd9274fef9d0ad3b454c666275cd83eb750c470485a","abstract_canon_sha256":"9ac610fd76556bb5be5457248c2d80956bc358acc0c1338283803d613b173030"},"schema_version":"1.0"},"canonical_sha256":"2d73c27302af67564ec27ad1b3631fcbc638f676cf2b6f7470e2414510c6aacb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:54.388481Z","signature_b64":"1TR5DFTQm0De1GfVgt/dhlJe+iFvdvYjNPyonQgV0YZXRBE5GMKOUY6dW9+dJFC7HiiLPA+8279AG1yPXyIGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d73c27302af67564ec27ad1b3631fcbc638f676cf2b6f7470e2414510c6aacb","last_reissued_at":"2026-05-17T23:43:54.387935Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:54.387935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.07515","source_version":3,"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:43:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M5uKUfmQuTtlYFRJvkx26szLOrsE45STsYb6X/hahLqh30DXgdwndN/gw2KVXQKnEhEHmPI5BMpdM/LFi96gDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:20:39.803070Z"},"content_sha256":"4410e6e1b72d8de050e359e6d48cae94a35eb35352f88f2896a9e093f3155069","schema_version":"1.0","event_id":"sha256:4410e6e1b72d8de050e359e6d48cae94a35eb35352f88f2896a9e093f3155069"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FVZ4E4YCV5TVMTWCPLI3GYY7ZP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Local Graph Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Farbod Roosta-Khorasani, Julian Shun, Kimon Fountoulakis, Michael W. Mahoney","submitted_at":"2016-04-26T04:35:51Z","abstract_excerpt":"Graph clustering has many important applications in computing, but due to growing sizes of graphs, even traditionally fast clustering methods such as spectral partitioning can be computationally expensive for real-world graphs of interest. Motivated partly by this, so-called local algorithms for graph clustering have received significant interest due to the fact that they can find good clusters in a graph with work proportional to the size of the cluster rather than that of the entire graph. This feature has proven to be crucial in making such graph clustering and many of its downstream applic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07515","kind":"arxiv","version":3},"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:43:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5LhP41S/Fxt2jOKjcmchS2QDsLFybrfnnnd/Lqvce8PXnHuxp5ggQYiIhJMhaCnc44IReiaWsl5liaohgQW5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:20:39.803430Z"},"content_sha256":"a97e6399e7954a91409bf79eb65d5e441a5300386d3e884b091be5056d8657c5","schema_version":"1.0","event_id":"sha256:a97e6399e7954a91409bf79eb65d5e441a5300386d3e884b091be5056d8657c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVZ4E4YCV5TVMTWCPLI3GYY7ZP/bundle.json","state_url":"https://pith.science/pith/FVZ4E4YCV5TVMTWCPLI3GYY7ZP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVZ4E4YCV5TVMTWCPLI3GYY7ZP/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-01T21:20:39Z","links":{"resolver":"https://pith.science/pith/FVZ4E4YCV5TVMTWCPLI3GYY7ZP","bundle":"https://pith.science/pith/FVZ4E4YCV5TVMTWCPLI3GYY7ZP/bundle.json","state":"https://pith.science/pith/FVZ4E4YCV5TVMTWCPLI3GYY7ZP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVZ4E4YCV5TVMTWCPLI3GYY7ZP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FVZ4E4YCV5TVMTWCPLI3GYY7ZP","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":"9ac610fd76556bb5be5457248c2d80956bc358acc0c1338283803d613b173030","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-04-26T04:35:51Z","title_canon_sha256":"1a71531820c79f65132a9cd9274fef9d0ad3b454c666275cd83eb750c470485a"},"schema_version":"1.0","source":{"id":"1604.07515","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07515","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07515v3","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07515","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"pith_short_12","alias_value":"FVZ4E4YCV5TV","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FVZ4E4YCV5TVMTWC","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FVZ4E4YC","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:a97e6399e7954a91409bf79eb65d5e441a5300386d3e884b091be5056d8657c5","target":"graph","created_at":"2026-05-17T23:43:54Z","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":"Graph clustering has many important applications in computing, but due to growing sizes of graphs, even traditionally fast clustering methods such as spectral partitioning can be computationally expensive for real-world graphs of interest. Motivated partly by this, so-called local algorithms for graph clustering have received significant interest due to the fact that they can find good clusters in a graph with work proportional to the size of the cluster rather than that of the entire graph. This feature has proven to be crucial in making such graph clustering and many of its downstream applic","authors_text":"Farbod Roosta-Khorasani, Julian Shun, Kimon Fountoulakis, Michael W. Mahoney","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-04-26T04:35:51Z","title":"Parallel Local Graph Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07515","kind":"arxiv","version":3},"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:4410e6e1b72d8de050e359e6d48cae94a35eb35352f88f2896a9e093f3155069","target":"record","created_at":"2026-05-17T23:43:54Z","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":"9ac610fd76556bb5be5457248c2d80956bc358acc0c1338283803d613b173030","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-04-26T04:35:51Z","title_canon_sha256":"1a71531820c79f65132a9cd9274fef9d0ad3b454c666275cd83eb750c470485a"},"schema_version":"1.0","source":{"id":"1604.07515","kind":"arxiv","version":3}},"canonical_sha256":"2d73c27302af67564ec27ad1b3631fcbc638f676cf2b6f7470e2414510c6aacb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d73c27302af67564ec27ad1b3631fcbc638f676cf2b6f7470e2414510c6aacb","first_computed_at":"2026-05-17T23:43:54.387935Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:54.387935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1TR5DFTQm0De1GfVgt/dhlJe+iFvdvYjNPyonQgV0YZXRBE5GMKOUY6dW9+dJFC7HiiLPA+8279AG1yPXyIGDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:54.388481Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.07515","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4410e6e1b72d8de050e359e6d48cae94a35eb35352f88f2896a9e093f3155069","sha256:a97e6399e7954a91409bf79eb65d5e441a5300386d3e884b091be5056d8657c5"],"state_sha256":"8f812a5cc6caabf1b184f5fddda1a9fa4fc22e7a6e6864b51137ef56fed6fe61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WCJRKn1WVhIA6Sjh59W1ZWhDY7DiniNeugo6U+1SogcglMfaQ7GArIH6NxWvv6Qpa2nM6/Tu8k3pX9SXHdjnDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:20:39.805570Z","bundle_sha256":"1b36bea09a3abe68e27553a735cab47bd0c2d38986960084bf8a66788afbda8b"}}