{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AB2CUESX4VYYDTBMOOYT6HL43M","short_pith_number":"pith:AB2CUESX","schema_version":"1.0","canonical_sha256":"00742a1257e57181cc2c73b13f1d7cdb3bef599efa9101091777cf7f2a6c810d","source":{"kind":"arxiv","id":"1803.00786","version":1},"attestation_state":"computed","paper":{"title":"Simple and Local Independent Set Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dror Rawitz, Magn\\'us M. Halld\\'orsson, Ravi B. Boppana","submitted_at":"2018-03-02T09:58:26Z","abstract_excerpt":"We bound the performance guarantees that follow from Tur\\'an-like bounds for unweighted and weighted independent sets in bounded-degree graphs. In particular, a randomized approach of Boppana forms a simple 1-round distributed algorithm, as well as a streaming and preemptive online algorithm. We show it gives a tight $(\\Delta+1)/2$-approximation in unweighted graphs of maximum degree $\\Delta$, which is best possible for 1-round distributed algorithms. For weighted graphs, it gives only a $\\Delta$-approximation, but a simple modification results in an asymptotic expected $0.529 \\Delta$-approxim"},"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":"1803.00786","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-02T09:58:26Z","cross_cats_sorted":[],"title_canon_sha256":"291cec7f9a08d7e8671d749d4644edaab721d303b0053f1aa4efb0e4bf6363d6","abstract_canon_sha256":"cb3b2d4113159fa47a7c66073d10fa41e0e94ea6a59592cd5e1d519dcc732258"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:07.897053Z","signature_b64":"A9Fh9AbKnbrcEBqkQ6RQaHm6coYlH5993Kp29b5rwQi2jXkBzfclwaoXfcdX73zRH/8FyySSglOJetor72omDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00742a1257e57181cc2c73b13f1d7cdb3bef599efa9101091777cf7f2a6c810d","last_reissued_at":"2026-05-18T00:22:07.896402Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:07.896402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple and Local Independent Set Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dror Rawitz, Magn\\'us M. Halld\\'orsson, Ravi B. Boppana","submitted_at":"2018-03-02T09:58:26Z","abstract_excerpt":"We bound the performance guarantees that follow from Tur\\'an-like bounds for unweighted and weighted independent sets in bounded-degree graphs. In particular, a randomized approach of Boppana forms a simple 1-round distributed algorithm, as well as a streaming and preemptive online algorithm. We show it gives a tight $(\\Delta+1)/2$-approximation in unweighted graphs of maximum degree $\\Delta$, which is best possible for 1-round distributed algorithms. For weighted graphs, it gives only a $\\Delta$-approximation, but a simple modification results in an asymptotic expected $0.529 \\Delta$-approxim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00786","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":"1803.00786","created_at":"2026-05-18T00:22:07.896488+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.00786v1","created_at":"2026-05-18T00:22:07.896488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00786","created_at":"2026-05-18T00:22:07.896488+00:00"},{"alias_kind":"pith_short_12","alias_value":"AB2CUESX4VYY","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AB2CUESX4VYYDTBM","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AB2CUESX","created_at":"2026-05-18T12:32:13.499390+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/AB2CUESX4VYYDTBMOOYT6HL43M","json":"https://pith.science/pith/AB2CUESX4VYYDTBMOOYT6HL43M.json","graph_json":"https://pith.science/api/pith-number/AB2CUESX4VYYDTBMOOYT6HL43M/graph.json","events_json":"https://pith.science/api/pith-number/AB2CUESX4VYYDTBMOOYT6HL43M/events.json","paper":"https://pith.science/paper/AB2CUESX"},"agent_actions":{"view_html":"https://pith.science/pith/AB2CUESX4VYYDTBMOOYT6HL43M","download_json":"https://pith.science/pith/AB2CUESX4VYYDTBMOOYT6HL43M.json","view_paper":"https://pith.science/paper/AB2CUESX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.00786&json=true","fetch_graph":"https://pith.science/api/pith-number/AB2CUESX4VYYDTBMOOYT6HL43M/graph.json","fetch_events":"https://pith.science/api/pith-number/AB2CUESX4VYYDTBMOOYT6HL43M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AB2CUESX4VYYDTBMOOYT6HL43M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AB2CUESX4VYYDTBMOOYT6HL43M/action/storage_attestation","attest_author":"https://pith.science/pith/AB2CUESX4VYYDTBMOOYT6HL43M/action/author_attestation","sign_citation":"https://pith.science/pith/AB2CUESX4VYYDTBMOOYT6HL43M/action/citation_signature","submit_replication":"https://pith.science/pith/AB2CUESX4VYYDTBMOOYT6HL43M/action/replication_record"}},"created_at":"2026-05-18T00:22:07.896488+00:00","updated_at":"2026-05-18T00:22:07.896488+00:00"}