{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XLTZ743FNPDP362LECM6JHKDMX","short_pith_number":"pith:XLTZ743F","schema_version":"1.0","canonical_sha256":"bae79ff3656bc6fdfb4b2099e49d4365e4eb37c96f1dbbfeb83acb4cf8b3da22","source":{"kind":"arxiv","id":"2504.10859","version":1},"attestation_state":"computed","paper":{"title":"A Sublinear Algorithm for Path Feasibility Among Rectangular Obstacles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CG","authors_text":"Alex Fan, Alicia Li, Arul Kolla, Jason Gonzalez","submitted_at":"2025-04-15T04:40:25Z","abstract_excerpt":"The problem of finding a path between two points while avoiding obstacles is critical in robotic path planning. We focus on the feasibility problem: determining whether such a path exists. We model the robot as a query-specific rectangular object capable of moving parallel to its sides. The obstacles are axis-aligned, rectangular, and may overlap. Most previous works only consider nondisjoint rectangular objects and point-sized or statically sized robots. Our approach introduces a novel technique leveraging generalized Gabriel graphs and constructs a data structure to facilitate online queries"},"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.10859","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-04-15T04:40:25Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"0e3eaab7aa3bc8cc46811c4d6280144cd79e0c12549c5a70d88860760d535129","abstract_canon_sha256":"1705522c1ea3e50a329b48abcdd8089b448c5a4e7a1559ada12d8006467d62d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:49:25.459862Z","signature_b64":"40htXgDbcXkaVfJH6Lqt9bwUeMMUYe8TNvdGGq2lNMRHSDUaJGzknnR3wCFaTRz5jAyzWUyDzRh1uv/wpdNhAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bae79ff3656bc6fdfb4b2099e49d4365e4eb37c96f1dbbfeb83acb4cf8b3da22","last_reissued_at":"2026-07-05T10:49:25.459436Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:49:25.459436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Sublinear Algorithm for Path Feasibility Among Rectangular Obstacles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CG","authors_text":"Alex Fan, Alicia Li, Arul Kolla, Jason Gonzalez","submitted_at":"2025-04-15T04:40:25Z","abstract_excerpt":"The problem of finding a path between two points while avoiding obstacles is critical in robotic path planning. We focus on the feasibility problem: determining whether such a path exists. We model the robot as a query-specific rectangular object capable of moving parallel to its sides. The obstacles are axis-aligned, rectangular, and may overlap. Most previous works only consider nondisjoint rectangular objects and point-sized or statically sized robots. Our approach introduces a novel technique leveraging generalized Gabriel graphs and constructs a data structure to facilitate online queries"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.10859","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.10859/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.10859","created_at":"2026-07-05T10:49:25.459492+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.10859v1","created_at":"2026-07-05T10:49:25.459492+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.10859","created_at":"2026-07-05T10:49:25.459492+00:00"},{"alias_kind":"pith_short_12","alias_value":"XLTZ743FNPDP","created_at":"2026-07-05T10:49:25.459492+00:00"},{"alias_kind":"pith_short_16","alias_value":"XLTZ743FNPDP362L","created_at":"2026-07-05T10:49:25.459492+00:00"},{"alias_kind":"pith_short_8","alias_value":"XLTZ743F","created_at":"2026-07-05T10:49:25.459492+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/XLTZ743FNPDP362LECM6JHKDMX","json":"https://pith.science/pith/XLTZ743FNPDP362LECM6JHKDMX.json","graph_json":"https://pith.science/api/pith-number/XLTZ743FNPDP362LECM6JHKDMX/graph.json","events_json":"https://pith.science/api/pith-number/XLTZ743FNPDP362LECM6JHKDMX/events.json","paper":"https://pith.science/paper/XLTZ743F"},"agent_actions":{"view_html":"https://pith.science/pith/XLTZ743FNPDP362LECM6JHKDMX","download_json":"https://pith.science/pith/XLTZ743FNPDP362LECM6JHKDMX.json","view_paper":"https://pith.science/paper/XLTZ743F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.10859&json=true","fetch_graph":"https://pith.science/api/pith-number/XLTZ743FNPDP362LECM6JHKDMX/graph.json","fetch_events":"https://pith.science/api/pith-number/XLTZ743FNPDP362LECM6JHKDMX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XLTZ743FNPDP362LECM6JHKDMX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XLTZ743FNPDP362LECM6JHKDMX/action/storage_attestation","attest_author":"https://pith.science/pith/XLTZ743FNPDP362LECM6JHKDMX/action/author_attestation","sign_citation":"https://pith.science/pith/XLTZ743FNPDP362LECM6JHKDMX/action/citation_signature","submit_replication":"https://pith.science/pith/XLTZ743FNPDP362LECM6JHKDMX/action/replication_record"}},"created_at":"2026-07-05T10:49:25.459492+00:00","updated_at":"2026-07-05T10:49:25.459492+00:00"}