{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NY5BQGSBRKULV6MR4CW2S3AJLY","short_pith_number":"pith:NY5BQGSB","schema_version":"1.0","canonical_sha256":"6e3a181a418aa8baf991e0ada96c095e37ebe8ae312064e6fc5b2304bbc0e990","source":{"kind":"arxiv","id":"1809.01965","version":2},"attestation_state":"computed","paper":{"title":"Time-optimality by distance-optimality for parabolic control systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Karl Kunisch, Lucas Bonifacius","submitted_at":"2018-09-06T13:13:42Z","abstract_excerpt":"The equivalence of time-optimal and distance-optimal control problems is shown for a class of parabolic control systems. Based on this equivalence, an approach for the efficient algorithmic solution of time-optimal control problems is investigated. Numerical examples are provided to illustrate that the approach works well is practice."},"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":"1809.01965","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-06T13:13:42Z","cross_cats_sorted":[],"title_canon_sha256":"292ecfd691469d3f0cf0b22fb44826d1d2a0e588a804b58f6df75ee12e9a6989","abstract_canon_sha256":"80ab79efa44b1e02dbb39b9d4ceac8cb11a92dfe8d00d0dfc0b094f581634b3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:33.865823Z","signature_b64":"XZzRjVxvFqdpgWmfMxt3N0WlcxxjgKhL/Ro9EZw03NFYfoI6uPkLABOPDvytusDLCTsY25nwkrrPGfW6Dpb7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e3a181a418aa8baf991e0ada96c095e37ebe8ae312064e6fc5b2304bbc0e990","last_reissued_at":"2026-05-17T23:48:33.865333Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:33.865333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time-optimality by distance-optimality for parabolic control systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Karl Kunisch, Lucas Bonifacius","submitted_at":"2018-09-06T13:13:42Z","abstract_excerpt":"The equivalence of time-optimal and distance-optimal control problems is shown for a class of parabolic control systems. Based on this equivalence, an approach for the efficient algorithmic solution of time-optimal control problems is investigated. Numerical examples are provided to illustrate that the approach works well is practice."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01965","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":""},"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":"1809.01965","created_at":"2026-05-17T23:48:33.865401+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.01965v2","created_at":"2026-05-17T23:48:33.865401+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01965","created_at":"2026-05-17T23:48:33.865401+00:00"},{"alias_kind":"pith_short_12","alias_value":"NY5BQGSBRKUL","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NY5BQGSBRKULV6MR","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NY5BQGSB","created_at":"2026-05-18T12:32:40.477152+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/NY5BQGSBRKULV6MR4CW2S3AJLY","json":"https://pith.science/pith/NY5BQGSBRKULV6MR4CW2S3AJLY.json","graph_json":"https://pith.science/api/pith-number/NY5BQGSBRKULV6MR4CW2S3AJLY/graph.json","events_json":"https://pith.science/api/pith-number/NY5BQGSBRKULV6MR4CW2S3AJLY/events.json","paper":"https://pith.science/paper/NY5BQGSB"},"agent_actions":{"view_html":"https://pith.science/pith/NY5BQGSBRKULV6MR4CW2S3AJLY","download_json":"https://pith.science/pith/NY5BQGSBRKULV6MR4CW2S3AJLY.json","view_paper":"https://pith.science/paper/NY5BQGSB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.01965&json=true","fetch_graph":"https://pith.science/api/pith-number/NY5BQGSBRKULV6MR4CW2S3AJLY/graph.json","fetch_events":"https://pith.science/api/pith-number/NY5BQGSBRKULV6MR4CW2S3AJLY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NY5BQGSBRKULV6MR4CW2S3AJLY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NY5BQGSBRKULV6MR4CW2S3AJLY/action/storage_attestation","attest_author":"https://pith.science/pith/NY5BQGSBRKULV6MR4CW2S3AJLY/action/author_attestation","sign_citation":"https://pith.science/pith/NY5BQGSBRKULV6MR4CW2S3AJLY/action/citation_signature","submit_replication":"https://pith.science/pith/NY5BQGSBRKULV6MR4CW2S3AJLY/action/replication_record"}},"created_at":"2026-05-17T23:48:33.865401+00:00","updated_at":"2026-05-17T23:48:33.865401+00:00"}