{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WSOMM722IHWT3FU5M7CRSRZA2Q","short_pith_number":"pith:WSOMM722","canonical_record":{"source":{"id":"1808.02546","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-07T20:31:39Z","cross_cats_sorted":["cs.DC","cs.LG"],"title_canon_sha256":"ab63ac6a2c3c8df265a74dce86e17b720d7edebc45917454ac8971069339859a","abstract_canon_sha256":"e10780655ce53f302d25bcbb79ec9668affba064606eac9d272bd5ea6adf93ba"},"schema_version":"1.0"},"canonical_sha256":"b49cc67f5a41ed3d969d67c5194720d42797537286e9d78b335737161f299694","source":{"kind":"arxiv","id":"1808.02546","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02546","created_at":"2026-05-18T00:00:01Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02546v2","created_at":"2026-05-18T00:00:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02546","created_at":"2026-05-18T00:00:01Z"},{"alias_kind":"pith_short_12","alias_value":"WSOMM722IHWT","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WSOMM722IHWT3FU5","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WSOMM722","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WSOMM722IHWT3FU5M7CRSRZA2Q","target":"record","payload":{"canonical_record":{"source":{"id":"1808.02546","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-07T20:31:39Z","cross_cats_sorted":["cs.DC","cs.LG"],"title_canon_sha256":"ab63ac6a2c3c8df265a74dce86e17b720d7edebc45917454ac8971069339859a","abstract_canon_sha256":"e10780655ce53f302d25bcbb79ec9668affba064606eac9d272bd5ea6adf93ba"},"schema_version":"1.0"},"canonical_sha256":"b49cc67f5a41ed3d969d67c5194720d42797537286e9d78b335737161f299694","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:01.903667Z","signature_b64":"ZLsbs0hh92i5OUJ7Ot82dNVOs3UpqHVtSxAmPqUVuU6I73xUVeIZsJwqiwle/yNPq/JDugkFckn4hnrtfvJeCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b49cc67f5a41ed3d969d67c5194720d42797537286e9d78b335737161f299694","last_reissued_at":"2026-05-18T00:00:01.903238Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:01.903238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.02546","source_version":2,"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:00:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kqLL0sbPpCzb/w/X6dD45msleF9G4ZJut9KYwQfQiI4ynLAIo0ET1tCsIC0XF//Ufv2Wg6QG0JkXa6VhO/tOAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:48:01.051774Z"},"content_sha256":"683398ba1d638670a4d56f0163b3fcca7b63e1a849b6676467d3ab124708bce0","schema_version":"1.0","event_id":"sha256:683398ba1d638670a4d56f0163b3fcca7b63e1a849b6676467d3ab124708bce0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WSOMM722IHWT3FU5M7CRSRZA2Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel and Streaming Algorithms for K-Core Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG"],"primary_cat":"cs.DS","authors_text":"Hossein Esfandiari, Silvio Lattanzi, Vahab Mirrokni","submitted_at":"2018-08-07T20:31:39Z","abstract_excerpt":"The $k$-core decomposition is a fundamental primitive in many machine learning and data mining applications. We present the first distributed and the first streaming algorithms to compute and maintain an approximate $k$-core decomposition with provable guarantees. Our algorithms achieve rigorous bounds on space complexity while bounding the number of passes or number of rounds of computation. We do so by presenting a new powerful sketching technique for $k$-core decomposition, and then by showing it can be computed efficiently in both streaming and MapReduce models. Finally, we confirm the eff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02546","kind":"arxiv","version":2},"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:00:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VqOPX9/EqyI7W+kQyMmJD1jUac0U+pgPAUzBS7DcLVRK65jvA1Aq7HyXLJJinNKuCR7k7By8PI4AXZg3NkcjDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:48:01.052453Z"},"content_sha256":"2d42b2ebf32bc7cdac0b1092f26d9b1931664e5befa6b1fc29701c362df18f43","schema_version":"1.0","event_id":"sha256:2d42b2ebf32bc7cdac0b1092f26d9b1931664e5befa6b1fc29701c362df18f43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WSOMM722IHWT3FU5M7CRSRZA2Q/bundle.json","state_url":"https://pith.science/pith/WSOMM722IHWT3FU5M7CRSRZA2Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WSOMM722IHWT3FU5M7CRSRZA2Q/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-26T08:48:01Z","links":{"resolver":"https://pith.science/pith/WSOMM722IHWT3FU5M7CRSRZA2Q","bundle":"https://pith.science/pith/WSOMM722IHWT3FU5M7CRSRZA2Q/bundle.json","state":"https://pith.science/pith/WSOMM722IHWT3FU5M7CRSRZA2Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WSOMM722IHWT3FU5M7CRSRZA2Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WSOMM722IHWT3FU5M7CRSRZA2Q","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":"e10780655ce53f302d25bcbb79ec9668affba064606eac9d272bd5ea6adf93ba","cross_cats_sorted":["cs.DC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-07T20:31:39Z","title_canon_sha256":"ab63ac6a2c3c8df265a74dce86e17b720d7edebc45917454ac8971069339859a"},"schema_version":"1.0","source":{"id":"1808.02546","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02546","created_at":"2026-05-18T00:00:01Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02546v2","created_at":"2026-05-18T00:00:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02546","created_at":"2026-05-18T00:00:01Z"},{"alias_kind":"pith_short_12","alias_value":"WSOMM722IHWT","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WSOMM722IHWT3FU5","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WSOMM722","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:2d42b2ebf32bc7cdac0b1092f26d9b1931664e5befa6b1fc29701c362df18f43","target":"graph","created_at":"2026-05-18T00:00: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":"The $k$-core decomposition is a fundamental primitive in many machine learning and data mining applications. We present the first distributed and the first streaming algorithms to compute and maintain an approximate $k$-core decomposition with provable guarantees. Our algorithms achieve rigorous bounds on space complexity while bounding the number of passes or number of rounds of computation. We do so by presenting a new powerful sketching technique for $k$-core decomposition, and then by showing it can be computed efficiently in both streaming and MapReduce models. Finally, we confirm the eff","authors_text":"Hossein Esfandiari, Silvio Lattanzi, Vahab Mirrokni","cross_cats":["cs.DC","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-07T20:31:39Z","title":"Parallel and Streaming Algorithms for K-Core Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02546","kind":"arxiv","version":2},"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:683398ba1d638670a4d56f0163b3fcca7b63e1a849b6676467d3ab124708bce0","target":"record","created_at":"2026-05-18T00:00: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":"e10780655ce53f302d25bcbb79ec9668affba064606eac9d272bd5ea6adf93ba","cross_cats_sorted":["cs.DC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-07T20:31:39Z","title_canon_sha256":"ab63ac6a2c3c8df265a74dce86e17b720d7edebc45917454ac8971069339859a"},"schema_version":"1.0","source":{"id":"1808.02546","kind":"arxiv","version":2}},"canonical_sha256":"b49cc67f5a41ed3d969d67c5194720d42797537286e9d78b335737161f299694","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b49cc67f5a41ed3d969d67c5194720d42797537286e9d78b335737161f299694","first_computed_at":"2026-05-18T00:00:01.903238Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:01.903238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZLsbs0hh92i5OUJ7Ot82dNVOs3UpqHVtSxAmPqUVuU6I73xUVeIZsJwqiwle/yNPq/JDugkFckn4hnrtfvJeCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:01.903667Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.02546","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:683398ba1d638670a4d56f0163b3fcca7b63e1a849b6676467d3ab124708bce0","sha256:2d42b2ebf32bc7cdac0b1092f26d9b1931664e5befa6b1fc29701c362df18f43"],"state_sha256":"61e4653d4a6388d9314bd1434496dd1e9a2d0c2b54078f5ad5d01f493b090780"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cUGu/Ensksot0klmp1FLkpnZ9tJd5rSVQlnD5kSYW6yUekCnnpOI3OXuaYLZR8aVSjhJX1ms7F0jMs0YZwMbAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:48:01.055378Z","bundle_sha256":"184d00d2dc0c670fdd3604bd6a1936909ab9bc5f5b943723e6291b63b6bba496"}}