{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:B4EIYXZEWDPMA4OCOUQCGBR6XJ","short_pith_number":"pith:B4EIYXZE","canonical_record":{"source":{"id":"1407.7882","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-29T20:42:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"20b746fe798e11e944d2d959f633bcbac4f60fe80271817557418ac1f51d211b","abstract_canon_sha256":"9535ec04b4a940cc7faadb888e739d208080bd51c003f5c60c58d8be66f4c7cd"},"schema_version":"1.0"},"canonical_sha256":"0f088c5f24b0dec071c2752023063eba4cacd5c8970c19bba5791f78be9a26fd","source":{"kind":"arxiv","id":"1407.7882","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7882","created_at":"2026-05-18T02:37:53Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7882v3","created_at":"2026-05-18T02:37:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7882","created_at":"2026-05-18T02:37:53Z"},{"alias_kind":"pith_short_12","alias_value":"B4EIYXZEWDPM","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"B4EIYXZEWDPMA4OC","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"B4EIYXZE","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:B4EIYXZEWDPMA4OCOUQCGBR6XJ","target":"record","payload":{"canonical_record":{"source":{"id":"1407.7882","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-29T20:42:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"20b746fe798e11e944d2d959f633bcbac4f60fe80271817557418ac1f51d211b","abstract_canon_sha256":"9535ec04b4a940cc7faadb888e739d208080bd51c003f5c60c58d8be66f4c7cd"},"schema_version":"1.0"},"canonical_sha256":"0f088c5f24b0dec071c2752023063eba4cacd5c8970c19bba5791f78be9a26fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:53.713723Z","signature_b64":"vCtaAoa5TgRYMCoGPP1hbVsjh6E40ZAKCy2q+C+BBx9TC1iDj2m4JZvbo/hfjiRXmxePs9kMiK1d62taEIF+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f088c5f24b0dec071c2752023063eba4cacd5c8970c19bba5791f78be9a26fd","last_reissued_at":"2026-05-18T02:37:53.713118Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:53.713118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.7882","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-18T02:37:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YEcdtPuU+Oe1heSfgh885baWDInh+RW7LaF9sUxJV6mpjk53MUxt3tGT4RjwnPtyK3Fnu6WKKAGcYx31z4O7AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T09:59:35.898987Z"},"content_sha256":"367d08caff8f14929915e02a52a0e69ba5b1b5e132fb6f57ed46ac74a66b3b53","schema_version":"1.0","event_id":"sha256:367d08caff8f14929915e02a52a0e69ba5b1b5e132fb6f57ed46ac74a66b3b53"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:B4EIYXZEWDPMA4OCOUQCGBR6XJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Maximum Matching in Bounded Degree Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Dana Ron, Guy Even, Moti Medina","submitted_at":"2014-07-29T20:42:30Z","abstract_excerpt":"We present deterministic distributed algorithms for computing approximate maximum cardinality matchings and approximate maximum weight matchings. Our algorithm for the unweighted case computes a matching whose size is at least $(1-\\eps)$ times the optimal in $\\Delta^{O(1/\\eps)} + O\\left(\\frac{1}{\\eps^2}\\right) \\cdot\\log^*(n)$ rounds where $n$ is the number of vertices in the graph and $\\Delta$ is the maximum degree. Our algorithm for the edge-weighted case computes a matching whose weight is at least $(1-\\eps)$ times the optimal in $\\log(\\min\\{1/\\wmin,n/\\eps\\})^{O(1/\\eps)}\\cdot(\\Delta^{O(1/\\ep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7882","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-18T02:37:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uX9wqp2gwojTzFUertgX+47n6fppd8NBLZaJdIW67Hb5MmYv5/OtvyC+6ZdDmQUb60W+nLtIh4PttWWD+27fBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T09:59:35.899721Z"},"content_sha256":"19d5a50a13ceddda804d4f53eb4f77422dba87b0b8dd60bf718d322e955445e9","schema_version":"1.0","event_id":"sha256:19d5a50a13ceddda804d4f53eb4f77422dba87b0b8dd60bf718d322e955445e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B4EIYXZEWDPMA4OCOUQCGBR6XJ/bundle.json","state_url":"https://pith.science/pith/B4EIYXZEWDPMA4OCOUQCGBR6XJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B4EIYXZEWDPMA4OCOUQCGBR6XJ/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-10T09:59:35Z","links":{"resolver":"https://pith.science/pith/B4EIYXZEWDPMA4OCOUQCGBR6XJ","bundle":"https://pith.science/pith/B4EIYXZEWDPMA4OCOUQCGBR6XJ/bundle.json","state":"https://pith.science/pith/B4EIYXZEWDPMA4OCOUQCGBR6XJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B4EIYXZEWDPMA4OCOUQCGBR6XJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:B4EIYXZEWDPMA4OCOUQCGBR6XJ","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":"9535ec04b4a940cc7faadb888e739d208080bd51c003f5c60c58d8be66f4c7cd","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-29T20:42:30Z","title_canon_sha256":"20b746fe798e11e944d2d959f633bcbac4f60fe80271817557418ac1f51d211b"},"schema_version":"1.0","source":{"id":"1407.7882","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7882","created_at":"2026-05-18T02:37:53Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7882v3","created_at":"2026-05-18T02:37:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7882","created_at":"2026-05-18T02:37:53Z"},{"alias_kind":"pith_short_12","alias_value":"B4EIYXZEWDPM","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"B4EIYXZEWDPMA4OC","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"B4EIYXZE","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:19d5a50a13ceddda804d4f53eb4f77422dba87b0b8dd60bf718d322e955445e9","target":"graph","created_at":"2026-05-18T02:37:53Z","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":"We present deterministic distributed algorithms for computing approximate maximum cardinality matchings and approximate maximum weight matchings. Our algorithm for the unweighted case computes a matching whose size is at least $(1-\\eps)$ times the optimal in $\\Delta^{O(1/\\eps)} + O\\left(\\frac{1}{\\eps^2}\\right) \\cdot\\log^*(n)$ rounds where $n$ is the number of vertices in the graph and $\\Delta$ is the maximum degree. Our algorithm for the edge-weighted case computes a matching whose weight is at least $(1-\\eps)$ times the optimal in $\\log(\\min\\{1/\\wmin,n/\\eps\\})^{O(1/\\eps)}\\cdot(\\Delta^{O(1/\\ep","authors_text":"Dana Ron, Guy Even, Moti Medina","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-29T20:42:30Z","title":"Distributed Maximum Matching in Bounded Degree Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7882","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:367d08caff8f14929915e02a52a0e69ba5b1b5e132fb6f57ed46ac74a66b3b53","target":"record","created_at":"2026-05-18T02:37:53Z","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":"9535ec04b4a940cc7faadb888e739d208080bd51c003f5c60c58d8be66f4c7cd","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-29T20:42:30Z","title_canon_sha256":"20b746fe798e11e944d2d959f633bcbac4f60fe80271817557418ac1f51d211b"},"schema_version":"1.0","source":{"id":"1407.7882","kind":"arxiv","version":3}},"canonical_sha256":"0f088c5f24b0dec071c2752023063eba4cacd5c8970c19bba5791f78be9a26fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f088c5f24b0dec071c2752023063eba4cacd5c8970c19bba5791f78be9a26fd","first_computed_at":"2026-05-18T02:37:53.713118Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:53.713118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vCtaAoa5TgRYMCoGPP1hbVsjh6E40ZAKCy2q+C+BBx9TC1iDj2m4JZvbo/hfjiRXmxePs9kMiK1d62taEIF+Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:53.713723Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.7882","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:367d08caff8f14929915e02a52a0e69ba5b1b5e132fb6f57ed46ac74a66b3b53","sha256:19d5a50a13ceddda804d4f53eb4f77422dba87b0b8dd60bf718d322e955445e9"],"state_sha256":"57737f8787f20d07be95e0513a53cfad20244acafe61ed31bfadbad6584a77c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V6OJkVUBXQ/J97TC4I84GlZ5t6Hvpl9lL6RjqXLYW51epI12tpkYL7wOBSDk57HQ6rYodbc0sD+5IWlhNuprCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T09:59:35.904925Z","bundle_sha256":"44521d630cb7bd06ffe5318dd167ade78fdd82e2b2d155a4b3150292f02a500e"}}