{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:YTPJ2CSOGBV6SBLWXL5U22UMJH","short_pith_number":"pith:YTPJ2CSO","canonical_record":{"source":{"id":"2109.12313","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-09-25T08:36:59Z","cross_cats_sorted":["cs.SY","eess.SY","math.OC"],"title_canon_sha256":"7135ea02ff2f19d9b3b059b32b86385d517ffdf227f4d2bee7a2f4ae027082c0","abstract_canon_sha256":"4651128cfb067660e12fb74b3678713d0073ad0f2e8273a50f62a7f42cddde5e"},"schema_version":"1.0"},"canonical_sha256":"c4de9d0a4e306be90576bafb4d6a8c49fc2dbbf0517246c32c1c2f9a1dfa520b","source":{"kind":"arxiv","id":"2109.12313","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.12313","created_at":"2026-07-05T04:27:29Z"},{"alias_kind":"arxiv_version","alias_value":"2109.12313v4","created_at":"2026-07-05T04:27:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.12313","created_at":"2026-07-05T04:27:29Z"},{"alias_kind":"pith_short_12","alias_value":"YTPJ2CSOGBV6","created_at":"2026-07-05T04:27:29Z"},{"alias_kind":"pith_short_16","alias_value":"YTPJ2CSOGBV6SBLW","created_at":"2026-07-05T04:27:29Z"},{"alias_kind":"pith_short_8","alias_value":"YTPJ2CSO","created_at":"2026-07-05T04:27:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:YTPJ2CSOGBV6SBLWXL5U22UMJH","target":"record","payload":{"canonical_record":{"source":{"id":"2109.12313","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-09-25T08:36:59Z","cross_cats_sorted":["cs.SY","eess.SY","math.OC"],"title_canon_sha256":"7135ea02ff2f19d9b3b059b32b86385d517ffdf227f4d2bee7a2f4ae027082c0","abstract_canon_sha256":"4651128cfb067660e12fb74b3678713d0073ad0f2e8273a50f62a7f42cddde5e"},"schema_version":"1.0"},"canonical_sha256":"c4de9d0a4e306be90576bafb4d6a8c49fc2dbbf0517246c32c1c2f9a1dfa520b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:27:29.066740Z","signature_b64":"Wu9epHE3XoX0nWXSfm0cCEqlsKOM8nHwGFzK85QSdS7ClZHVMjpqn2PkqRkxYqJk/FAWT5GOdLStSPIDbaenAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4de9d0a4e306be90576bafb4d6a8c49fc2dbbf0517246c32c1c2f9a1dfa520b","last_reissued_at":"2026-07-05T04:27:29.066263Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:27:29.066263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2109.12313","source_version":4,"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-07-05T04:27:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nm+3sqlT/iGyct+33B2g+PlmWWAvCirJy0mS6jJW+U1kKatgiMI/bs3hYgcNui7csKiJwiGKLkCjJQAH+3S8Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T18:34:53.181504Z"},"content_sha256":"0ee1400517d272ca61c25b55088ebeb7cc9472f243aff5215d8c6e76431bac78","schema_version":"1.0","event_id":"sha256:0ee1400517d272ca61c25b55088ebeb7cc9472f243aff5215d8c6e76431bac78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:YTPJ2CSOGBV6SBLWXL5U22UMJH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Safety-Critical Control and Planning for Obstacle Avoidance between Polytopes with Control Barrier Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY","math.OC"],"primary_cat":"cs.RO","authors_text":"Akshay Thirugnanam, Jun Zeng, Koushil Sreenath","submitted_at":"2021-09-25T08:36:59Z","abstract_excerpt":"Obstacle avoidance between polytopes is a challenging topic for optimal control and optimization-based trajectory planning problems. Existing work either solves this problem through mixed-integer optimization, relying on simplification of system dynamics, or through model predictive control with dual variables using distance constraints, requiring long horizons for obstacle avoidance. In either case, the solution can only be applied as an offline planning algorithm. In this paper, we exploit the property that a smaller horizon is sufficient for obstacle avoidance by using discrete-time control"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.12313","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.12313/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:27:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bv0BzmJfqis3TPE8tnv9wPFU3I2oivMpkrILA0qL7ka8CMYlociW16UhzNc8J8AKn6dkzfACIspAbiDqxxMJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T18:34:53.182340Z"},"content_sha256":"0cba7fbd4736955f755106fad385f29fc1d53bba4bcd236c3f773ec7dbba2711","schema_version":"1.0","event_id":"sha256:0cba7fbd4736955f755106fad385f29fc1d53bba4bcd236c3f773ec7dbba2711"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YTPJ2CSOGBV6SBLWXL5U22UMJH/bundle.json","state_url":"https://pith.science/pith/YTPJ2CSOGBV6SBLWXL5U22UMJH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YTPJ2CSOGBV6SBLWXL5U22UMJH/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-08-11T18:34:53Z","links":{"resolver":"https://pith.science/pith/YTPJ2CSOGBV6SBLWXL5U22UMJH","bundle":"https://pith.science/pith/YTPJ2CSOGBV6SBLWXL5U22UMJH/bundle.json","state":"https://pith.science/pith/YTPJ2CSOGBV6SBLWXL5U22UMJH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YTPJ2CSOGBV6SBLWXL5U22UMJH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:YTPJ2CSOGBV6SBLWXL5U22UMJH","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":"4651128cfb067660e12fb74b3678713d0073ad0f2e8273a50f62a7f42cddde5e","cross_cats_sorted":["cs.SY","eess.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-09-25T08:36:59Z","title_canon_sha256":"7135ea02ff2f19d9b3b059b32b86385d517ffdf227f4d2bee7a2f4ae027082c0"},"schema_version":"1.0","source":{"id":"2109.12313","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.12313","created_at":"2026-07-05T04:27:29Z"},{"alias_kind":"arxiv_version","alias_value":"2109.12313v4","created_at":"2026-07-05T04:27:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.12313","created_at":"2026-07-05T04:27:29Z"},{"alias_kind":"pith_short_12","alias_value":"YTPJ2CSOGBV6","created_at":"2026-07-05T04:27:29Z"},{"alias_kind":"pith_short_16","alias_value":"YTPJ2CSOGBV6SBLW","created_at":"2026-07-05T04:27:29Z"},{"alias_kind":"pith_short_8","alias_value":"YTPJ2CSO","created_at":"2026-07-05T04:27:29Z"}],"graph_snapshots":[{"event_id":"sha256:0cba7fbd4736955f755106fad385f29fc1d53bba4bcd236c3f773ec7dbba2711","target":"graph","created_at":"2026-07-05T04:27:29Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2109.12313/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Obstacle avoidance between polytopes is a challenging topic for optimal control and optimization-based trajectory planning problems. Existing work either solves this problem through mixed-integer optimization, relying on simplification of system dynamics, or through model predictive control with dual variables using distance constraints, requiring long horizons for obstacle avoidance. In either case, the solution can only be applied as an offline planning algorithm. In this paper, we exploit the property that a smaller horizon is sufficient for obstacle avoidance by using discrete-time control","authors_text":"Akshay Thirugnanam, Jun Zeng, Koushil Sreenath","cross_cats":["cs.SY","eess.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-09-25T08:36:59Z","title":"Safety-Critical Control and Planning for Obstacle Avoidance between Polytopes with Control Barrier Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.12313","kind":"arxiv","version":4},"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:0ee1400517d272ca61c25b55088ebeb7cc9472f243aff5215d8c6e76431bac78","target":"record","created_at":"2026-07-05T04:27:29Z","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":"4651128cfb067660e12fb74b3678713d0073ad0f2e8273a50f62a7f42cddde5e","cross_cats_sorted":["cs.SY","eess.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-09-25T08:36:59Z","title_canon_sha256":"7135ea02ff2f19d9b3b059b32b86385d517ffdf227f4d2bee7a2f4ae027082c0"},"schema_version":"1.0","source":{"id":"2109.12313","kind":"arxiv","version":4}},"canonical_sha256":"c4de9d0a4e306be90576bafb4d6a8c49fc2dbbf0517246c32c1c2f9a1dfa520b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4de9d0a4e306be90576bafb4d6a8c49fc2dbbf0517246c32c1c2f9a1dfa520b","first_computed_at":"2026-07-05T04:27:29.066263Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:27:29.066263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wu9epHE3XoX0nWXSfm0cCEqlsKOM8nHwGFzK85QSdS7ClZHVMjpqn2PkqRkxYqJk/FAWT5GOdLStSPIDbaenAg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:27:29.066740Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.12313","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ee1400517d272ca61c25b55088ebeb7cc9472f243aff5215d8c6e76431bac78","sha256:0cba7fbd4736955f755106fad385f29fc1d53bba4bcd236c3f773ec7dbba2711"],"state_sha256":"968652607a07ab0862aba2a1e313aedb7e4e2d007a8822e4b4edbd335205c4b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YSpIIpQBIL2wa3L01SlqidTtiN2hSd5GX1+Vvm23aQT+ZFdtqfcFqqm/ns2pvTm3NBEqUE+rya4TGUCfQCgoBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T18:34:53.187020Z","bundle_sha256":"1456040a119fd85b3ce58a78264575559e0053de80a6e995c3e5406c75e8bbea"}}