{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WRFWPH4LSRQG56HBHT2THA3EMX","short_pith_number":"pith:WRFWPH4L","schema_version":"1.0","canonical_sha256":"b44b679f8b94606ef8e13cf533836465d1fa3c86505a8861f1d60b2eb9a97941","source":{"kind":"arxiv","id":"2504.17289","version":2},"attestation_state":"computed","paper":{"title":"Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anurag Murty Naredla, Jack Spalding-Jamieson","submitted_at":"2025-04-24T06:31:46Z","abstract_excerpt":"Given two points in the plane, and a set of \"obstacles\" given as curves through the plane with assigned weights, we consider the point-separation problem, which asks for the minimum-weight subset of the obstacles separating the two points. A few computational models for this problem have been previously studied. We give a unified approach to this problem in all models via a reduction to a particular shortest-path problem, and obtain improved running times in essentially all cases. In addition, we also give fine-grained lower bounds for many cases."},"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":"2504.17289","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2025-04-24T06:31:46Z","cross_cats_sorted":[],"title_canon_sha256":"7b5b1228ce31e17e5fbaae84545b3900f3b7723e38b3da6f01d7de51e5559d4c","abstract_canon_sha256":"bace3cceecc26c15d1c340873b9d54bbc1bef622d57fd4ba1e9ce9cc9de6ad9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:35:55.468789Z","signature_b64":"erdm2VR3dw2PAQu0y7NNUYmahy0i7aafeOCTFqzS9eTy/e8O6FWE1Zmog/nsXVoj3lfjMNTt4XfTfQ0VNLUmAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b44b679f8b94606ef8e13cf533836465d1fa3c86505a8861f1d60b2eb9a97941","last_reissued_at":"2026-07-05T11:35:55.468299Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:35:55.468299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anurag Murty Naredla, Jack Spalding-Jamieson","submitted_at":"2025-04-24T06:31:46Z","abstract_excerpt":"Given two points in the plane, and a set of \"obstacles\" given as curves through the plane with assigned weights, we consider the point-separation problem, which asks for the minimum-weight subset of the obstacles separating the two points. A few computational models for this problem have been previously studied. We give a unified approach to this problem in all models via a reduction to a particular shortest-path problem, and obtain improved running times in essentially all cases. In addition, we also give fine-grained lower bounds for many cases."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.17289","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.17289/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2504.17289","created_at":"2026-07-05T11:35:55.468365+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.17289v2","created_at":"2026-07-05T11:35:55.468365+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.17289","created_at":"2026-07-05T11:35:55.468365+00:00"},{"alias_kind":"pith_short_12","alias_value":"WRFWPH4LSRQG","created_at":"2026-07-05T11:35:55.468365+00:00"},{"alias_kind":"pith_short_16","alias_value":"WRFWPH4LSRQG56HB","created_at":"2026-07-05T11:35:55.468365+00:00"},{"alias_kind":"pith_short_8","alias_value":"WRFWPH4L","created_at":"2026-07-05T11:35:55.468365+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/WRFWPH4LSRQG56HBHT2THA3EMX","json":"https://pith.science/pith/WRFWPH4LSRQG56HBHT2THA3EMX.json","graph_json":"https://pith.science/api/pith-number/WRFWPH4LSRQG56HBHT2THA3EMX/graph.json","events_json":"https://pith.science/api/pith-number/WRFWPH4LSRQG56HBHT2THA3EMX/events.json","paper":"https://pith.science/paper/WRFWPH4L"},"agent_actions":{"view_html":"https://pith.science/pith/WRFWPH4LSRQG56HBHT2THA3EMX","download_json":"https://pith.science/pith/WRFWPH4LSRQG56HBHT2THA3EMX.json","view_paper":"https://pith.science/paper/WRFWPH4L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.17289&json=true","fetch_graph":"https://pith.science/api/pith-number/WRFWPH4LSRQG56HBHT2THA3EMX/graph.json","fetch_events":"https://pith.science/api/pith-number/WRFWPH4LSRQG56HBHT2THA3EMX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WRFWPH4LSRQG56HBHT2THA3EMX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WRFWPH4LSRQG56HBHT2THA3EMX/action/storage_attestation","attest_author":"https://pith.science/pith/WRFWPH4LSRQG56HBHT2THA3EMX/action/author_attestation","sign_citation":"https://pith.science/pith/WRFWPH4LSRQG56HBHT2THA3EMX/action/citation_signature","submit_replication":"https://pith.science/pith/WRFWPH4LSRQG56HBHT2THA3EMX/action/replication_record"}},"created_at":"2026-07-05T11:35:55.468365+00:00","updated_at":"2026-07-05T11:35:55.468365+00:00"}