{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YEPX2S6IPSEMWTZOZO7OTLTQ5P","short_pith_number":"pith:YEPX2S6I","schema_version":"1.0","canonical_sha256":"c11f7d4bc87c88cb4f2ecbbee9ae70ebd296b2af95fa990aa1d87babcc57c112","source":{"kind":"arxiv","id":"2604.20428","version":2},"attestation_state":"computed","paper":{"title":"Lexicographic Minimum-Violation Motion Planning using Signal Temporal Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Non-uniform quantization and bit-shifting turn lexicographic STL optimization into a single scalar problem.","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Hannes Homburger, Johannes Reuter, Lothar Kiltz, Matthias Althoff, Patrick Halder","submitted_at":"2026-04-22T10:49:09Z","abstract_excerpt":"Motion planning for autonomous vehicles often requires satisfying multiple conditionally conflicting specifications. In situations where not all specifications can be met simultaneously, minimum-violation motion planning maintains system operation by minimizing violations of specifications in accordance with their priorities. Signal temporal logic (STL) provides a formal language for rigorously defining these specifications and enables the quantitative evaluation of their violations. However, a total ordering of specifications yields a lexicographic optimization problem, which is typically com"},"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":"2604.20428","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-04-22T10:49:09Z","cross_cats_sorted":[],"title_canon_sha256":"0f4f898460616a72e643c3ace5acf619c33e01c3d2fde6bce96f114c0175fd6d","abstract_canon_sha256":"7d2dcb7e8650e50e7899e8e5535ad35d666247726a64f57065b99a34c139cd08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:09:28.000113Z","signature_b64":"RawF4juh837uJKNN15KSSBAPSTPIH77X415sDL8DFXbYGnu/+jsBieyeFw69KbaHQpoSiQpCgFyaX/MsQqKFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c11f7d4bc87c88cb4f2ecbbee9ae70ebd296b2af95fa990aa1d87babcc57c112","last_reissued_at":"2026-06-12T01:09:27.999700Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:09:27.999700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lexicographic Minimum-Violation Motion Planning using Signal Temporal Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Non-uniform quantization and bit-shifting turn lexicographic STL optimization into a single scalar problem.","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Hannes Homburger, Johannes Reuter, Lothar Kiltz, Matthias Althoff, Patrick Halder","submitted_at":"2026-04-22T10:49:09Z","abstract_excerpt":"Motion planning for autonomous vehicles often requires satisfying multiple conditionally conflicting specifications. In situations where not all specifications can be met simultaneously, minimum-violation motion planning maintains system operation by minimizing violations of specifications in accordance with their priorities. Signal temporal logic (STL) provides a formal language for rigorously defining these specifications and enables the quantitative evaluation of their violations. However, a total ordering of specifications yields a lexicographic optimization problem, which is typically com"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We address this problem by transforming the multi-objective lexicographic optimization problem into a single-objective scalar optimization problem using non-uniform quantization and bit-shifting.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the non-uniform quantization and bit-shifting accurately preserve the lexicographic ordering without significant loss of optimality or introduction of artifacts in the optimization landscape.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Transforms lexicographic minimum-violation STL motion planning into scalar optimization using non-uniform quantization and bit-shifting for efficient MPPI solving.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Non-uniform quantization and bit-shifting turn lexicographic STL optimization into a single scalar problem.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"c5813cc84b7433e6fb4284c69a56876788061a131906ad824714f6cac715734e"},"source":{"id":"2604.20428","kind":"arxiv","version":2},"verdict":{"id":"cfe6307a-3731-453d-b958-adf186a7efd2","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T00:08:03.841540Z","strongest_claim":"We address this problem by transforming the multi-objective lexicographic optimization problem into a single-objective scalar optimization problem using non-uniform quantization and bit-shifting.","one_line_summary":"Transforms lexicographic minimum-violation STL motion planning into scalar optimization using non-uniform quantization and bit-shifting for efficient MPPI solving.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the non-uniform quantization and bit-shifting accurately preserve the lexicographic ordering without significant loss of optimality or introduction of artifacts in the optimization landscape.","pith_extraction_headline":"Non-uniform quantization and bit-shifting turn lexicographic STL optimization into a single scalar problem."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.20428/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-21T14:41:09.711582Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-20T01:57:49.510662Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"80e6ec1bfbce27690517b8256d7e1f9428f4289046c6b06e996e37e242d71a56"},"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":"2604.20428","created_at":"2026-06-12T01:09:27.999766+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.20428v2","created_at":"2026-06-12T01:09:27.999766+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.20428","created_at":"2026-06-12T01:09:27.999766+00:00"},{"alias_kind":"pith_short_12","alias_value":"YEPX2S6IPSEM","created_at":"2026-06-12T01:09:27.999766+00:00"},{"alias_kind":"pith_short_16","alias_value":"YEPX2S6IPSEMWTZO","created_at":"2026-06-12T01:09:27.999766+00:00"},{"alias_kind":"pith_short_8","alias_value":"YEPX2S6I","created_at":"2026-06-12T01:09:27.999766+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/YEPX2S6IPSEMWTZOZO7OTLTQ5P","json":"https://pith.science/pith/YEPX2S6IPSEMWTZOZO7OTLTQ5P.json","graph_json":"https://pith.science/api/pith-number/YEPX2S6IPSEMWTZOZO7OTLTQ5P/graph.json","events_json":"https://pith.science/api/pith-number/YEPX2S6IPSEMWTZOZO7OTLTQ5P/events.json","paper":"https://pith.science/paper/YEPX2S6I"},"agent_actions":{"view_html":"https://pith.science/pith/YEPX2S6IPSEMWTZOZO7OTLTQ5P","download_json":"https://pith.science/pith/YEPX2S6IPSEMWTZOZO7OTLTQ5P.json","view_paper":"https://pith.science/paper/YEPX2S6I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.20428&json=true","fetch_graph":"https://pith.science/api/pith-number/YEPX2S6IPSEMWTZOZO7OTLTQ5P/graph.json","fetch_events":"https://pith.science/api/pith-number/YEPX2S6IPSEMWTZOZO7OTLTQ5P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YEPX2S6IPSEMWTZOZO7OTLTQ5P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YEPX2S6IPSEMWTZOZO7OTLTQ5P/action/storage_attestation","attest_author":"https://pith.science/pith/YEPX2S6IPSEMWTZOZO7OTLTQ5P/action/author_attestation","sign_citation":"https://pith.science/pith/YEPX2S6IPSEMWTZOZO7OTLTQ5P/action/citation_signature","submit_replication":"https://pith.science/pith/YEPX2S6IPSEMWTZOZO7OTLTQ5P/action/replication_record"}},"created_at":"2026-06-12T01:09:27.999766+00:00","updated_at":"2026-06-12T01:09:27.999766+00:00"}