{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:Q5H4CVGN3U7CRJL7R67MPL6HOD","short_pith_number":"pith:Q5H4CVGN","canonical_record":{"source":{"id":"1005.2218","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-05-12T22:13:35Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"df32f975d228d296c41fb1a23397414aa30c92888750f553ae4ca225b602378a","abstract_canon_sha256":"44dd0bff670c5c0e479e1b6d529ceda2ee5056acafdcbff43e3feaf4a64094ca"},"schema_version":"1.0"},"canonical_sha256":"874fc154cddd3e28a57f8fbec7afc770ee0835759725ced04594e12a2e91a526","source":{"kind":"arxiv","id":"1005.2218","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.2218","created_at":"2026-05-18T02:24:07Z"},{"alias_kind":"arxiv_version","alias_value":"1005.2218v5","created_at":"2026-05-18T02:24:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.2218","created_at":"2026-05-18T02:24:07Z"},{"alias_kind":"pith_short_12","alias_value":"Q5H4CVGN3U7C","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"Q5H4CVGN3U7CRJL7","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"Q5H4CVGN","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:Q5H4CVGN3U7CRJL7R67MPL6HOD","target":"record","payload":{"canonical_record":{"source":{"id":"1005.2218","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-05-12T22:13:35Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"df32f975d228d296c41fb1a23397414aa30c92888750f553ae4ca225b602378a","abstract_canon_sha256":"44dd0bff670c5c0e479e1b6d529ceda2ee5056acafdcbff43e3feaf4a64094ca"},"schema_version":"1.0"},"canonical_sha256":"874fc154cddd3e28a57f8fbec7afc770ee0835759725ced04594e12a2e91a526","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:07.681786Z","signature_b64":"yYjjGKO6NHce9GZ3ItBsThPbpK3kzk0AuIxGAj2rgqSgZDsDuQ0oz9tmGGVqD5LF3VWUOpJ875ulh1oN/xOPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"874fc154cddd3e28a57f8fbec7afc770ee0835759725ced04594e12a2e91a526","last_reissued_at":"2026-05-18T02:24:07.681137Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:07.681137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1005.2218","source_version":5,"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-18T02:24:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7KVjpjwGSz/zMGTgvZYVNqzP34jaMkM5JuGKqTxOEL0aV+Izn9CGSgweJVH7dZbE+fZGkv+x/Y0iNBAIr8B3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:24:00.415900Z"},"content_sha256":"42f1f3781833158bbad4d62ca70ff58c72b308798cce3f902374096aa0f221ce","schema_version":"1.0","event_id":"sha256:42f1f3781833158bbad4d62ca70ff58c72b308798cce3f902374096aa0f221ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:Q5H4CVGN3U7CRJL7R67MPL6HOD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Opaque sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Adrian Dumitrescu, J\\'anos Pach, Minghui Jiang","submitted_at":"2010-05-12T22:13:35Z","abstract_excerpt":"The problem of finding \"small\" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an {\\em opaque set} or a {\\em barrier} for that region. We consider the problem of computing the shortest barrier for a given convex polygon with $n$ vertices. No exact algorithm is currently known even for the simplest instances such as a square or an equilateral triangle. For general barriers, we present an approximation algorithm with ratio $1/2 + \\frac{2 +\\sqrt{2}}{\\pi}=1.5867...$. For connected barriers we achieve the approximat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.2218","kind":"arxiv","version":5},"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-18T02:24:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ne1ZDfOyZNzM6n1SakDJyt+JRFzdhLmO2yIFZi+LLBUHkfY7zpzgt12ZE9jhRxLGmLluhuxys/Vr5HuSyxkqAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:24:00.416244Z"},"content_sha256":"441fcd33f30297807b1cf6ee94827b4ed7e73f3988626a73b39a0e5753993f5e","schema_version":"1.0","event_id":"sha256:441fcd33f30297807b1cf6ee94827b4ed7e73f3988626a73b39a0e5753993f5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q5H4CVGN3U7CRJL7R67MPL6HOD/bundle.json","state_url":"https://pith.science/pith/Q5H4CVGN3U7CRJL7R67MPL6HOD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q5H4CVGN3U7CRJL7R67MPL6HOD/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-05-30T11:24:00Z","links":{"resolver":"https://pith.science/pith/Q5H4CVGN3U7CRJL7R67MPL6HOD","bundle":"https://pith.science/pith/Q5H4CVGN3U7CRJL7R67MPL6HOD/bundle.json","state":"https://pith.science/pith/Q5H4CVGN3U7CRJL7R67MPL6HOD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q5H4CVGN3U7CRJL7R67MPL6HOD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:Q5H4CVGN3U7CRJL7R67MPL6HOD","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":"44dd0bff670c5c0e479e1b6d529ceda2ee5056acafdcbff43e3feaf4a64094ca","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-05-12T22:13:35Z","title_canon_sha256":"df32f975d228d296c41fb1a23397414aa30c92888750f553ae4ca225b602378a"},"schema_version":"1.0","source":{"id":"1005.2218","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.2218","created_at":"2026-05-18T02:24:07Z"},{"alias_kind":"arxiv_version","alias_value":"1005.2218v5","created_at":"2026-05-18T02:24:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.2218","created_at":"2026-05-18T02:24:07Z"},{"alias_kind":"pith_short_12","alias_value":"Q5H4CVGN3U7C","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"Q5H4CVGN3U7CRJL7","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"Q5H4CVGN","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:441fcd33f30297807b1cf6ee94827b4ed7e73f3988626a73b39a0e5753993f5e","target":"graph","created_at":"2026-05-18T02:24:07Z","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":"The problem of finding \"small\" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an {\\em opaque set} or a {\\em barrier} for that region. We consider the problem of computing the shortest barrier for a given convex polygon with $n$ vertices. No exact algorithm is currently known even for the simplest instances such as a square or an equilateral triangle. For general barriers, we present an approximation algorithm with ratio $1/2 + \\frac{2 +\\sqrt{2}}{\\pi}=1.5867...$. For connected barriers we achieve the approximat","authors_text":"Adrian Dumitrescu, J\\'anos Pach, Minghui Jiang","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-05-12T22:13:35Z","title":"Opaque sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.2218","kind":"arxiv","version":5},"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:42f1f3781833158bbad4d62ca70ff58c72b308798cce3f902374096aa0f221ce","target":"record","created_at":"2026-05-18T02:24:07Z","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":"44dd0bff670c5c0e479e1b6d529ceda2ee5056acafdcbff43e3feaf4a64094ca","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-05-12T22:13:35Z","title_canon_sha256":"df32f975d228d296c41fb1a23397414aa30c92888750f553ae4ca225b602378a"},"schema_version":"1.0","source":{"id":"1005.2218","kind":"arxiv","version":5}},"canonical_sha256":"874fc154cddd3e28a57f8fbec7afc770ee0835759725ced04594e12a2e91a526","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"874fc154cddd3e28a57f8fbec7afc770ee0835759725ced04594e12a2e91a526","first_computed_at":"2026-05-18T02:24:07.681137Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:07.681137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yYjjGKO6NHce9GZ3ItBsThPbpK3kzk0AuIxGAj2rgqSgZDsDuQ0oz9tmGGVqD5LF3VWUOpJ875ulh1oN/xOPBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:07.681786Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.2218","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42f1f3781833158bbad4d62ca70ff58c72b308798cce3f902374096aa0f221ce","sha256:441fcd33f30297807b1cf6ee94827b4ed7e73f3988626a73b39a0e5753993f5e"],"state_sha256":"8a17fcbd716778d4e73e5ab6a1bc10551935e87087beaedb49582170d48c0b96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vIkx8palIOLuSl5VF6a+dFZWeG5bYcgA4+AcwQpJPU1OrG7kPjn+5pPHWUFiqycvPiqJnqWNCUUq0LLxM4noDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:24:00.418156Z","bundle_sha256":"23ce99c79d5a953a78b1212668d010579ea2925f359fa6783fc669ed52463cd9"}}