{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IHQF5CMI6D6YUBOHXLJ6WNXQL2","short_pith_number":"pith:IHQF5CMI","schema_version":"1.0","canonical_sha256":"41e05e8988f0fd8a05c7bad3eb36f05ebcaa9210b546aec0792db00a16200161","source":{"kind":"arxiv","id":"1703.00900","version":2},"attestation_state":"computed","paper":{"title":"Improved Deterministic Distributed Matching via Rounding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Manuela Fischer","submitted_at":"2017-03-02T18:55:52Z","abstract_excerpt":"We present improved deterministic distributed algorithms for a number of well-studied matching problems, which are simpler, faster, more accurate, and/or more general than their known counterparts. The common denominator of these results is a deterministic distributed rounding method for certain linear programs, which is the first such rounding method, to our knowledge. A sampling of our end results is as follows.\n  -- An $O(\\log^2 \\Delta\\cdot \\log n)$-round deterministic distributed algorithm for computing a maximal matching, in $n$-node graphs with maximum degree $\\Delta$. This is the first "},"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":"1703.00900","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-02T18:55:52Z","cross_cats_sorted":[],"title_canon_sha256":"d01249be9d0a4e5ce60b192d081d187e8ad180593b4792d62a0852667b862879","abstract_canon_sha256":"89d26ef7badcf377b6845e9e8b7137a0b093d0de6c17594cfff4a3907c69740a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:32.083119Z","signature_b64":"5dCzMrirjGLC9H9XIlThXDpLIf5ALntbXBbDQpTXkd9cWvrti0AvjafZ29X+nKzf2o2I0OGE48gQ68aCK4w3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41e05e8988f0fd8a05c7bad3eb36f05ebcaa9210b546aec0792db00a16200161","last_reissued_at":"2026-05-18T00:38:32.082707Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:32.082707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Deterministic Distributed Matching via Rounding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Manuela Fischer","submitted_at":"2017-03-02T18:55:52Z","abstract_excerpt":"We present improved deterministic distributed algorithms for a number of well-studied matching problems, which are simpler, faster, more accurate, and/or more general than their known counterparts. The common denominator of these results is a deterministic distributed rounding method for certain linear programs, which is the first such rounding method, to our knowledge. A sampling of our end results is as follows.\n  -- An $O(\\log^2 \\Delta\\cdot \\log n)$-round deterministic distributed algorithm for computing a maximal matching, in $n$-node graphs with maximum degree $\\Delta$. This is the first "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00900","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.00900","created_at":"2026-05-18T00:38:32.082771+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.00900v2","created_at":"2026-05-18T00:38:32.082771+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00900","created_at":"2026-05-18T00:38:32.082771+00:00"},{"alias_kind":"pith_short_12","alias_value":"IHQF5CMI6D6Y","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IHQF5CMI6D6YUBOH","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IHQF5CMI","created_at":"2026-05-18T12:31:21.493067+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IHQF5CMI6D6YUBOHXLJ6WNXQL2","json":"https://pith.science/pith/IHQF5CMI6D6YUBOHXLJ6WNXQL2.json","graph_json":"https://pith.science/api/pith-number/IHQF5CMI6D6YUBOHXLJ6WNXQL2/graph.json","events_json":"https://pith.science/api/pith-number/IHQF5CMI6D6YUBOHXLJ6WNXQL2/events.json","paper":"https://pith.science/paper/IHQF5CMI"},"agent_actions":{"view_html":"https://pith.science/pith/IHQF5CMI6D6YUBOHXLJ6WNXQL2","download_json":"https://pith.science/pith/IHQF5CMI6D6YUBOHXLJ6WNXQL2.json","view_paper":"https://pith.science/paper/IHQF5CMI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.00900&json=true","fetch_graph":"https://pith.science/api/pith-number/IHQF5CMI6D6YUBOHXLJ6WNXQL2/graph.json","fetch_events":"https://pith.science/api/pith-number/IHQF5CMI6D6YUBOHXLJ6WNXQL2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IHQF5CMI6D6YUBOHXLJ6WNXQL2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IHQF5CMI6D6YUBOHXLJ6WNXQL2/action/storage_attestation","attest_author":"https://pith.science/pith/IHQF5CMI6D6YUBOHXLJ6WNXQL2/action/author_attestation","sign_citation":"https://pith.science/pith/IHQF5CMI6D6YUBOHXLJ6WNXQL2/action/citation_signature","submit_replication":"https://pith.science/pith/IHQF5CMI6D6YUBOHXLJ6WNXQL2/action/replication_record"}},"created_at":"2026-05-18T00:38:32.082771+00:00","updated_at":"2026-05-18T00:38:32.082771+00:00"}