{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:X5TL77IUWPKOP7WNFEWIVR6OMI","short_pith_number":"pith:X5TL77IU","schema_version":"1.0","canonical_sha256":"bf66bffd14b3d4e7fecd292c8ac7ce620a1b10c17d1735ff4facd9b0f320a3b4","source":{"kind":"arxiv","id":"1402.3796","version":3},"attestation_state":"computed","paper":{"title":"Best of Two Local Models: Local Centralized and Local Distributed Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dana Ron, Guy Even, Moti Medina","submitted_at":"2014-02-16T13:09:06Z","abstract_excerpt":"We consider two models of computation: centralized local algorithms and local distributed algorithms. Algorithms in one model are adapted to the other model to obtain improved algorithms.\n  Distributed vertex coloring is employed to design improved centralized local algorithms for: maximal independent set, maximal matching, and an approximation scheme for maximum (weighted) matching over bounded degree graphs. The improvement is threefold: the algorithms are deterministic, stateless, and the number of probes grows polynomially in $\\log^* n$, where $n$ is the number of vertices of the input gra"},"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":"1402.3796","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-16T13:09:06Z","cross_cats_sorted":[],"title_canon_sha256":"769bfa0531318284997d1afb5c8bd45c8e5d6394437bb1e89002495d381848dc","abstract_canon_sha256":"3f88ada3aff3aeedac9f653545beb4c37231ee3532bf8390d0e4a68557b22ec8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:58.810425Z","signature_b64":"se+jqd4mhF2Bt64lHlWdgGT0MbdgzIndZJJRttLs6xMcTkDJq2PxzyIkJq30o1HolMfF1Ur10UGv+8wbSoMdDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf66bffd14b3d4e7fecd292c8ac7ce620a1b10c17d1735ff4facd9b0f320a3b4","last_reissued_at":"2026-05-18T02:37:58.810018Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:58.810018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Best of Two Local Models: Local Centralized and Local Distributed Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dana Ron, Guy Even, Moti Medina","submitted_at":"2014-02-16T13:09:06Z","abstract_excerpt":"We consider two models of computation: centralized local algorithms and local distributed algorithms. Algorithms in one model are adapted to the other model to obtain improved algorithms.\n  Distributed vertex coloring is employed to design improved centralized local algorithms for: maximal independent set, maximal matching, and an approximation scheme for maximum (weighted) matching over bounded degree graphs. The improvement is threefold: the algorithms are deterministic, stateless, and the number of probes grows polynomially in $\\log^* n$, where $n$ is the number of vertices of the input gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3796","kind":"arxiv","version":3},"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":"1402.3796","created_at":"2026-05-18T02:37:58.810081+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.3796v3","created_at":"2026-05-18T02:37:58.810081+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3796","created_at":"2026-05-18T02:37:58.810081+00:00"},{"alias_kind":"pith_short_12","alias_value":"X5TL77IUWPKO","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"X5TL77IUWPKOP7WN","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"X5TL77IU","created_at":"2026-05-18T12:28:57.508820+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/X5TL77IUWPKOP7WNFEWIVR6OMI","json":"https://pith.science/pith/X5TL77IUWPKOP7WNFEWIVR6OMI.json","graph_json":"https://pith.science/api/pith-number/X5TL77IUWPKOP7WNFEWIVR6OMI/graph.json","events_json":"https://pith.science/api/pith-number/X5TL77IUWPKOP7WNFEWIVR6OMI/events.json","paper":"https://pith.science/paper/X5TL77IU"},"agent_actions":{"view_html":"https://pith.science/pith/X5TL77IUWPKOP7WNFEWIVR6OMI","download_json":"https://pith.science/pith/X5TL77IUWPKOP7WNFEWIVR6OMI.json","view_paper":"https://pith.science/paper/X5TL77IU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.3796&json=true","fetch_graph":"https://pith.science/api/pith-number/X5TL77IUWPKOP7WNFEWIVR6OMI/graph.json","fetch_events":"https://pith.science/api/pith-number/X5TL77IUWPKOP7WNFEWIVR6OMI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X5TL77IUWPKOP7WNFEWIVR6OMI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X5TL77IUWPKOP7WNFEWIVR6OMI/action/storage_attestation","attest_author":"https://pith.science/pith/X5TL77IUWPKOP7WNFEWIVR6OMI/action/author_attestation","sign_citation":"https://pith.science/pith/X5TL77IUWPKOP7WNFEWIVR6OMI/action/citation_signature","submit_replication":"https://pith.science/pith/X5TL77IUWPKOP7WNFEWIVR6OMI/action/replication_record"}},"created_at":"2026-05-18T02:37:58.810081+00:00","updated_at":"2026-05-18T02:37:58.810081+00:00"}