{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XW64OIA7YBKV644AESKTMYKUZS","short_pith_number":"pith:XW64OIA7","canonical_record":{"source":{"id":"1302.4707","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-02-19T18:54:14Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"e400b13da2929af34b0b1ce9adfeed384b9b12ba1d2a326bb87f7e07bd4068fb","abstract_canon_sha256":"8df8e721adc792861bf559560a5b3cfc83fcae5d2a8b518fa0d2d93301d86b4d"},"schema_version":"1.0"},"canonical_sha256":"bdbdc7201fc0555f73802495366154cc99972a0230ae5b3687ce7b8d18f85c92","source":{"kind":"arxiv","id":"1302.4707","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4707","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4707v5","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4707","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"pith_short_12","alias_value":"XW64OIA7YBKV","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XW64OIA7YBKV644A","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XW64OIA7","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XW64OIA7YBKV644AESKTMYKUZS","target":"record","payload":{"canonical_record":{"source":{"id":"1302.4707","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-02-19T18:54:14Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"e400b13da2929af34b0b1ce9adfeed384b9b12ba1d2a326bb87f7e07bd4068fb","abstract_canon_sha256":"8df8e721adc792861bf559560a5b3cfc83fcae5d2a8b518fa0d2d93301d86b4d"},"schema_version":"1.0"},"canonical_sha256":"bdbdc7201fc0555f73802495366154cc99972a0230ae5b3687ce7b8d18f85c92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:03.445991Z","signature_b64":"yPReS1LlhN1tpTMdYOxcMNqXaG+NCkREmd64TCzjhcxRcWqEkYDbb7YheKxkiKFhx4bd87bBV04Pzk15O5CXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdbdc7201fc0555f73802495366154cc99972a0230ae5b3687ce7b8d18f85c92","last_reissued_at":"2026-05-18T00:43:03.445462Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:03.445462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.4707","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-18T00:43:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IxLwCBTSqAP9LoZu+CqA3UgutJ8TgU/QJ3bcv+KdSeky5vTYi5dYTLY+KKSu+WJPj6pmgmR6veA+1RAvutmxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:28:07.084239Z"},"content_sha256":"3f5f20a7738904b4c168761875536cd056d98fe7e6da258300ec6ad6d09306e6","schema_version":"1.0","event_id":"sha256:3f5f20a7738904b4c168761875536cd056d98fe7e6da258300ec6ad6d09306e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XW64OIA7YBKV644AESKTMYKUZS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of Barrier Resilience for Fat Regions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.CC","authors_text":"Darren Strash, Maarten L\\\"offler, Matias Korman, Rodrigo I. Silveira","submitted_at":"2013-02-19T18:54:14Z","abstract_excerpt":"In the \\emph {barrier resilience} problem (introduced by Kumar {\\em et al.}, Wireless Networks 2007), we are given a collection of regions of the plane, acting as obstacles, and we would like to remove the minimum number of regions so that two fixed points can be connected without crossing any region. In this paper, we show that the problem is NP-hard when the collection only contains fat regions with bounded ply $\\Delta$ (even when they are axis-aligned rectangles of aspect ratio $1 : (1 + \\varepsilon)$). We also show that the problem is fixed-parameter tractable (FPT) for unit disks and for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4707","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-18T00:43:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EH3UoMZrLcn9T8ZwSRBqtMa4XnTWkh7jk3/siYHqQwCgDfbwu9ArweWhxWdsPjR7mBd3GnSejPIe7EMyg71RDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:28:07.084902Z"},"content_sha256":"d6ff4d743d749e6ecffc1f3202b0ad2cd7994d6dc5e8db3201b781ba8572a124","schema_version":"1.0","event_id":"sha256:d6ff4d743d749e6ecffc1f3202b0ad2cd7994d6dc5e8db3201b781ba8572a124"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XW64OIA7YBKV644AESKTMYKUZS/bundle.json","state_url":"https://pith.science/pith/XW64OIA7YBKV644AESKTMYKUZS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XW64OIA7YBKV644AESKTMYKUZS/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-26T20:28:07Z","links":{"resolver":"https://pith.science/pith/XW64OIA7YBKV644AESKTMYKUZS","bundle":"https://pith.science/pith/XW64OIA7YBKV644AESKTMYKUZS/bundle.json","state":"https://pith.science/pith/XW64OIA7YBKV644AESKTMYKUZS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XW64OIA7YBKV644AESKTMYKUZS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XW64OIA7YBKV644AESKTMYKUZS","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":"8df8e721adc792861bf559560a5b3cfc83fcae5d2a8b518fa0d2d93301d86b4d","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-02-19T18:54:14Z","title_canon_sha256":"e400b13da2929af34b0b1ce9adfeed384b9b12ba1d2a326bb87f7e07bd4068fb"},"schema_version":"1.0","source":{"id":"1302.4707","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4707","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4707v5","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4707","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"pith_short_12","alias_value":"XW64OIA7YBKV","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XW64OIA7YBKV644A","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XW64OIA7","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:d6ff4d743d749e6ecffc1f3202b0ad2cd7994d6dc5e8db3201b781ba8572a124","target":"graph","created_at":"2026-05-18T00:43:03Z","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":"In the \\emph {barrier resilience} problem (introduced by Kumar {\\em et al.}, Wireless Networks 2007), we are given a collection of regions of the plane, acting as obstacles, and we would like to remove the minimum number of regions so that two fixed points can be connected without crossing any region. In this paper, we show that the problem is NP-hard when the collection only contains fat regions with bounded ply $\\Delta$ (even when they are axis-aligned rectangles of aspect ratio $1 : (1 + \\varepsilon)$). We also show that the problem is fixed-parameter tractable (FPT) for unit disks and for ","authors_text":"Darren Strash, Maarten L\\\"offler, Matias Korman, Rodrigo I. Silveira","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-02-19T18:54:14Z","title":"On the Complexity of Barrier Resilience for Fat Regions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4707","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:3f5f20a7738904b4c168761875536cd056d98fe7e6da258300ec6ad6d09306e6","target":"record","created_at":"2026-05-18T00:43:03Z","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":"8df8e721adc792861bf559560a5b3cfc83fcae5d2a8b518fa0d2d93301d86b4d","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-02-19T18:54:14Z","title_canon_sha256":"e400b13da2929af34b0b1ce9adfeed384b9b12ba1d2a326bb87f7e07bd4068fb"},"schema_version":"1.0","source":{"id":"1302.4707","kind":"arxiv","version":5}},"canonical_sha256":"bdbdc7201fc0555f73802495366154cc99972a0230ae5b3687ce7b8d18f85c92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdbdc7201fc0555f73802495366154cc99972a0230ae5b3687ce7b8d18f85c92","first_computed_at":"2026-05-18T00:43:03.445462Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:03.445462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yPReS1LlhN1tpTMdYOxcMNqXaG+NCkREmd64TCzjhcxRcWqEkYDbb7YheKxkiKFhx4bd87bBV04Pzk15O5CXAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:03.445991Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.4707","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f5f20a7738904b4c168761875536cd056d98fe7e6da258300ec6ad6d09306e6","sha256:d6ff4d743d749e6ecffc1f3202b0ad2cd7994d6dc5e8db3201b781ba8572a124"],"state_sha256":"590e34a01ffc755a6041306f4343a5c53d58f84dc22f8ec9714d59bf10b13e95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eeQlgngliYNf7YE1TXasabqbLZoEEXPB0x5ayg6rkREA2DUDUo1iuRkRm/VGN2FKKusj0ZZe9n3LS8zFGFzdCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:28:07.088409Z","bundle_sha256":"d5e11b1413084f1f6bd7f98395212a690c52f6d66e42fc613223263ce4bb0406"}}