{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:II662TU6K3Y643FBACMYN3VZDP","short_pith_number":"pith:II662TU6","schema_version":"1.0","canonical_sha256":"423ded4e9e56f1ee6ca1009986eeb91bcf41f13bd385c460982e188225fcc7fb","source":{"kind":"arxiv","id":"1710.10089","version":1},"attestation_state":"computed","paper":{"title":"A Decomposition-Based Approach to Reasoning about Free Space Path-Connectivity for Rigid Objects in 2D","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Anastasiia Varava, Danica Kragic, Florian T. Pokorny, J. Frederico Carvalho","submitted_at":"2017-10-27T11:46:29Z","abstract_excerpt":"In this paper, we compute a conservative approximation of the path-connected components of the free space of a rigid object in a 2D workspace in order to solve two closely related problems: to determine whether there exists a collision-free path between two given configurations, and to verify whether an object can escape arbitrarily far from its initial configuration -- i.e., whether the object is caged. Furthermore, we consider two quantitative characteristics of the free space: the volume of path-connected components and the width of narrow passages. To address these problems, we decompose t"},"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":"1710.10089","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-10-27T11:46:29Z","cross_cats_sorted":[],"title_canon_sha256":"fae302308d77f6b29b3dee0e7cfe624a851739f4886c7b4a412e1aa3ed064ffb","abstract_canon_sha256":"24269d8a6ad8aa0ea62a1e7f4c72a2b15218c9b476c19cac4b084bfb2b98e80b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:54.793797Z","signature_b64":"LSL9U7VVi+Jr8OFMqGQwVrlvJV3SagrQNx2C4MUiyijKKUpml7eTM0k/hAipEsd/5tAQ1XlDuhmGM+youJnMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"423ded4e9e56f1ee6ca1009986eeb91bcf41f13bd385c460982e188225fcc7fb","last_reissued_at":"2026-05-18T00:31:54.793392Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:54.793392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Decomposition-Based Approach to Reasoning about Free Space Path-Connectivity for Rigid Objects in 2D","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Anastasiia Varava, Danica Kragic, Florian T. Pokorny, J. Frederico Carvalho","submitted_at":"2017-10-27T11:46:29Z","abstract_excerpt":"In this paper, we compute a conservative approximation of the path-connected components of the free space of a rigid object in a 2D workspace in order to solve two closely related problems: to determine whether there exists a collision-free path between two given configurations, and to verify whether an object can escape arbitrarily far from its initial configuration -- i.e., whether the object is caged. Furthermore, we consider two quantitative characteristics of the free space: the volume of path-connected components and the width of narrow passages. To address these problems, we decompose t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10089","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.10089","created_at":"2026-05-18T00:31:54.793451+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.10089v1","created_at":"2026-05-18T00:31:54.793451+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10089","created_at":"2026-05-18T00:31:54.793451+00:00"},{"alias_kind":"pith_short_12","alias_value":"II662TU6K3Y6","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"II662TU6K3Y643FB","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"II662TU6","created_at":"2026-05-18T12:31:21.493067+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/II662TU6K3Y643FBACMYN3VZDP","json":"https://pith.science/pith/II662TU6K3Y643FBACMYN3VZDP.json","graph_json":"https://pith.science/api/pith-number/II662TU6K3Y643FBACMYN3VZDP/graph.json","events_json":"https://pith.science/api/pith-number/II662TU6K3Y643FBACMYN3VZDP/events.json","paper":"https://pith.science/paper/II662TU6"},"agent_actions":{"view_html":"https://pith.science/pith/II662TU6K3Y643FBACMYN3VZDP","download_json":"https://pith.science/pith/II662TU6K3Y643FBACMYN3VZDP.json","view_paper":"https://pith.science/paper/II662TU6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.10089&json=true","fetch_graph":"https://pith.science/api/pith-number/II662TU6K3Y643FBACMYN3VZDP/graph.json","fetch_events":"https://pith.science/api/pith-number/II662TU6K3Y643FBACMYN3VZDP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/II662TU6K3Y643FBACMYN3VZDP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/II662TU6K3Y643FBACMYN3VZDP/action/storage_attestation","attest_author":"https://pith.science/pith/II662TU6K3Y643FBACMYN3VZDP/action/author_attestation","sign_citation":"https://pith.science/pith/II662TU6K3Y643FBACMYN3VZDP/action/citation_signature","submit_replication":"https://pith.science/pith/II662TU6K3Y643FBACMYN3VZDP/action/replication_record"}},"created_at":"2026-05-18T00:31:54.793451+00:00","updated_at":"2026-05-18T00:31:54.793451+00:00"}