{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:R7O26WP6V6756TTDT3I7RXVXQC","short_pith_number":"pith:R7O26WP6","schema_version":"1.0","canonical_sha256":"8fddaf59feafbfdf4e639ed1f8deb780b4e8d709580d50c77a76aa878d3246b6","source":{"kind":"arxiv","id":"1807.07645","version":7},"attestation_state":"computed","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,"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.07645","created_at":"2026-07-05T06:59:49.292528+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.07645v7","created_at":"2026-07-05T06:59:49.292528+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07645","created_at":"2026-07-05T06:59:49.292528+00:00"},{"alias_kind":"pith_short_12","alias_value":"R7O26WP6V675","created_at":"2026-07-05T06:59:49.292528+00:00"},{"alias_kind":"pith_short_16","alias_value":"R7O26WP6V6756TTD","created_at":"2026-07-05T06:59:49.292528+00:00"},{"alias_kind":"pith_short_8","alias_value":"R7O26WP6","created_at":"2026-07-05T06:59:49.292528+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.06270","citing_title":"A Sharp Threshold Phenomenon for the Distributed Complexity of the Lov\\'asz Local Lemma","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R7O26WP6V6756TTDT3I7RXVXQC","json":"https://pith.science/pith/R7O26WP6V6756TTDT3I7RXVXQC.json","graph_json":"https://pith.science/api/pith-number/R7O26WP6V6756TTDT3I7RXVXQC/graph.json","events_json":"https://pith.science/api/pith-number/R7O26WP6V6756TTDT3I7RXVXQC/events.json","paper":"https://pith.science/paper/R7O26WP6"},"agent_actions":{"view_html":"https://pith.science/pith/R7O26WP6V6756TTDT3I7RXVXQC","download_json":"https://pith.science/pith/R7O26WP6V6756TTDT3I7RXVXQC.json","view_paper":"https://pith.science/paper/R7O26WP6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.07645&json=true","fetch_graph":"https://pith.science/api/pith-number/R7O26WP6V6756TTDT3I7RXVXQC/graph.json","fetch_events":"https://pith.science/api/pith-number/R7O26WP6V6756TTDT3I7RXVXQC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R7O26WP6V6756TTDT3I7RXVXQC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R7O26WP6V6756TTDT3I7RXVXQC/action/storage_attestation","attest_author":"https://pith.science/pith/R7O26WP6V6756TTDT3I7RXVXQC/action/author_attestation","sign_citation":"https://pith.science/pith/R7O26WP6V6756TTDT3I7RXVXQC/action/citation_signature","submit_replication":"https://pith.science/pith/R7O26WP6V6756TTDT3I7RXVXQC/action/replication_record"}},"created_at":"2026-07-05T06:59:49.292528+00:00","updated_at":"2026-07-05T06:59:49.292528+00:00"}