{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:C2WTOX5FYMOPIECZTWRU4UIOZN","short_pith_number":"pith:C2WTOX5F","schema_version":"1.0","canonical_sha256":"16ad375fa5c31cf410599da34e510ecb78b0c5cf8198b511c2a428a4ec88aca7","source":{"kind":"arxiv","id":"1201.6675","version":1},"attestation_state":"computed","paper":{"title":"Lower Bounds for Local Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DC","authors_text":"Juho Hirvonen, Jukka Suomela, Mika G\\\"o\\\"os","submitted_at":"2012-01-31T20:31:15Z","abstract_excerpt":"In the study of deterministic distributed algorithms it is commonly assumed that each node has a unique $O(\\log n)$-bit identifier. We prove that for a general class of graph problems, local algorithms (constant-time distributed algorithms) do not need such identifiers: a port numbering and orientation is sufficient.\n  Our result holds for so-called simple PO-checkable graph optimisation problems; this includes many classical packing and covering problems such as vertex covers, edge covers, matchings, independent sets, dominating sets, and edge dominating sets. We focus on the case of bounded-"},"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":"1201.6675","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-01-31T20:31:15Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"7b20e25fdcf7b7eba58829cea40d2416fc2d1b6677d1c4199a4ca92381befab2","abstract_canon_sha256":"131e6f7990b00e911c60600e2c7eac3ba28feb5449064c2a0d6260c6f65e1c19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:06.905483Z","signature_b64":"EaS3IrK/pUjcsH+QOPehgEOaYzgg4KzwypO833mTw0iA2Nk/8GZFU5+HSwQigJX6+KAVzFyS3UNL5QZRWeJkCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16ad375fa5c31cf410599da34e510ecb78b0c5cf8198b511c2a428a4ec88aca7","last_reissued_at":"2026-05-18T03:04:06.905013Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:06.905013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds for Local Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DC","authors_text":"Juho Hirvonen, Jukka Suomela, Mika G\\\"o\\\"os","submitted_at":"2012-01-31T20:31:15Z","abstract_excerpt":"In the study of deterministic distributed algorithms it is commonly assumed that each node has a unique $O(\\log n)$-bit identifier. We prove that for a general class of graph problems, local algorithms (constant-time distributed algorithms) do not need such identifiers: a port numbering and orientation is sufficient.\n  Our result holds for so-called simple PO-checkable graph optimisation problems; this includes many classical packing and covering problems such as vertex covers, edge covers, matchings, independent sets, dominating sets, and edge dominating sets. We focus on the case of bounded-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6675","kind":"arxiv","version":1},"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":"1201.6675","created_at":"2026-05-18T03:04:06.905078+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.6675v1","created_at":"2026-05-18T03:04:06.905078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6675","created_at":"2026-05-18T03:04:06.905078+00:00"},{"alias_kind":"pith_short_12","alias_value":"C2WTOX5FYMOP","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"C2WTOX5FYMOPIECZ","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"C2WTOX5F","created_at":"2026-05-18T12:27:01.376967+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/C2WTOX5FYMOPIECZTWRU4UIOZN","json":"https://pith.science/pith/C2WTOX5FYMOPIECZTWRU4UIOZN.json","graph_json":"https://pith.science/api/pith-number/C2WTOX5FYMOPIECZTWRU4UIOZN/graph.json","events_json":"https://pith.science/api/pith-number/C2WTOX5FYMOPIECZTWRU4UIOZN/events.json","paper":"https://pith.science/paper/C2WTOX5F"},"agent_actions":{"view_html":"https://pith.science/pith/C2WTOX5FYMOPIECZTWRU4UIOZN","download_json":"https://pith.science/pith/C2WTOX5FYMOPIECZTWRU4UIOZN.json","view_paper":"https://pith.science/paper/C2WTOX5F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.6675&json=true","fetch_graph":"https://pith.science/api/pith-number/C2WTOX5FYMOPIECZTWRU4UIOZN/graph.json","fetch_events":"https://pith.science/api/pith-number/C2WTOX5FYMOPIECZTWRU4UIOZN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C2WTOX5FYMOPIECZTWRU4UIOZN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C2WTOX5FYMOPIECZTWRU4UIOZN/action/storage_attestation","attest_author":"https://pith.science/pith/C2WTOX5FYMOPIECZTWRU4UIOZN/action/author_attestation","sign_citation":"https://pith.science/pith/C2WTOX5FYMOPIECZTWRU4UIOZN/action/citation_signature","submit_replication":"https://pith.science/pith/C2WTOX5FYMOPIECZTWRU4UIOZN/action/replication_record"}},"created_at":"2026-05-18T03:04:06.905078+00:00","updated_at":"2026-05-18T03:04:06.905078+00:00"}