{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:R7O26WP6V6756TTDT3I7RXVXQC","short_pith_number":"pith:R7O26WP6","canonical_record":{"source":{"id":"1807.07645","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-19T21:13:11Z","cross_cats_sorted":[],"title_canon_sha256":"ffd0d3069cc61cfdc4ff14b9c097672d1291b4c9bde594b812d0b91d4f61d223","abstract_canon_sha256":"748358018400791d64c4243217cb06b7f41ac789f860d6e39b57b7927eb043c8"},"schema_version":"1.0"},"canonical_sha256":"8fddaf59feafbfdf4e639ed1f8deb780b4e8d709580d50c77a76aa878d3246b6","source":{"kind":"arxiv","id":"1807.07645","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07645","created_at":"2026-07-05T06:59:49Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07645v7","created_at":"2026-07-05T06:59:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07645","created_at":"2026-07-05T06:59:49Z"},{"alias_kind":"pith_short_12","alias_value":"R7O26WP6V675","created_at":"2026-07-05T06:59:49Z"},{"alias_kind":"pith_short_16","alias_value":"R7O26WP6V6756TTD","created_at":"2026-07-05T06:59:49Z"},{"alias_kind":"pith_short_8","alias_value":"R7O26WP6","created_at":"2026-07-05T06:59:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:R7O26WP6V6756TTDT3I7RXVXQC","target":"record","payload":{"canonical_record":{"source":{"id":"1807.07645","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-19T21:13:11Z","cross_cats_sorted":[],"title_canon_sha256":"ffd0d3069cc61cfdc4ff14b9c097672d1291b4c9bde594b812d0b91d4f61d223","abstract_canon_sha256":"748358018400791d64c4243217cb06b7f41ac789f860d6e39b57b7927eb043c8"},"schema_version":"1.0"},"canonical_sha256":"8fddaf59feafbfdf4e639ed1f8deb780b4e8d709580d50c77a76aa878d3246b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:59:49.292873Z","signature_b64":"PrLlJIunZsgx58Y/G61XRbB78h9jIMEXVoVgxxy15FtXISy4B3v7/6ZKvIsYm8HgnFmQeMWs5hB9Y8GxI9f9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fddaf59feafbfdf4e639ed1f8deb780b4e8d709580d50c77a76aa878d3246b6","last_reissued_at":"2026-07-05T06:59:49.292471Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:59:49.292471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.07645","source_version":7,"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-07-05T06:59:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t9ZwPqAI9qtvejejxR9+RnOrCqHLddqpFHbnqVrc55ahZoWDEOdJOmadQhPDtEtt2MW9OF8qaJkeg5spdT2xAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T16:29:47.757037Z"},"content_sha256":"5832185275e9791f5aeac21bcb48fe1ce3045c311dd3effe9fda9f4f4b7c014a","schema_version":"1.0","event_id":"sha256:5832185275e9791f5aeac21bcb48fe1ce3045c311dd3effe9fda9f4f4b7c014a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:R7O26WP6V6756TTDT3I7RXVXQC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed local approximation algorithms for maximum matching in graphs and hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David G. Harris","submitted_at":"2018-07-19T21:13:11Z","abstract_excerpt":"We describe approximation algorithms in Linial's classic LOCAL model of distributed computing to find maximum-weight matchings in a hypergraph of rank $r$. Our main result is a deterministic algorithm to generate a matching which is an $O(r)$-approximation to the maximum weight matching, running in $\\tilde O(r \\log \\Delta + \\log^2 \\Delta + \\log^* n)$ rounds. (Here, the $\\tilde O()$ notations hides $\\text{polyloglog } \\Delta$ and $\\text{polylog } r$ factors). This is based on a number of new derandomization techniques extending methods of Ghaffari, Harris & Kuhn (2017).\n  As a main application,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07645","kind":"arxiv","version":7},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1807.07645/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:59:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WmaSblXvfIEoydkpdKyf5JwL2gKNKkyeLqnG0WD1ZKnzbi1QBTe5tX348bKQuw6yI01XjTdFOdmN67LYIR6lBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T16:29:47.760087Z"},"content_sha256":"c499eeacbaeabe1fd887ede56265b20e43c9136949f4550be4f544378187e571","schema_version":"1.0","event_id":"sha256:c499eeacbaeabe1fd887ede56265b20e43c9136949f4550be4f544378187e571"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R7O26WP6V6756TTDT3I7RXVXQC/bundle.json","state_url":"https://pith.science/pith/R7O26WP6V6756TTDT3I7RXVXQC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R7O26WP6V6756TTDT3I7RXVXQC/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-08-16T16:29:47Z","links":{"resolver":"https://pith.science/pith/R7O26WP6V6756TTDT3I7RXVXQC","bundle":"https://pith.science/pith/R7O26WP6V6756TTDT3I7RXVXQC/bundle.json","state":"https://pith.science/pith/R7O26WP6V6756TTDT3I7RXVXQC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R7O26WP6V6756TTDT3I7RXVXQC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:R7O26WP6V6756TTDT3I7RXVXQC","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":"748358018400791d64c4243217cb06b7f41ac789f860d6e39b57b7927eb043c8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-19T21:13:11Z","title_canon_sha256":"ffd0d3069cc61cfdc4ff14b9c097672d1291b4c9bde594b812d0b91d4f61d223"},"schema_version":"1.0","source":{"id":"1807.07645","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07645","created_at":"2026-07-05T06:59:49Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07645v7","created_at":"2026-07-05T06:59:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07645","created_at":"2026-07-05T06:59:49Z"},{"alias_kind":"pith_short_12","alias_value":"R7O26WP6V675","created_at":"2026-07-05T06:59:49Z"},{"alias_kind":"pith_short_16","alias_value":"R7O26WP6V6756TTD","created_at":"2026-07-05T06:59:49Z"},{"alias_kind":"pith_short_8","alias_value":"R7O26WP6","created_at":"2026-07-05T06:59:49Z"}],"graph_snapshots":[{"event_id":"sha256:c499eeacbaeabe1fd887ede56265b20e43c9136949f4550be4f544378187e571","target":"graph","created_at":"2026-07-05T06:59:49Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1807.07645/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We describe approximation algorithms in Linial's classic LOCAL model of distributed computing to find maximum-weight matchings in a hypergraph of rank $r$. Our main result is a deterministic algorithm to generate a matching which is an $O(r)$-approximation to the maximum weight matching, running in $\\tilde O(r \\log \\Delta + \\log^2 \\Delta + \\log^* n)$ rounds. (Here, the $\\tilde O()$ notations hides $\\text{polyloglog } \\Delta$ and $\\text{polylog } r$ factors). This is based on a number of new derandomization techniques extending methods of Ghaffari, Harris & Kuhn (2017).\n  As a main application,","authors_text":"David G. Harris","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-19T21:13:11Z","title":"Distributed local approximation algorithms for maximum matching in graphs and hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07645","kind":"arxiv","version":7},"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:5832185275e9791f5aeac21bcb48fe1ce3045c311dd3effe9fda9f4f4b7c014a","target":"record","created_at":"2026-07-05T06:59:49Z","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":"748358018400791d64c4243217cb06b7f41ac789f860d6e39b57b7927eb043c8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-19T21:13:11Z","title_canon_sha256":"ffd0d3069cc61cfdc4ff14b9c097672d1291b4c9bde594b812d0b91d4f61d223"},"schema_version":"1.0","source":{"id":"1807.07645","kind":"arxiv","version":7}},"canonical_sha256":"8fddaf59feafbfdf4e639ed1f8deb780b4e8d709580d50c77a76aa878d3246b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fddaf59feafbfdf4e639ed1f8deb780b4e8d709580d50c77a76aa878d3246b6","first_computed_at":"2026-07-05T06:59:49.292471Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:59:49.292471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PrLlJIunZsgx58Y/G61XRbB78h9jIMEXVoVgxxy15FtXISy4B3v7/6ZKvIsYm8HgnFmQeMWs5hB9Y8GxI9f9Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:59:49.292873Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.07645","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5832185275e9791f5aeac21bcb48fe1ce3045c311dd3effe9fda9f4f4b7c014a","sha256:c499eeacbaeabe1fd887ede56265b20e43c9136949f4550be4f544378187e571"],"state_sha256":"b1ad644c088decc621e32a620e9bfbe1cc9b046a0be52951c6b63f48d9530ae9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dc131AbHXrxWIHNJIU9asSDkWpNh9T1TNABx8Yp97mCstzKUZ//1D12F5taT/OSfJlAKqH5/Dv23TRthbrPDDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T16:29:47.850544Z","bundle_sha256":"76f5acab19eb36456a837c1ab1cc0f8a5b937109cc2e8f37971b3717635b72eb"}}