{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VXY45BRCEKZJSXKGAJFQW777QG","short_pith_number":"pith:VXY45BRC","schema_version":"1.0","canonical_sha256":"adf1ce862222b2995d46024b0b7fff81814f71c0b1c68a591c1ccbb04edab0a2","source":{"kind":"arxiv","id":"1611.03260","version":1},"attestation_state":"computed","paper":{"title":"Faster Approximation for Maximum Independent Set on Unit Disk Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Sasanka Roy, Subhas C. Nandy, Supantha Pandit","submitted_at":"2016-11-10T11:22:51Z","abstract_excerpt":"Maximum independent set from a given set $D$ of unit disks intersecting a horizontal line can be solved in $O(n^2)$ time and $O(n^2)$ space. As a corollary, we design a factor 2 approximation algorithm for the maximum independent set problem on unit disk graph which takes both time and space of $O(n^2)$. The best known factor 2 approximation algorithm for this problem runs in $O(n^2 \\log n)$ time and takes $O(n^2)$ space [Jallu and Das 2016, Das et al. 2016]."},"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":"1611.03260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-11-10T11:22:51Z","cross_cats_sorted":[],"title_canon_sha256":"9eaf5bb3d31b4cd8eddbbef1169d4c89a78b232abdbd0425a5dd2203d2a10e84","abstract_canon_sha256":"d84bf6be4b46b6fe27f6ee6e62661890b415f238c97d809876e85f948e9ef4e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:40.806200Z","signature_b64":"p2r6HxLxHzuSa16ZCHW/3vW2STLVR7zVyqTfPuTiuAj+tgABAIXfiLBDxwUWk8Qqe5VDdBhGjcBjd4ETpFgrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adf1ce862222b2995d46024b0b7fff81814f71c0b1c68a591c1ccbb04edab0a2","last_reissued_at":"2026-05-18T00:59:40.805402Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:40.805402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Approximation for Maximum Independent Set on Unit Disk Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Sasanka Roy, Subhas C. Nandy, Supantha Pandit","submitted_at":"2016-11-10T11:22:51Z","abstract_excerpt":"Maximum independent set from a given set $D$ of unit disks intersecting a horizontal line can be solved in $O(n^2)$ time and $O(n^2)$ space. As a corollary, we design a factor 2 approximation algorithm for the maximum independent set problem on unit disk graph which takes both time and space of $O(n^2)$. The best known factor 2 approximation algorithm for this problem runs in $O(n^2 \\log n)$ time and takes $O(n^2)$ space [Jallu and Das 2016, Das et al. 2016]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03260","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":"1611.03260","created_at":"2026-05-18T00:59:40.805532+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.03260v1","created_at":"2026-05-18T00:59:40.805532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03260","created_at":"2026-05-18T00:59:40.805532+00:00"},{"alias_kind":"pith_short_12","alias_value":"VXY45BRCEKZJ","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VXY45BRCEKZJSXKG","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VXY45BRC","created_at":"2026-05-18T12:30:48.956258+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/VXY45BRCEKZJSXKGAJFQW777QG","json":"https://pith.science/pith/VXY45BRCEKZJSXKGAJFQW777QG.json","graph_json":"https://pith.science/api/pith-number/VXY45BRCEKZJSXKGAJFQW777QG/graph.json","events_json":"https://pith.science/api/pith-number/VXY45BRCEKZJSXKGAJFQW777QG/events.json","paper":"https://pith.science/paper/VXY45BRC"},"agent_actions":{"view_html":"https://pith.science/pith/VXY45BRCEKZJSXKGAJFQW777QG","download_json":"https://pith.science/pith/VXY45BRCEKZJSXKGAJFQW777QG.json","view_paper":"https://pith.science/paper/VXY45BRC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.03260&json=true","fetch_graph":"https://pith.science/api/pith-number/VXY45BRCEKZJSXKGAJFQW777QG/graph.json","fetch_events":"https://pith.science/api/pith-number/VXY45BRCEKZJSXKGAJFQW777QG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VXY45BRCEKZJSXKGAJFQW777QG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VXY45BRCEKZJSXKGAJFQW777QG/action/storage_attestation","attest_author":"https://pith.science/pith/VXY45BRCEKZJSXKGAJFQW777QG/action/author_attestation","sign_citation":"https://pith.science/pith/VXY45BRCEKZJSXKGAJFQW777QG/action/citation_signature","submit_replication":"https://pith.science/pith/VXY45BRCEKZJSXKGAJFQW777QG/action/replication_record"}},"created_at":"2026-05-18T00:59:40.805532+00:00","updated_at":"2026-05-18T00:59:40.805532+00:00"}