{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:Q4JZUCPJJN63TACM6JBWIQPEVZ","short_pith_number":"pith:Q4JZUCPJ","schema_version":"1.0","canonical_sha256":"87139a09e94b7db9804cf2436441e4ae6dcb4c3ba98437c9464772ef23d2fee7","source":{"kind":"arxiv","id":"2306.01203","version":2},"attestation_state":"computed","paper":{"title":"Topo-Geometrically Distinct Path Computation using Neighborhood-augmented Graph, and its Application to Path Planning for a Tethered Robot in 3D","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.RO","authors_text":"Alp Sahin, Subhrajit Bhattacharya","submitted_at":"2023-06-01T23:33:53Z","abstract_excerpt":"Many robotics applications benefit from being able to compute multiple locally optimal paths in a given configuration space. Examples include path planning for of tethered robots with cable-length constraints, systems involving cables, multi-robot topological exploration & coverage, and, congestion reduction for mobile robots navigation without inter-robot coordination. Existing paradigm is to use topological path planning methods that can provide optimal paths from distinct topological classes available in the underlying configuration space. However, these methods usually require non-trivial "},"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":"2306.01203","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-06-01T23:33:53Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d3e5765a925988ad0993f575a7c1588d543a7ff1006249f1957b70cd03f64a79","abstract_canon_sha256":"1a6927757fb2467b9042289e52785cc8cf3fdc476688f90b8ade4890a09f3404"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:29:21.262550Z","signature_b64":"MMiuJnUfR9vcNbm+KwftZYjsnvrcymzwPXgUKxtFqYVqIVuYU1Y99wY5boRpFsyus6odfV2AtdSALuadVIONAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87139a09e94b7db9804cf2436441e4ae6dcb4c3ba98437c9464772ef23d2fee7","last_reissued_at":"2026-07-05T06:29:21.262119Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:29:21.262119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Topo-Geometrically Distinct Path Computation using Neighborhood-augmented Graph, and its Application to Path Planning for a Tethered Robot in 3D","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.RO","authors_text":"Alp Sahin, Subhrajit Bhattacharya","submitted_at":"2023-06-01T23:33:53Z","abstract_excerpt":"Many robotics applications benefit from being able to compute multiple locally optimal paths in a given configuration space. Examples include path planning for of tethered robots with cable-length constraints, systems involving cables, multi-robot topological exploration & coverage, and, congestion reduction for mobile robots navigation without inter-robot coordination. Existing paradigm is to use topological path planning methods that can provide optimal paths from distinct topological classes available in the underlying configuration space. However, these methods usually require non-trivial "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.01203","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/2306.01203/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":"2306.01203","created_at":"2026-07-05T06:29:21.262174+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.01203v2","created_at":"2026-07-05T06:29:21.262174+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.01203","created_at":"2026-07-05T06:29:21.262174+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q4JZUCPJJN63","created_at":"2026-07-05T06:29:21.262174+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q4JZUCPJJN63TACM","created_at":"2026-07-05T06:29:21.262174+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q4JZUCPJ","created_at":"2026-07-05T06:29:21.262174+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/Q4JZUCPJJN63TACM6JBWIQPEVZ","json":"https://pith.science/pith/Q4JZUCPJJN63TACM6JBWIQPEVZ.json","graph_json":"https://pith.science/api/pith-number/Q4JZUCPJJN63TACM6JBWIQPEVZ/graph.json","events_json":"https://pith.science/api/pith-number/Q4JZUCPJJN63TACM6JBWIQPEVZ/events.json","paper":"https://pith.science/paper/Q4JZUCPJ"},"agent_actions":{"view_html":"https://pith.science/pith/Q4JZUCPJJN63TACM6JBWIQPEVZ","download_json":"https://pith.science/pith/Q4JZUCPJJN63TACM6JBWIQPEVZ.json","view_paper":"https://pith.science/paper/Q4JZUCPJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.01203&json=true","fetch_graph":"https://pith.science/api/pith-number/Q4JZUCPJJN63TACM6JBWIQPEVZ/graph.json","fetch_events":"https://pith.science/api/pith-number/Q4JZUCPJJN63TACM6JBWIQPEVZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q4JZUCPJJN63TACM6JBWIQPEVZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q4JZUCPJJN63TACM6JBWIQPEVZ/action/storage_attestation","attest_author":"https://pith.science/pith/Q4JZUCPJJN63TACM6JBWIQPEVZ/action/author_attestation","sign_citation":"https://pith.science/pith/Q4JZUCPJJN63TACM6JBWIQPEVZ/action/citation_signature","submit_replication":"https://pith.science/pith/Q4JZUCPJJN63TACM6JBWIQPEVZ/action/replication_record"}},"created_at":"2026-07-05T06:29:21.262174+00:00","updated_at":"2026-07-05T06:29:21.262174+00:00"}