{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OG47LUQQYTGUWQESAAACVKUHAP","short_pith_number":"pith:OG47LUQQ","schema_version":"1.0","canonical_sha256":"71b9f5d210c4cd4b409200002aaa8703fc17db77552f37cb0094fe5b953bccb7","source":{"kind":"arxiv","id":"1606.02026","version":1},"attestation_state":"computed","paper":{"title":"Minimal curvature-constrained networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"David Kirszenblat, Doreen Thomas, J. Hyam Rubinstein, Kashyapa Sirinanda, Marcus Brazil, Peter Grossman","submitted_at":"2016-06-07T04:17:35Z","abstract_excerpt":"This paper introduces an exact algorithm for the construction of a shortest curvature-constrained network interconnecting a given set of directed points in the plane and an iterative method for doing so in 3D space. Such a network will be referred to as a minimum Dubins network, since its edges are Dubins paths (or slight variants thereof). The problem of constructing a minimum Dubins network appears in the context of underground mining optimisation, where the aim is to construct a least-cost network of tunnels navigable by trucks with a minimum turning radius. The Dubins network problem is si"},"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":"1606.02026","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2016-06-07T04:17:35Z","cross_cats_sorted":[],"title_canon_sha256":"a5e12528b30c5ad8633e61c1f3982902719c9b18691b8d6248d6025fb1e59e8d","abstract_canon_sha256":"55fef18d30881e50c10b57c3102b4bf68e59e89906a23d65077fe56dbf78bc86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:44.769182Z","signature_b64":"KcM+YEyut9Yjz2VzuQBBzthFFZPKDt7LY90mbzyzjS6PeytLYilZhM5wMZTZZICmqHPFaWCmAq2rXHpZL/5ZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71b9f5d210c4cd4b409200002aaa8703fc17db77552f37cb0094fe5b953bccb7","last_reissued_at":"2026-05-18T01:12:44.768807Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:44.768807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimal curvature-constrained networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"David Kirszenblat, Doreen Thomas, J. Hyam Rubinstein, Kashyapa Sirinanda, Marcus Brazil, Peter Grossman","submitted_at":"2016-06-07T04:17:35Z","abstract_excerpt":"This paper introduces an exact algorithm for the construction of a shortest curvature-constrained network interconnecting a given set of directed points in the plane and an iterative method for doing so in 3D space. Such a network will be referred to as a minimum Dubins network, since its edges are Dubins paths (or slight variants thereof). The problem of constructing a minimum Dubins network appears in the context of underground mining optimisation, where the aim is to construct a least-cost network of tunnels navigable by trucks with a minimum turning radius. The Dubins network problem is si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02026","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":"1606.02026","created_at":"2026-05-18T01:12:44.768864+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.02026v1","created_at":"2026-05-18T01:12:44.768864+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02026","created_at":"2026-05-18T01:12:44.768864+00:00"},{"alias_kind":"pith_short_12","alias_value":"OG47LUQQYTGU","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OG47LUQQYTGUWQES","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OG47LUQQ","created_at":"2026-05-18T12:30:36.002864+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/OG47LUQQYTGUWQESAAACVKUHAP","json":"https://pith.science/pith/OG47LUQQYTGUWQESAAACVKUHAP.json","graph_json":"https://pith.science/api/pith-number/OG47LUQQYTGUWQESAAACVKUHAP/graph.json","events_json":"https://pith.science/api/pith-number/OG47LUQQYTGUWQESAAACVKUHAP/events.json","paper":"https://pith.science/paper/OG47LUQQ"},"agent_actions":{"view_html":"https://pith.science/pith/OG47LUQQYTGUWQESAAACVKUHAP","download_json":"https://pith.science/pith/OG47LUQQYTGUWQESAAACVKUHAP.json","view_paper":"https://pith.science/paper/OG47LUQQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.02026&json=true","fetch_graph":"https://pith.science/api/pith-number/OG47LUQQYTGUWQESAAACVKUHAP/graph.json","fetch_events":"https://pith.science/api/pith-number/OG47LUQQYTGUWQESAAACVKUHAP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OG47LUQQYTGUWQESAAACVKUHAP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OG47LUQQYTGUWQESAAACVKUHAP/action/storage_attestation","attest_author":"https://pith.science/pith/OG47LUQQYTGUWQESAAACVKUHAP/action/author_attestation","sign_citation":"https://pith.science/pith/OG47LUQQYTGUWQESAAACVKUHAP/action/citation_signature","submit_replication":"https://pith.science/pith/OG47LUQQYTGUWQESAAACVKUHAP/action/replication_record"}},"created_at":"2026-05-18T01:12:44.768864+00:00","updated_at":"2026-05-18T01:12:44.768864+00:00"}