{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:RKLPRP3C34V53DNEDWAS7ZYBSZ","short_pith_number":"pith:RKLPRP3C","canonical_record":{"source":{"id":"1103.1431","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-03-08T04:10:02Z","cross_cats_sorted":[],"title_canon_sha256":"5399b102655bc821b7e134e79e81b87ce243389c6ac2a96cea7df30256d497e6","abstract_canon_sha256":"b8689114d1c8419769cb96905bfff6c3ba664cc53c24243d0b984528f57c2a77"},"schema_version":"1.0"},"canonical_sha256":"8a96f8bf62df2bdd8da41d812fe70196782b2aa62f1457e96ad89f66ae04094e","source":{"kind":"arxiv","id":"1103.1431","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1431","created_at":"2026-05-18T04:27:15Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1431v1","created_at":"2026-05-18T04:27:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1431","created_at":"2026-05-18T04:27:15Z"},{"alias_kind":"pith_short_12","alias_value":"RKLPRP3C34V5","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RKLPRP3C34V53DNE","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RKLPRP3C","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:RKLPRP3C34V53DNEDWAS7ZYBSZ","target":"record","payload":{"canonical_record":{"source":{"id":"1103.1431","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-03-08T04:10:02Z","cross_cats_sorted":[],"title_canon_sha256":"5399b102655bc821b7e134e79e81b87ce243389c6ac2a96cea7df30256d497e6","abstract_canon_sha256":"b8689114d1c8419769cb96905bfff6c3ba664cc53c24243d0b984528f57c2a77"},"schema_version":"1.0"},"canonical_sha256":"8a96f8bf62df2bdd8da41d812fe70196782b2aa62f1457e96ad89f66ae04094e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:15.857945Z","signature_b64":"L4DDwWIHOP0/CtGbO4UMY43kCpmVRBIflGeCyUa55q4SWyqMRjE1/lsV3mFHdQHoMC2YxX6ignEICjscJX6RCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a96f8bf62df2bdd8da41d812fe70196782b2aa62f1457e96ad89f66ae04094e","last_reissued_at":"2026-05-18T04:27:15.857273Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:15.857273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.1431","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-18T04:27:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gnJgo5nm6HKsLUSbaTuYEg5uiB17kD/BiAOH3tnlaVgh04KacaxdHo3wnsLKXWDkswV3tDWc9l/u7P5ITeEpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:32:37.208072Z"},"content_sha256":"56cb5422fa14fc50d43acc211c575962a04940d8cc7e6d72889e678981c11f62","schema_version":"1.0","event_id":"sha256:56cb5422fa14fc50d43acc211c575962a04940d8cc7e6d72889e678981c11f62"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:RKLPRP3C34V53DNEDWAS7ZYBSZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Maximum Independent Set of Pseudo-Disks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Sariel Har-Peled, Timothy M. Chan","submitted_at":"2011-03-08T04:10:02Z","abstract_excerpt":"We present approximation algorithms for maximum independent set of pseudo-disks in the plane, both in the weighted and unweighted cases. For the unweighted case, we prove that a local search algorithm yields a \\PTAS. For the weighted case, we suggest a novel rounding scheme based on an \\LP relaxation of the problem, which leads to a constant-factor approximation. Most previous algorithms for maximum independent set (in geometric settings) relied on packing arguments that are not applicable in this case. As such, the analysis of both algorithms requires some new combinatorial ideas, which we be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1431","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-18T04:27:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RQ2OV5hnJE/C7CDRugbg6b1CeE69BPQPmqZ7HEtUDsnh3H8wnWYXSc7D3XiTiYR6rlg9U4SVj12ORAQGwPGPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:32:37.208427Z"},"content_sha256":"e42d648fcd1f9cdb084a02cd1e817d3bd38a90a85cfce54fbf3b55f17c6ef2ac","schema_version":"1.0","event_id":"sha256:e42d648fcd1f9cdb084a02cd1e817d3bd38a90a85cfce54fbf3b55f17c6ef2ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RKLPRP3C34V53DNEDWAS7ZYBSZ/bundle.json","state_url":"https://pith.science/pith/RKLPRP3C34V53DNEDWAS7ZYBSZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RKLPRP3C34V53DNEDWAS7ZYBSZ/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-03T02:32:37Z","links":{"resolver":"https://pith.science/pith/RKLPRP3C34V53DNEDWAS7ZYBSZ","bundle":"https://pith.science/pith/RKLPRP3C34V53DNEDWAS7ZYBSZ/bundle.json","state":"https://pith.science/pith/RKLPRP3C34V53DNEDWAS7ZYBSZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RKLPRP3C34V53DNEDWAS7ZYBSZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:RKLPRP3C34V53DNEDWAS7ZYBSZ","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":"b8689114d1c8419769cb96905bfff6c3ba664cc53c24243d0b984528f57c2a77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-03-08T04:10:02Z","title_canon_sha256":"5399b102655bc821b7e134e79e81b87ce243389c6ac2a96cea7df30256d497e6"},"schema_version":"1.0","source":{"id":"1103.1431","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1431","created_at":"2026-05-18T04:27:15Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1431v1","created_at":"2026-05-18T04:27:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1431","created_at":"2026-05-18T04:27:15Z"},{"alias_kind":"pith_short_12","alias_value":"RKLPRP3C34V5","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RKLPRP3C34V53DNE","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RKLPRP3C","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:e42d648fcd1f9cdb084a02cd1e817d3bd38a90a85cfce54fbf3b55f17c6ef2ac","target":"graph","created_at":"2026-05-18T04:27:15Z","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":"We present approximation algorithms for maximum independent set of pseudo-disks in the plane, both in the weighted and unweighted cases. For the unweighted case, we prove that a local search algorithm yields a \\PTAS. For the weighted case, we suggest a novel rounding scheme based on an \\LP relaxation of the problem, which leads to a constant-factor approximation. Most previous algorithms for maximum independent set (in geometric settings) relied on packing arguments that are not applicable in this case. As such, the analysis of both algorithms requires some new combinatorial ideas, which we be","authors_text":"Sariel Har-Peled, Timothy M. Chan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-03-08T04:10:02Z","title":"Approximation Algorithms for Maximum Independent Set of Pseudo-Disks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1431","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:56cb5422fa14fc50d43acc211c575962a04940d8cc7e6d72889e678981c11f62","target":"record","created_at":"2026-05-18T04:27:15Z","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":"b8689114d1c8419769cb96905bfff6c3ba664cc53c24243d0b984528f57c2a77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-03-08T04:10:02Z","title_canon_sha256":"5399b102655bc821b7e134e79e81b87ce243389c6ac2a96cea7df30256d497e6"},"schema_version":"1.0","source":{"id":"1103.1431","kind":"arxiv","version":1}},"canonical_sha256":"8a96f8bf62df2bdd8da41d812fe70196782b2aa62f1457e96ad89f66ae04094e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a96f8bf62df2bdd8da41d812fe70196782b2aa62f1457e96ad89f66ae04094e","first_computed_at":"2026-05-18T04:27:15.857273Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:15.857273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L4DDwWIHOP0/CtGbO4UMY43kCpmVRBIflGeCyUa55q4SWyqMRjE1/lsV3mFHdQHoMC2YxX6ignEICjscJX6RCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:15.857945Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.1431","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56cb5422fa14fc50d43acc211c575962a04940d8cc7e6d72889e678981c11f62","sha256:e42d648fcd1f9cdb084a02cd1e817d3bd38a90a85cfce54fbf3b55f17c6ef2ac"],"state_sha256":"fe1a79f17adc7b97a507e53860cf3d7f8856e789340cf744cbaec7e174ae6e76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+0yv/z3eWETi+A3lkH8eImPQJVgoitRPIxDU2exzpbpOI9P/3ThLnidFAbByap1GySLOnC5Rz/phcYzxg3K7CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:32:37.210694Z","bundle_sha256":"0c43b5bb4c32361efb1f0a2ad77b8f279cfde5a0f718dd7b61df1425d01e4b56"}}