{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OBFKLDRBBP3PFGBHGYIMHKXWRM","short_pith_number":"pith:OBFKLDRB","canonical_record":{"source":{"id":"1712.01184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-12-04T16:44:14Z","cross_cats_sorted":[],"title_canon_sha256":"e99e0cbdd602230dfd5506bde970315d9fc60477dcf8201c8983bde5828ee464","abstract_canon_sha256":"a57dc9754bb9fe20802df04a4d9ce3cad891e2b19b10615b1d7eac4ff01b64cc"},"schema_version":"1.0"},"canonical_sha256":"704aa58e210bf6f298273610c3aaf68b226e9fcf43edd8a72f06d07937ca614d","source":{"kind":"arxiv","id":"1712.01184","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01184","created_at":"2026-05-18T00:28:57Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01184v1","created_at":"2026-05-18T00:28:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01184","created_at":"2026-05-18T00:28:57Z"},{"alias_kind":"pith_short_12","alias_value":"OBFKLDRBBP3P","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OBFKLDRBBP3PFGBH","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OBFKLDRB","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OBFKLDRBBP3PFGBHGYIMHKXWRM","target":"record","payload":{"canonical_record":{"source":{"id":"1712.01184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-12-04T16:44:14Z","cross_cats_sorted":[],"title_canon_sha256":"e99e0cbdd602230dfd5506bde970315d9fc60477dcf8201c8983bde5828ee464","abstract_canon_sha256":"a57dc9754bb9fe20802df04a4d9ce3cad891e2b19b10615b1d7eac4ff01b64cc"},"schema_version":"1.0"},"canonical_sha256":"704aa58e210bf6f298273610c3aaf68b226e9fcf43edd8a72f06d07937ca614d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:57.706589Z","signature_b64":"d9txSjFIBDxd5i09m1xa0M/Pjj4dlOj1BdJYE1vzpqJWDvYIZl6d7GUzFegcWmas2mtN/zChsY/LiNcwbh2pCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"704aa58e210bf6f298273610c3aaf68b226e9fcf43edd8a72f06d07937ca614d","last_reissued_at":"2026-05-18T00:28:57.706165Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:57.706165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.01184","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:28:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O57tA3flqk3mq5KFFKL24t7JTE/ACd90fXvaZ8P2BJczBQtNspFG86+/zIaDSVLSqI2ruUeaKK2HRKy8dejQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:45:58.374286Z"},"content_sha256":"a183958a5c1f8338b7f6fabfa18a7e8f8afa6555d661b48f71750511d07fab6b","schema_version":"1.0","event_id":"sha256:a183958a5c1f8338b7f6fabfa18a7e8f8afa6555d661b48f71750511d07fab6b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OBFKLDRBBP3PFGBHGYIMHKXWRM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Path Planning using Positive Invariant Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Avishai Weiss, Claus Danielson, Karl Berntorp, Stefano Di Cairano","submitted_at":"2017-12-04T16:44:14Z","abstract_excerpt":"We present an algorithm for steering the output of a linear system from a feasible initial condition to a desired target position, while satisfying input constraints and non-convex output constraints. The system input is generated by a collection of local linear state-feedback controllers. The path-planning algorithm selects the appropriate local controller using a graph search, where the nodes of the graph are the local controllers and the edges of the graph indicate when it is possible to transition from one local controller to another without violating input or output constraints. We presen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01184","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:28:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AkIsRUux85xjGZACsXnGLzA6mqjX+f/6qFF6V5KV2vKlA8lCaqfdDLx7fViN4YiPto0td9NkZH3ZuY/DsnMMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:45:58.374647Z"},"content_sha256":"ee4a81fdebd62a7eccf9cd6669ec35e1131c433ae02ea41bf261892f8361140f","schema_version":"1.0","event_id":"sha256:ee4a81fdebd62a7eccf9cd6669ec35e1131c433ae02ea41bf261892f8361140f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OBFKLDRBBP3PFGBHGYIMHKXWRM/bundle.json","state_url":"https://pith.science/pith/OBFKLDRBBP3PFGBHGYIMHKXWRM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OBFKLDRBBP3PFGBHGYIMHKXWRM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-29T15:45:58Z","links":{"resolver":"https://pith.science/pith/OBFKLDRBBP3PFGBHGYIMHKXWRM","bundle":"https://pith.science/pith/OBFKLDRBBP3PFGBHGYIMHKXWRM/bundle.json","state":"https://pith.science/pith/OBFKLDRBBP3PFGBHGYIMHKXWRM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OBFKLDRBBP3PFGBHGYIMHKXWRM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OBFKLDRBBP3PFGBHGYIMHKXWRM","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":"a57dc9754bb9fe20802df04a4d9ce3cad891e2b19b10615b1d7eac4ff01b64cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-12-04T16:44:14Z","title_canon_sha256":"e99e0cbdd602230dfd5506bde970315d9fc60477dcf8201c8983bde5828ee464"},"schema_version":"1.0","source":{"id":"1712.01184","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01184","created_at":"2026-05-18T00:28:57Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01184v1","created_at":"2026-05-18T00:28:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01184","created_at":"2026-05-18T00:28:57Z"},{"alias_kind":"pith_short_12","alias_value":"OBFKLDRBBP3P","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OBFKLDRBBP3PFGBH","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OBFKLDRB","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:ee4a81fdebd62a7eccf9cd6669ec35e1131c433ae02ea41bf261892f8361140f","target":"graph","created_at":"2026-05-18T00:28:57Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We present an algorithm for steering the output of a linear system from a feasible initial condition to a desired target position, while satisfying input constraints and non-convex output constraints. The system input is generated by a collection of local linear state-feedback controllers. The path-planning algorithm selects the appropriate local controller using a graph search, where the nodes of the graph are the local controllers and the edges of the graph indicate when it is possible to transition from one local controller to another without violating input or output constraints. We presen","authors_text":"Avishai Weiss, Claus Danielson, Karl Berntorp, Stefano Di Cairano","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-12-04T16:44:14Z","title":"Path Planning using Positive Invariant Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01184","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a183958a5c1f8338b7f6fabfa18a7e8f8afa6555d661b48f71750511d07fab6b","target":"record","created_at":"2026-05-18T00:28:57Z","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":"a57dc9754bb9fe20802df04a4d9ce3cad891e2b19b10615b1d7eac4ff01b64cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-12-04T16:44:14Z","title_canon_sha256":"e99e0cbdd602230dfd5506bde970315d9fc60477dcf8201c8983bde5828ee464"},"schema_version":"1.0","source":{"id":"1712.01184","kind":"arxiv","version":1}},"canonical_sha256":"704aa58e210bf6f298273610c3aaf68b226e9fcf43edd8a72f06d07937ca614d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"704aa58e210bf6f298273610c3aaf68b226e9fcf43edd8a72f06d07937ca614d","first_computed_at":"2026-05-18T00:28:57.706165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:57.706165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d9txSjFIBDxd5i09m1xa0M/Pjj4dlOj1BdJYE1vzpqJWDvYIZl6d7GUzFegcWmas2mtN/zChsY/LiNcwbh2pCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:57.706589Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.01184","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a183958a5c1f8338b7f6fabfa18a7e8f8afa6555d661b48f71750511d07fab6b","sha256:ee4a81fdebd62a7eccf9cd6669ec35e1131c433ae02ea41bf261892f8361140f"],"state_sha256":"ae09e6d54fc1aaffc4ef73793da9cb0a5bdd1abd84e99acf94efa64e42b9a354"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DjLbsJs4oL3a/iDVi34IlEo03cAPQjc6Qp4+bt9oxnpELdg2OU6tClqaNhbMEDOf122hs7eqZieK2bkx9d8pCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:45:58.376602Z","bundle_sha256":"0bef55846f438434c45c45e3c39185aaf2421dc795655191e722a20938f393eb"}}