{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VXY45BRCEKZJSXKGAJFQW777QG","short_pith_number":"pith:VXY45BRC","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"},"canonical_sha256":"adf1ce862222b2995d46024b0b7fff81814f71c0b1c68a591c1ccbb04edab0a2","source":{"kind":"arxiv","id":"1611.03260","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03260","created_at":"2026-05-18T00:59:40Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03260v1","created_at":"2026-05-18T00:59:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03260","created_at":"2026-05-18T00:59:40Z"},{"alias_kind":"pith_short_12","alias_value":"VXY45BRCEKZJ","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VXY45BRCEKZJSXKG","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VXY45BRC","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VXY45BRCEKZJSXKGAJFQW777QG","target":"record","payload":{"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"},"canonical_sha256":"adf1ce862222b2995d46024b0b7fff81814f71c0b1c68a591c1ccbb04edab0a2","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"},"source_kind":"arxiv","source_id":"1611.03260","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:59:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b+deAew7q9xJbPmCs+tic9bq4+C5JZ6+Mndn9H8Ok8GtKegv4g1QK0VkcWu8275KqzpX+JTlJtFVRcz3sxGDBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:36:27.093092Z"},"content_sha256":"e26155208eb9fa0fd1efe36ddad340f92c2c59258143e721533146b0545fc83f","schema_version":"1.0","event_id":"sha256:e26155208eb9fa0fd1efe36ddad340f92c2c59258143e721533146b0545fc83f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VXY45BRCEKZJSXKGAJFQW777QG","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:59:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ByQaoSP8n62L70x5A8fgaHIm6WAFED0bU2+lSbeEVvzisNIy+87n5VdEe+F53+00HPiEfkoMqHd41gsEHQuAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:36:27.093450Z"},"content_sha256":"0604afc321af73e18521fd292a23feb3265801c83f3fa75f1347c823d41c63cc","schema_version":"1.0","event_id":"sha256:0604afc321af73e18521fd292a23feb3265801c83f3fa75f1347c823d41c63cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VXY45BRCEKZJSXKGAJFQW777QG/bundle.json","state_url":"https://pith.science/pith/VXY45BRCEKZJSXKGAJFQW777QG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VXY45BRCEKZJSXKGAJFQW777QG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T05:36:27Z","links":{"resolver":"https://pith.science/pith/VXY45BRCEKZJSXKGAJFQW777QG","bundle":"https://pith.science/pith/VXY45BRCEKZJSXKGAJFQW777QG/bundle.json","state":"https://pith.science/pith/VXY45BRCEKZJSXKGAJFQW777QG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VXY45BRCEKZJSXKGAJFQW777QG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VXY45BRCEKZJSXKGAJFQW777QG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d84bf6be4b46b6fe27f6ee6e62661890b415f238c97d809876e85f948e9ef4e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-11-10T11:22:51Z","title_canon_sha256":"9eaf5bb3d31b4cd8eddbbef1169d4c89a78b232abdbd0425a5dd2203d2a10e84"},"schema_version":"1.0","source":{"id":"1611.03260","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03260","created_at":"2026-05-18T00:59:40Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03260v1","created_at":"2026-05-18T00:59:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03260","created_at":"2026-05-18T00:59:40Z"},{"alias_kind":"pith_short_12","alias_value":"VXY45BRCEKZJ","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VXY45BRCEKZJSXKG","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VXY45BRC","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:0604afc321af73e18521fd292a23feb3265801c83f3fa75f1347c823d41c63cc","target":"graph","created_at":"2026-05-18T00:59:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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].","authors_text":"Sasanka Roy, Subhas C. Nandy, Supantha Pandit","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-11-10T11:22:51Z","title":"Faster Approximation for Maximum Independent Set on Unit Disk Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03260","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e26155208eb9fa0fd1efe36ddad340f92c2c59258143e721533146b0545fc83f","target":"record","created_at":"2026-05-18T00:59:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d84bf6be4b46b6fe27f6ee6e62661890b415f238c97d809876e85f948e9ef4e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-11-10T11:22:51Z","title_canon_sha256":"9eaf5bb3d31b4cd8eddbbef1169d4c89a78b232abdbd0425a5dd2203d2a10e84"},"schema_version":"1.0","source":{"id":"1611.03260","kind":"arxiv","version":1}},"canonical_sha256":"adf1ce862222b2995d46024b0b7fff81814f71c0b1c68a591c1ccbb04edab0a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"adf1ce862222b2995d46024b0b7fff81814f71c0b1c68a591c1ccbb04edab0a2","first_computed_at":"2026-05-18T00:59:40.805402Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:40.805402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p2r6HxLxHzuSa16ZCHW/3vW2STLVR7zVyqTfPuTiuAj+tgABAIXfiLBDxwUWk8Qqe5VDdBhGjcBjd4ETpFgrAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:40.806200Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.03260","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e26155208eb9fa0fd1efe36ddad340f92c2c59258143e721533146b0545fc83f","sha256:0604afc321af73e18521fd292a23feb3265801c83f3fa75f1347c823d41c63cc"],"state_sha256":"285c60a1607afad561ca5062f2c093a5262d3bfead5bcd817f3d596e0d4743c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5HAo+ie/Xos9rVU3tSLkOC6ZfeuVBdM+fYS6Xl00+gQi/VLLJbUu0F39qzhdtKFZrJcibKDPQ9JbNsxaa/2EAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:36:27.095350Z","bundle_sha256":"6afd0ddd83fb39a60f8be4249282593ef323a429466f8eda733b53400a5e8988"}}