{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OPUTIX5K75WRRQYAJ5GOBILFIZ","short_pith_number":"pith:OPUTIX5K","canonical_record":{"source":{"id":"1704.08462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-27T07:49:13Z","cross_cats_sorted":[],"title_canon_sha256":"b37651ab32476ebf7368ee9c6ed76f9c6ff64bae4b46a8d7a60a643a43f47ae7","abstract_canon_sha256":"54463b803b09b43ae2ad9cce5a08256b47687ce14664a93f4ded897278bfdf2e"},"schema_version":"1.0"},"canonical_sha256":"73e9345faaff6d18c3004f4ce0a165466c8ff33b2a4bf125de6d11e78cedc43a","source":{"kind":"arxiv","id":"1704.08462","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08462","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08462v1","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08462","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"pith_short_12","alias_value":"OPUTIX5K75WR","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OPUTIX5K75WRRQYA","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OPUTIX5K","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OPUTIX5K75WRRQYAJ5GOBILFIZ","target":"record","payload":{"canonical_record":{"source":{"id":"1704.08462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-27T07:49:13Z","cross_cats_sorted":[],"title_canon_sha256":"b37651ab32476ebf7368ee9c6ed76f9c6ff64bae4b46a8d7a60a643a43f47ae7","abstract_canon_sha256":"54463b803b09b43ae2ad9cce5a08256b47687ce14664a93f4ded897278bfdf2e"},"schema_version":"1.0"},"canonical_sha256":"73e9345faaff6d18c3004f4ce0a165466c8ff33b2a4bf125de6d11e78cedc43a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:27.641660Z","signature_b64":"M5W0J1KI1TmI9YFj533bokuVH+TL837g2l8wJq9VIklF7z83lBxDFbcYPQapzJkh9/HhRU4Ihlb/N7wHAVcVAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73e9345faaff6d18c3004f4ce0a165466c8ff33b2a4bf125de6d11e78cedc43a","last_reissued_at":"2026-05-18T00:45:27.641283Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:27.641283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.08462","source_version":1,"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:45:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qCAeuBLk5Z8HJNriAFjREw6vKMp2pEhdlJYdpT6K2en5sjKDJyqleSw5QXwB3qdDTRVxSV6GRwg1429kUuvFBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:47:08.783585Z"},"content_sha256":"4cda255b0137af62f493f1f20791418f9784d177559ca58df5abaeb443bbf877","schema_version":"1.0","event_id":"sha256:4cda255b0137af62f493f1f20791418f9784d177559ca58df5abaeb443bbf877"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OPUTIX5K75WRRQYAJ5GOBILFIZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication complexity of approximate maximum matching in the message-passing model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bozidar Radunovic, Milan Vojnovic, Qin Zhang, Zengfeng Huang","submitted_at":"2017-04-27T07:49:13Z","abstract_excerpt":"We consider the communication complexity of finding an approximate maximum matching in a graph in a multi-party message-passing communication model. The maximum matching problem is one of the most fundamental graph combinatorial problems, with a variety of applications.\n  The input to the problem is a graph $G$ that has $n$ vertices and the set of edges partitioned over $k$ sites, and an approximation ratio parameter $\\alpha$. The output is required to be a matching in $G$ that has to be reported by one of the sites, whose size is at least factor $\\alpha$ of the size of a maximum matching in $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08462","kind":"arxiv","version":1},"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:45:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qu4/BT+fFOPspNBhKFdJqTtDXh6NAAnu3CfP1kq0cB35R8BkK6bjH5IAyi8x9Qu46ab9GRA+QMJyHuTG9nkcDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:47:08.784060Z"},"content_sha256":"91fc62e8f8ded1710ebb6915d8ad357acce2a749b4c480eea8d906b97f60b122","schema_version":"1.0","event_id":"sha256:91fc62e8f8ded1710ebb6915d8ad357acce2a749b4c480eea8d906b97f60b122"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OPUTIX5K75WRRQYAJ5GOBILFIZ/bundle.json","state_url":"https://pith.science/pith/OPUTIX5K75WRRQYAJ5GOBILFIZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OPUTIX5K75WRRQYAJ5GOBILFIZ/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-05T18:47:08Z","links":{"resolver":"https://pith.science/pith/OPUTIX5K75WRRQYAJ5GOBILFIZ","bundle":"https://pith.science/pith/OPUTIX5K75WRRQYAJ5GOBILFIZ/bundle.json","state":"https://pith.science/pith/OPUTIX5K75WRRQYAJ5GOBILFIZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OPUTIX5K75WRRQYAJ5GOBILFIZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OPUTIX5K75WRRQYAJ5GOBILFIZ","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":"54463b803b09b43ae2ad9cce5a08256b47687ce14664a93f4ded897278bfdf2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-27T07:49:13Z","title_canon_sha256":"b37651ab32476ebf7368ee9c6ed76f9c6ff64bae4b46a8d7a60a643a43f47ae7"},"schema_version":"1.0","source":{"id":"1704.08462","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08462","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08462v1","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08462","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"pith_short_12","alias_value":"OPUTIX5K75WR","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OPUTIX5K75WRRQYA","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OPUTIX5K","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:91fc62e8f8ded1710ebb6915d8ad357acce2a749b4c480eea8d906b97f60b122","target":"graph","created_at":"2026-05-18T00:45:27Z","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 consider the communication complexity of finding an approximate maximum matching in a graph in a multi-party message-passing communication model. The maximum matching problem is one of the most fundamental graph combinatorial problems, with a variety of applications.\n  The input to the problem is a graph $G$ that has $n$ vertices and the set of edges partitioned over $k$ sites, and an approximation ratio parameter $\\alpha$. The output is required to be a matching in $G$ that has to be reported by one of the sites, whose size is at least factor $\\alpha$ of the size of a maximum matching in $","authors_text":"Bozidar Radunovic, Milan Vojnovic, Qin Zhang, Zengfeng Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-27T07:49:13Z","title":"Communication complexity of approximate maximum matching in the message-passing model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08462","kind":"arxiv","version":1},"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:4cda255b0137af62f493f1f20791418f9784d177559ca58df5abaeb443bbf877","target":"record","created_at":"2026-05-18T00:45:27Z","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":"54463b803b09b43ae2ad9cce5a08256b47687ce14664a93f4ded897278bfdf2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-27T07:49:13Z","title_canon_sha256":"b37651ab32476ebf7368ee9c6ed76f9c6ff64bae4b46a8d7a60a643a43f47ae7"},"schema_version":"1.0","source":{"id":"1704.08462","kind":"arxiv","version":1}},"canonical_sha256":"73e9345faaff6d18c3004f4ce0a165466c8ff33b2a4bf125de6d11e78cedc43a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73e9345faaff6d18c3004f4ce0a165466c8ff33b2a4bf125de6d11e78cedc43a","first_computed_at":"2026-05-18T00:45:27.641283Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:27.641283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M5W0J1KI1TmI9YFj533bokuVH+TL837g2l8wJq9VIklF7z83lBxDFbcYPQapzJkh9/HhRU4Ihlb/N7wHAVcVAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:27.641660Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.08462","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4cda255b0137af62f493f1f20791418f9784d177559ca58df5abaeb443bbf877","sha256:91fc62e8f8ded1710ebb6915d8ad357acce2a749b4c480eea8d906b97f60b122"],"state_sha256":"66641b6fe864300485694a5bb1047d00e3c18870f03381fd44c5dde85da067d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q+wAcQ0v2byTrhMiDkhiQIqFOMM11D420hP2lPZX+RPNEoyqpfXlSa5QjzxPTlNEWx6KC3HDA3tR7f46LshVAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T18:47:08.786134Z","bundle_sha256":"ed68f4da8d27463808356cf32bc1ddcf3a31c0cc5ec15904908176b916da67cb"}}