{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YEPX2S6IPSEMWTZOZO7OTLTQ5P","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7d2dcb7e8650e50e7899e8e5535ad35d666247726a64f57065b99a34c139cd08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-04-22T10:49:09Z","title_canon_sha256":"0f4f898460616a72e643c3ace5acf619c33e01c3d2fde6bce96f114c0175fd6d"},"schema_version":"1.0","source":{"id":"2604.20428","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.20428","created_at":"2026-06-12T01:09:27Z"},{"alias_kind":"arxiv_version","alias_value":"2604.20428v2","created_at":"2026-06-12T01:09:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.20428","created_at":"2026-06-12T01:09:27Z"},{"alias_kind":"pith_short_12","alias_value":"YEPX2S6IPSEM","created_at":"2026-06-12T01:09:27Z"},{"alias_kind":"pith_short_16","alias_value":"YEPX2S6IPSEMWTZO","created_at":"2026-06-12T01:09:27Z"},{"alias_kind":"pith_short_8","alias_value":"YEPX2S6I","created_at":"2026-06-12T01:09:27Z"}],"graph_snapshots":[{"event_id":"sha256:53011aa4bb42a359b99f767f44b2a447be13c72982e94cb876676bfbd362b6c5","target":"graph","created_at":"2026-06-12T01:09:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Transforms lexicographic minimum-violation STL motion planning into scalar optimization using non-uniform quantization and bit-shifting for efficient MPPI solving."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Non-uniform quantization and bit-shifting turn lexicographic STL optimization into a single scalar problem."}],"snapshot_sha256":"c5813cc84b7433e6fb4284c69a56876788061a131906ad824714f6cac715734e"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"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"}],"endpoint":"/pith/2604.20428/integrity.json","findings":[],"snapshot_sha256":"80e6ec1bfbce27690517b8256d7e1f9428f4289046c6b06e996e37e242d71a56","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Hannes Homburger, Johannes Reuter, Lothar Kiltz, Matthias Althoff, Patrick Halder","cross_cats":[],"headline":"Non-uniform quantization and bit-shifting turn lexicographic STL optimization into a single scalar problem.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-04-22T10:49:09Z","title":"Lexicographic Minimum-Violation Motion Planning using Signal Temporal Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.20428","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T00:08:03.841540Z","id":"cfe6307a-3731-453d-b958-adf186a7efd2","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"Non-uniform quantization and bit-shifting turn lexicographic STL optimization into a single scalar problem.","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.","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."}},"verdict_id":"cfe6307a-3731-453d-b958-adf186a7efd2"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ba74f9931eca80bf927b00457b6d23c8639d4b2283dc07bf624ee61e6f408605","target":"record","created_at":"2026-06-12T01:09:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7d2dcb7e8650e50e7899e8e5535ad35d666247726a64f57065b99a34c139cd08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-04-22T10:49:09Z","title_canon_sha256":"0f4f898460616a72e643c3ace5acf619c33e01c3d2fde6bce96f114c0175fd6d"},"schema_version":"1.0","source":{"id":"2604.20428","kind":"arxiv","version":2}},"canonical_sha256":"c11f7d4bc87c88cb4f2ecbbee9ae70ebd296b2af95fa990aa1d87babcc57c112","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c11f7d4bc87c88cb4f2ecbbee9ae70ebd296b2af95fa990aa1d87babcc57c112","first_computed_at":"2026-06-12T01:09:27.999700Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-12T01:09:27.999700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RawF4juh837uJKNN15KSSBAPSTPIH77X415sDL8DFXbYGnu/+jsBieyeFw69KbaHQpoSiQpCgFyaX/MsQqKFCQ==","signature_status":"signed_v1","signed_at":"2026-06-12T01:09:28.000113Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.20428","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba74f9931eca80bf927b00457b6d23c8639d4b2283dc07bf624ee61e6f408605","sha256:53011aa4bb42a359b99f767f44b2a447be13c72982e94cb876676bfbd362b6c5"],"state_sha256":"1412526a3c77fc1cf75fbc2ebc00fc1d1859d514d7035baa8c205cfe560e5240"}