{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZVHJOPFHKB3DNYSCFG63WJ63DG","short_pith_number":"pith:ZVHJOPFH","canonical_record":{"source":{"id":"1305.1102","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-05-06T07:44:05Z","cross_cats_sorted":[],"title_canon_sha256":"a3ff3f216eaf9c9efd3961e5658eb1afb61eb3035a1d59f13f5504b6c824353c","abstract_canon_sha256":"0a0d9a5b5a5d8ae47fd65751542118096d3f6738fc20cd647e75763f205f86f5"},"schema_version":"1.0"},"canonical_sha256":"cd4e973ca7507636e24229bdbb27db19be74fc2098dd3971047c30594c90cd17","source":{"kind":"arxiv","id":"1305.1102","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1102","created_at":"2026-05-18T03:07:54Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1102v2","created_at":"2026-05-18T03:07:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1102","created_at":"2026-05-18T03:07:54Z"},{"alias_kind":"pith_short_12","alias_value":"ZVHJOPFHKB3D","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZVHJOPFHKB3DNYSC","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZVHJOPFH","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZVHJOPFHKB3DNYSCFG63WJ63DG","target":"record","payload":{"canonical_record":{"source":{"id":"1305.1102","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-05-06T07:44:05Z","cross_cats_sorted":[],"title_canon_sha256":"a3ff3f216eaf9c9efd3961e5658eb1afb61eb3035a1d59f13f5504b6c824353c","abstract_canon_sha256":"0a0d9a5b5a5d8ae47fd65751542118096d3f6738fc20cd647e75763f205f86f5"},"schema_version":"1.0"},"canonical_sha256":"cd4e973ca7507636e24229bdbb27db19be74fc2098dd3971047c30594c90cd17","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:54.703789Z","signature_b64":"E9h2z/ahZ0UgGMasTvNfHyzVqNoV8IXNRk8MNsp2gRkZDugqfrYa379OFbE9WfwC24ayACQrvba4iPAYxK6pAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd4e973ca7507636e24229bdbb27db19be74fc2098dd3971047c30594c90cd17","last_reissued_at":"2026-05-18T03:07:54.703288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:54.703288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.1102","source_version":2,"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-18T03:07:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K2Jb8i1HP0wVY8G5nA9RlF5joj9ChBEX4hLXK+i5J0eCI10pLGtDA9u3Zf31QoUFuGpep6wjcUJ/QFcKqTP2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:27:08.913846Z"},"content_sha256":"a9d174a8f2b9f8f1686c31eaceec92d4d94751d4ddd7f7673c1f23923f1c58cd","schema_version":"1.0","event_id":"sha256:a9d174a8f2b9f8f1686c31eaceec92d4d94751d4ddd7f7673c1f23923f1c58cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZVHJOPFHKB3DNYSCFG63WJ63DG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incremental Sampling-based Algorithm for Minimum-violation Motion Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Daniela Rus, Emilio Frazzoli, Jana Tumova, Luis I. Reyes Castro, Pratik Chaudhari, Sertac Karaman","submitted_at":"2013-05-06T07:44:05Z","abstract_excerpt":"This paper studies the problem of control strategy synthesis for dynamical systems with differential constraints to fulfill a given reachability goal while satisfying a set of safety rules. Particular attention is devoted to goals that become feasible only if a subset of the safety rules are violated. The proposed algorithm computes a control law, that minimizes the level of unsafety while the desired goal is guaranteed to be reached. This problem is motivated by an autonomous car navigating an urban environment while following rules of the road such as \"always travel in right lane'' and \"do n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1102","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"},"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-18T03:07:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NTC3nHX6V0fnfDgCWSmfEaZrzGqHkbnAZNMtMbjNr1l3mLWUHl9BU3XgzOiJ8dGoa248K+sg8vNn2yk4/kX1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:27:08.914243Z"},"content_sha256":"0995924d717cdc80c04b1b2212c46d86fb0847731be61a2c6639539922088691","schema_version":"1.0","event_id":"sha256:0995924d717cdc80c04b1b2212c46d86fb0847731be61a2c6639539922088691"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZVHJOPFHKB3DNYSCFG63WJ63DG/bundle.json","state_url":"https://pith.science/pith/ZVHJOPFHKB3DNYSCFG63WJ63DG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZVHJOPFHKB3DNYSCFG63WJ63DG/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-29T22:27:08Z","links":{"resolver":"https://pith.science/pith/ZVHJOPFHKB3DNYSCFG63WJ63DG","bundle":"https://pith.science/pith/ZVHJOPFHKB3DNYSCFG63WJ63DG/bundle.json","state":"https://pith.science/pith/ZVHJOPFHKB3DNYSCFG63WJ63DG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZVHJOPFHKB3DNYSCFG63WJ63DG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZVHJOPFHKB3DNYSCFG63WJ63DG","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":"0a0d9a5b5a5d8ae47fd65751542118096d3f6738fc20cd647e75763f205f86f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-05-06T07:44:05Z","title_canon_sha256":"a3ff3f216eaf9c9efd3961e5658eb1afb61eb3035a1d59f13f5504b6c824353c"},"schema_version":"1.0","source":{"id":"1305.1102","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1102","created_at":"2026-05-18T03:07:54Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1102v2","created_at":"2026-05-18T03:07:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1102","created_at":"2026-05-18T03:07:54Z"},{"alias_kind":"pith_short_12","alias_value":"ZVHJOPFHKB3D","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZVHJOPFHKB3DNYSC","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZVHJOPFH","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:0995924d717cdc80c04b1b2212c46d86fb0847731be61a2c6639539922088691","target":"graph","created_at":"2026-05-18T03:07:54Z","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":"This paper studies the problem of control strategy synthesis for dynamical systems with differential constraints to fulfill a given reachability goal while satisfying a set of safety rules. Particular attention is devoted to goals that become feasible only if a subset of the safety rules are violated. The proposed algorithm computes a control law, that minimizes the level of unsafety while the desired goal is guaranteed to be reached. This problem is motivated by an autonomous car navigating an urban environment while following rules of the road such as \"always travel in right lane'' and \"do n","authors_text":"Daniela Rus, Emilio Frazzoli, Jana Tumova, Luis I. Reyes Castro, Pratik Chaudhari, Sertac Karaman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-05-06T07:44:05Z","title":"Incremental Sampling-based Algorithm for Minimum-violation Motion Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1102","kind":"arxiv","version":2},"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:a9d174a8f2b9f8f1686c31eaceec92d4d94751d4ddd7f7673c1f23923f1c58cd","target":"record","created_at":"2026-05-18T03:07:54Z","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":"0a0d9a5b5a5d8ae47fd65751542118096d3f6738fc20cd647e75763f205f86f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-05-06T07:44:05Z","title_canon_sha256":"a3ff3f216eaf9c9efd3961e5658eb1afb61eb3035a1d59f13f5504b6c824353c"},"schema_version":"1.0","source":{"id":"1305.1102","kind":"arxiv","version":2}},"canonical_sha256":"cd4e973ca7507636e24229bdbb27db19be74fc2098dd3971047c30594c90cd17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd4e973ca7507636e24229bdbb27db19be74fc2098dd3971047c30594c90cd17","first_computed_at":"2026-05-18T03:07:54.703288Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:54.703288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E9h2z/ahZ0UgGMasTvNfHyzVqNoV8IXNRk8MNsp2gRkZDugqfrYa379OFbE9WfwC24ayACQrvba4iPAYxK6pAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:54.703789Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.1102","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9d174a8f2b9f8f1686c31eaceec92d4d94751d4ddd7f7673c1f23923f1c58cd","sha256:0995924d717cdc80c04b1b2212c46d86fb0847731be61a2c6639539922088691"],"state_sha256":"a112502e31bfc8b08f12fee31b9f9cf31203e395ec75c332d23fe77c54c34e04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GoA+3+hK4bELKvziO6e9GvvnMhJR4N8RKaekMC+X+jvAAtdcg6xe1CHW0NgSDvFBJdppcZC53Y5YdVpp7EQdBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T22:27:08.916882Z","bundle_sha256":"3a5623989f0b92280223e407435f3059370900c9696e4950a4c3c07df712f23e"}}