{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:663BD2FZ3O5V77GVGQG6BU7N26","short_pith_number":"pith:663BD2FZ","schema_version":"1.0","canonical_sha256":"f7b611e8b9dbbb5ffcd5340de0d3edd7ba2079fd44f25b3876d3b87b34a10e13","source":{"kind":"arxiv","id":"1610.07671","version":1},"attestation_state":"computed","paper":{"title":"Sparser Sparse Roadmaps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"David Coleman, Nikolaus Correll","submitted_at":"2016-10-24T22:26:45Z","abstract_excerpt":"We present methods for offline generation of sparse roadmap spanners that result in graphs 79% smaller than existing approaches while returning solutions of equivalent path quality. Our method uses a hybrid approach to sampling that combines traditional graph discretization with random sampling. We present techniques that optimize the graph for the L1-norm metric function commonly used in joint-based robotic planning, purposefully choosing a $t$-stretch factor based on the geometry of the space, and removing redundant edges that do not contribute to the graph quality. A high-quality pre-proces"},"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":"1610.07671","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-10-24T22:26:45Z","cross_cats_sorted":[],"title_canon_sha256":"3ee5956cfb2ba36edb8cc6839eaf7e6c23288b58c447ad013e9db6a1e69d3d13","abstract_canon_sha256":"8677958340919ef29b5d0356a291497e8c30e0abcd3b96aaecfc3635322a4ef0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:21.528966Z","signature_b64":"Y17Nbs5FudPCwjmWSQ8OnURqGCxICUhmovvB96sKLWGCc32jVUKuptYwu044eT99VrBouB6K24DWz126j64GAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7b611e8b9dbbb5ffcd5340de0d3edd7ba2079fd44f25b3876d3b87b34a10e13","last_reissued_at":"2026-05-18T01:01:21.528313Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:21.528313Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparser Sparse Roadmaps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"David Coleman, Nikolaus Correll","submitted_at":"2016-10-24T22:26:45Z","abstract_excerpt":"We present methods for offline generation of sparse roadmap spanners that result in graphs 79% smaller than existing approaches while returning solutions of equivalent path quality. Our method uses a hybrid approach to sampling that combines traditional graph discretization with random sampling. We present techniques that optimize the graph for the L1-norm metric function commonly used in joint-based robotic planning, purposefully choosing a $t$-stretch factor based on the geometry of the space, and removing redundant edges that do not contribute to the graph quality. A high-quality pre-proces"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07671","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":"1610.07671","created_at":"2026-05-18T01:01:21.528406+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.07671v1","created_at":"2026-05-18T01:01:21.528406+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07671","created_at":"2026-05-18T01:01:21.528406+00:00"},{"alias_kind":"pith_short_12","alias_value":"663BD2FZ3O5V","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"663BD2FZ3O5V77GV","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"663BD2FZ","created_at":"2026-05-18T12:30:01.593930+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/663BD2FZ3O5V77GVGQG6BU7N26","json":"https://pith.science/pith/663BD2FZ3O5V77GVGQG6BU7N26.json","graph_json":"https://pith.science/api/pith-number/663BD2FZ3O5V77GVGQG6BU7N26/graph.json","events_json":"https://pith.science/api/pith-number/663BD2FZ3O5V77GVGQG6BU7N26/events.json","paper":"https://pith.science/paper/663BD2FZ"},"agent_actions":{"view_html":"https://pith.science/pith/663BD2FZ3O5V77GVGQG6BU7N26","download_json":"https://pith.science/pith/663BD2FZ3O5V77GVGQG6BU7N26.json","view_paper":"https://pith.science/paper/663BD2FZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.07671&json=true","fetch_graph":"https://pith.science/api/pith-number/663BD2FZ3O5V77GVGQG6BU7N26/graph.json","fetch_events":"https://pith.science/api/pith-number/663BD2FZ3O5V77GVGQG6BU7N26/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/663BD2FZ3O5V77GVGQG6BU7N26/action/timestamp_anchor","attest_storage":"https://pith.science/pith/663BD2FZ3O5V77GVGQG6BU7N26/action/storage_attestation","attest_author":"https://pith.science/pith/663BD2FZ3O5V77GVGQG6BU7N26/action/author_attestation","sign_citation":"https://pith.science/pith/663BD2FZ3O5V77GVGQG6BU7N26/action/citation_signature","submit_replication":"https://pith.science/pith/663BD2FZ3O5V77GVGQG6BU7N26/action/replication_record"}},"created_at":"2026-05-18T01:01:21.528406+00:00","updated_at":"2026-05-18T01:01:21.528406+00:00"}