{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PELXZQADECZAK4255I7NEXQRN4","short_pith_number":"pith:PELXZQAD","canonical_record":{"source":{"id":"1711.03076","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-08T18:13:20Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"cf3b8746a7c973e6de6e8be4ffa1a7b74ef964b41addbcafdddd1692eb9be2dd","abstract_canon_sha256":"e9865112a32ecf2286f71b64bafea20a263f5241dc1e6c1b2b0017dbc8ac4758"},"schema_version":"1.0"},"canonical_sha256":"79177cc00320b205735dea3ed25e116f02920444d3f30fb600f99c37b079ec17","source":{"kind":"arxiv","id":"1711.03076","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03076","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03076v3","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03076","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"pith_short_12","alias_value":"PELXZQADECZA","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PELXZQADECZAK425","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PELXZQAD","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PELXZQADECZAK4255I7NEXQRN4","target":"record","payload":{"canonical_record":{"source":{"id":"1711.03076","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-08T18:13:20Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"cf3b8746a7c973e6de6e8be4ffa1a7b74ef964b41addbcafdddd1692eb9be2dd","abstract_canon_sha256":"e9865112a32ecf2286f71b64bafea20a263f5241dc1e6c1b2b0017dbc8ac4758"},"schema_version":"1.0"},"canonical_sha256":"79177cc00320b205735dea3ed25e116f02920444d3f30fb600f99c37b079ec17","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:19.623776Z","signature_b64":"4NXy57cLMQZ6VqaLbrvTuLde1bQwTAHHfp2b01UL91v+Rc5rYi82bhNeqaxWEiTkthmZbUlygSN+z6VZJmCjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79177cc00320b205735dea3ed25e116f02920444d3f30fb600f99c37b079ec17","last_reissued_at":"2026-05-17T23:57:19.623234Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:19.623234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.03076","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:57:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BG4Qjy/yqoEY9GPvgrjZc7icgaMTdMUwMQlGxrRIf/ecTipKzM6s4iWttzoMftgeyf0UaivpOkXxssvrDFTeAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T09:45:27.655209Z"},"content_sha256":"cd55f73fd44850aec87d613f32e9cc05a289580961debbeda7c02b2d177be893","schema_version":"1.0","event_id":"sha256:cd55f73fd44850aec87d613f32e9cc05a289580961debbeda7c02b2d177be893"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PELXZQADECZAK4255I7NEXQRN4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Aaron Bernstein, Cliff Stein, MohammadHossein Bateni, Sepehr Assadi, Vahab Mirrokni","submitted_at":"2017-11-08T18:13:20Z","abstract_excerpt":"As massive graphs become more prevalent, there is a rapidly growing need for scalable algorithms that solve classical graph problems, such as maximum matching and minimum vertex cover, on large datasets. For massive inputs, several different computational models have been introduced, including the streaming model, the distributed communication model, and the massively parallel computation (MPC) model that is a common abstraction of MapReduce-style computation. In each model, algorithms are analyzed in terms of resources such as space used or rounds of communication needed, in addition to the m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03076","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:57:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FIKDr149VAfqoxR027q8/pZg2anCb5LnLQzLrdzyFFDkoFKnCiolFlcZrEuiX7pOqJ6DmD5m0DA2Ft2DETzlAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T09:45:27.655599Z"},"content_sha256":"303e569ab166d35897c5aede78dee116793079abd6fea7b34e868a405d517e82","schema_version":"1.0","event_id":"sha256:303e569ab166d35897c5aede78dee116793079abd6fea7b34e868a405d517e82"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PELXZQADECZAK4255I7NEXQRN4/bundle.json","state_url":"https://pith.science/pith/PELXZQADECZAK4255I7NEXQRN4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PELXZQADECZAK4255I7NEXQRN4/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-21T09:45:27Z","links":{"resolver":"https://pith.science/pith/PELXZQADECZAK4255I7NEXQRN4","bundle":"https://pith.science/pith/PELXZQADECZAK4255I7NEXQRN4/bundle.json","state":"https://pith.science/pith/PELXZQADECZAK4255I7NEXQRN4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PELXZQADECZAK4255I7NEXQRN4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PELXZQADECZAK4255I7NEXQRN4","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":"e9865112a32ecf2286f71b64bafea20a263f5241dc1e6c1b2b0017dbc8ac4758","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-08T18:13:20Z","title_canon_sha256":"cf3b8746a7c973e6de6e8be4ffa1a7b74ef964b41addbcafdddd1692eb9be2dd"},"schema_version":"1.0","source":{"id":"1711.03076","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03076","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03076v3","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03076","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"pith_short_12","alias_value":"PELXZQADECZA","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PELXZQADECZAK425","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PELXZQAD","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:303e569ab166d35897c5aede78dee116793079abd6fea7b34e868a405d517e82","target":"graph","created_at":"2026-05-17T23:57:19Z","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":"As massive graphs become more prevalent, there is a rapidly growing need for scalable algorithms that solve classical graph problems, such as maximum matching and minimum vertex cover, on large datasets. For massive inputs, several different computational models have been introduced, including the streaming model, the distributed communication model, and the massively parallel computation (MPC) model that is a common abstraction of MapReduce-style computation. In each model, algorithms are analyzed in terms of resources such as space used or rounds of communication needed, in addition to the m","authors_text":"Aaron Bernstein, Cliff Stein, MohammadHossein Bateni, Sepehr Assadi, Vahab Mirrokni","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-08T18:13:20Z","title":"Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03076","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:cd55f73fd44850aec87d613f32e9cc05a289580961debbeda7c02b2d177be893","target":"record","created_at":"2026-05-17T23:57:19Z","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":"e9865112a32ecf2286f71b64bafea20a263f5241dc1e6c1b2b0017dbc8ac4758","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-08T18:13:20Z","title_canon_sha256":"cf3b8746a7c973e6de6e8be4ffa1a7b74ef964b41addbcafdddd1692eb9be2dd"},"schema_version":"1.0","source":{"id":"1711.03076","kind":"arxiv","version":3}},"canonical_sha256":"79177cc00320b205735dea3ed25e116f02920444d3f30fb600f99c37b079ec17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79177cc00320b205735dea3ed25e116f02920444d3f30fb600f99c37b079ec17","first_computed_at":"2026-05-17T23:57:19.623234Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:19.623234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4NXy57cLMQZ6VqaLbrvTuLde1bQwTAHHfp2b01UL91v+Rc5rYi82bhNeqaxWEiTkthmZbUlygSN+z6VZJmCjDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:19.623776Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.03076","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd55f73fd44850aec87d613f32e9cc05a289580961debbeda7c02b2d177be893","sha256:303e569ab166d35897c5aede78dee116793079abd6fea7b34e868a405d517e82"],"state_sha256":"a6537cca335e13816c1f9c99dcb270dd62b19f6c68fc9cf21f80355334e09254"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vWQf9LK4kGGrwkPbZDmKJPBW7lMC3PzbgcPaxx6NRrv4FbwCTjDBLi29Wk96FeCw/eLOcQA3GJFkG7mmVGY3Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T09:45:27.658811Z","bundle_sha256":"e8904e9e09af7f9c5456a12c93b85ad7707dc02f24593615b8fa8a68ef343170"}}