{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DNOGS43GIVB65UBTHFSIL7SLAM","short_pith_number":"pith:DNOGS43G","schema_version":"1.0","canonical_sha256":"1b5c6973664543eed033396485fe4b0314599ae6e61f5a7934ed0af789c38403","source":{"kind":"arxiv","id":"1807.04900","version":2},"attestation_state":"computed","paper":{"title":"Parameterized Distributed Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Gregory Schwartzman, Ken-ichi Kawarabayashi, Ran Ben-Basat","submitted_at":"2018-07-13T03:48:35Z","abstract_excerpt":"In this work, we initiate a thorough study of parameterized graph optimization problems in the distributed setting. In a parameterized problem, an algorithm decides whether a solution of size bounded by a \\emph{parameter} $k$ exists and if so, it finds one. We study fundamental problems, including Minimum Vertex Cover (MVC), Maximum Independent Set (MaxIS), Maximum Matching (MaxM), and many others, in both the LOCAL and CONGEST distributed computation models. We present lower bounds for the round complexity of solving parameterized problems in both models, together with optimal and near-optima"},"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.04900","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-07-13T03:48:35Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ac98f0d5ea549086dee56f7dd8d8dc70f9c3ca1730a1b88124a97c30bd58802c","abstract_canon_sha256":"bb63692bef05e2b2fb0c21205a8a23c83d2ace0b5b7040b4a75a2109ca641bac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:53.754655Z","signature_b64":"MMErTzRKtCtUV6bpALwCoFRjuDNEmitTHAWtw9IEK0B3Cd5fkSYBhctkhPR4vWeuGYHYQ0Qa1V2POVN8mwUbAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b5c6973664543eed033396485fe4b0314599ae6e61f5a7934ed0af789c38403","last_reissued_at":"2026-05-18T00:08:53.754035Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:53.754035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Distributed Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Gregory Schwartzman, Ken-ichi Kawarabayashi, Ran Ben-Basat","submitted_at":"2018-07-13T03:48:35Z","abstract_excerpt":"In this work, we initiate a thorough study of parameterized graph optimization problems in the distributed setting. In a parameterized problem, an algorithm decides whether a solution of size bounded by a \\emph{parameter} $k$ exists and if so, it finds one. We study fundamental problems, including Minimum Vertex Cover (MVC), Maximum Independent Set (MaxIS), Maximum Matching (MaxM), and many others, in both the LOCAL and CONGEST distributed computation models. We present lower bounds for the round complexity of solving parameterized problems in both models, together with optimal and near-optima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04900","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":"1807.04900","created_at":"2026-05-18T00:08:53.754122+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.04900v2","created_at":"2026-05-18T00:08:53.754122+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04900","created_at":"2026-05-18T00:08:53.754122+00:00"},{"alias_kind":"pith_short_12","alias_value":"DNOGS43GIVB6","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DNOGS43GIVB65UBT","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DNOGS43G","created_at":"2026-05-18T12:32:19.392346+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/DNOGS43GIVB65UBTHFSIL7SLAM","json":"https://pith.science/pith/DNOGS43GIVB65UBTHFSIL7SLAM.json","graph_json":"https://pith.science/api/pith-number/DNOGS43GIVB65UBTHFSIL7SLAM/graph.json","events_json":"https://pith.science/api/pith-number/DNOGS43GIVB65UBTHFSIL7SLAM/events.json","paper":"https://pith.science/paper/DNOGS43G"},"agent_actions":{"view_html":"https://pith.science/pith/DNOGS43GIVB65UBTHFSIL7SLAM","download_json":"https://pith.science/pith/DNOGS43GIVB65UBTHFSIL7SLAM.json","view_paper":"https://pith.science/paper/DNOGS43G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.04900&json=true","fetch_graph":"https://pith.science/api/pith-number/DNOGS43GIVB65UBTHFSIL7SLAM/graph.json","fetch_events":"https://pith.science/api/pith-number/DNOGS43GIVB65UBTHFSIL7SLAM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DNOGS43GIVB65UBTHFSIL7SLAM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DNOGS43GIVB65UBTHFSIL7SLAM/action/storage_attestation","attest_author":"https://pith.science/pith/DNOGS43GIVB65UBTHFSIL7SLAM/action/author_attestation","sign_citation":"https://pith.science/pith/DNOGS43GIVB65UBTHFSIL7SLAM/action/citation_signature","submit_replication":"https://pith.science/pith/DNOGS43GIVB65UBTHFSIL7SLAM/action/replication_record"}},"created_at":"2026-05-18T00:08:53.754122+00:00","updated_at":"2026-05-18T00:08:53.754122+00:00"}