{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RYM56HFQLHC3OTAPAECMFDPRTP","short_pith_number":"pith:RYM56HFQ","canonical_record":{"source":{"id":"1511.01166","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2015-11-04T00:26:32Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"7175bae46bab812fe9dfd040fe88741fe36d50a328ce8716bd66cb511124d871","abstract_canon_sha256":"0393b044cf816c5b838265f93d74d5a6edb9daf5bf23caedcf05d86e1b95ddf4"},"schema_version":"1.0"},"canonical_sha256":"8e19df1cb059c5b74c0f0104c28df19bf1c21373a3d1daca1bde119d99921dc2","source":{"kind":"arxiv","id":"1511.01166","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01166","created_at":"2026-05-18T00:53:12Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01166v2","created_at":"2026-05-18T00:53:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01166","created_at":"2026-05-18T00:53:12Z"},{"alias_kind":"pith_short_12","alias_value":"RYM56HFQLHC3","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RYM56HFQLHC3OTAP","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RYM56HFQ","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RYM56HFQLHC3OTAPAECMFDPRTP","target":"record","payload":{"canonical_record":{"source":{"id":"1511.01166","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2015-11-04T00:26:32Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"7175bae46bab812fe9dfd040fe88741fe36d50a328ce8716bd66cb511124d871","abstract_canon_sha256":"0393b044cf816c5b838265f93d74d5a6edb9daf5bf23caedcf05d86e1b95ddf4"},"schema_version":"1.0"},"canonical_sha256":"8e19df1cb059c5b74c0f0104c28df19bf1c21373a3d1daca1bde119d99921dc2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:12.504389Z","signature_b64":"xR6yyyQQNVoA5dHbWuEGYD+HbnaJlYLB/sidU73yMjgr86BgfGfGyQq2aXdd8rIy3xQ75+ppPoYBoTvaxOotCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e19df1cb059c5b74c0f0104c28df19bf1c21373a3d1daca1bde119d99921dc2","last_reissued_at":"2026-05-18T00:53:12.503980Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:12.503980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.01166","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-18T00:53:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VVFNb54d+pla8jTTs4w5Y/3o0TrfZU85pUqWF9pSaF2kD8ETFBv0m+UFVWiKXGXJZJrcqDHKiQ5sPN70Ex8NDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:38:13.927644Z"},"content_sha256":"c9118e094eca8b9f15e6db0ec820f9ca04a507239c9d9a5335ac3e07ead30301","schema_version":"1.0","event_id":"sha256:c9118e094eca8b9f15e6db0ec820f9ca04a507239c9d9a5335ac3e07ead30301"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RYM56HFQLHC3OTAPAECMFDPRTP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A bi-criteria path planning algorithm for robotics applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.RO","authors_text":"Alexander Vladimirsky, Brendan Englot, Thomas A. Frewen, William M. Sisson, Xuchu Ding, Zachary Clawson","submitted_at":"2015-11-04T00:26:32Z","abstract_excerpt":"Realistic path planning applications often require optimizing with respect to several criteria simultaneously. Here we introduce an efficient algorithm for bi-criteria path planning on graphs. Our approach is based on augmenting the state space to keep track of the \"budget\" remaining to satisfy the constraints on secondary cost. The resulting augmented graph is acyclic and the primary cost can be then minimized by a simple upward sweep through budget levels. The efficiency and accuracy of our algorithm is tested on Probabilistic Roadmap graphs to minimize the distance of travel subject to a co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01166","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-18T00:53:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uPDWvmVIR1V00lu5XB4hBKHjwG+yq15K7YNdt4kT5O9IPj32w6ZPvCveDLbQd7JF/MiOZs/4ZoxkUEAb3leaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:38:13.928071Z"},"content_sha256":"a9b9c31ad3c72d7295f87f720cc73daa1a0a33f722735b6b560dc199b547887d","schema_version":"1.0","event_id":"sha256:a9b9c31ad3c72d7295f87f720cc73daa1a0a33f722735b6b560dc199b547887d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RYM56HFQLHC3OTAPAECMFDPRTP/bundle.json","state_url":"https://pith.science/pith/RYM56HFQLHC3OTAPAECMFDPRTP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RYM56HFQLHC3OTAPAECMFDPRTP/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-27T22:38:13Z","links":{"resolver":"https://pith.science/pith/RYM56HFQLHC3OTAPAECMFDPRTP","bundle":"https://pith.science/pith/RYM56HFQLHC3OTAPAECMFDPRTP/bundle.json","state":"https://pith.science/pith/RYM56HFQLHC3OTAPAECMFDPRTP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RYM56HFQLHC3OTAPAECMFDPRTP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RYM56HFQLHC3OTAPAECMFDPRTP","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":"0393b044cf816c5b838265f93d74d5a6edb9daf5bf23caedcf05d86e1b95ddf4","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2015-11-04T00:26:32Z","title_canon_sha256":"7175bae46bab812fe9dfd040fe88741fe36d50a328ce8716bd66cb511124d871"},"schema_version":"1.0","source":{"id":"1511.01166","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01166","created_at":"2026-05-18T00:53:12Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01166v2","created_at":"2026-05-18T00:53:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01166","created_at":"2026-05-18T00:53:12Z"},{"alias_kind":"pith_short_12","alias_value":"RYM56HFQLHC3","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RYM56HFQLHC3OTAP","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RYM56HFQ","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:a9b9c31ad3c72d7295f87f720cc73daa1a0a33f722735b6b560dc199b547887d","target":"graph","created_at":"2026-05-18T00:53:12Z","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":"Realistic path planning applications often require optimizing with respect to several criteria simultaneously. Here we introduce an efficient algorithm for bi-criteria path planning on graphs. Our approach is based on augmenting the state space to keep track of the \"budget\" remaining to satisfy the constraints on secondary cost. The resulting augmented graph is acyclic and the primary cost can be then minimized by a simple upward sweep through budget levels. The efficiency and accuracy of our algorithm is tested on Probabilistic Roadmap graphs to minimize the distance of travel subject to a co","authors_text":"Alexander Vladimirsky, Brendan Englot, Thomas A. Frewen, William M. Sisson, Xuchu Ding, Zachary Clawson","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2015-11-04T00:26:32Z","title":"A bi-criteria path planning algorithm for robotics applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01166","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:c9118e094eca8b9f15e6db0ec820f9ca04a507239c9d9a5335ac3e07ead30301","target":"record","created_at":"2026-05-18T00:53:12Z","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":"0393b044cf816c5b838265f93d74d5a6edb9daf5bf23caedcf05d86e1b95ddf4","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2015-11-04T00:26:32Z","title_canon_sha256":"7175bae46bab812fe9dfd040fe88741fe36d50a328ce8716bd66cb511124d871"},"schema_version":"1.0","source":{"id":"1511.01166","kind":"arxiv","version":2}},"canonical_sha256":"8e19df1cb059c5b74c0f0104c28df19bf1c21373a3d1daca1bde119d99921dc2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e19df1cb059c5b74c0f0104c28df19bf1c21373a3d1daca1bde119d99921dc2","first_computed_at":"2026-05-18T00:53:12.503980Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:12.503980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xR6yyyQQNVoA5dHbWuEGYD+HbnaJlYLB/sidU73yMjgr86BgfGfGyQq2aXdd8rIy3xQ75+ppPoYBoTvaxOotCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:12.504389Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.01166","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9118e094eca8b9f15e6db0ec820f9ca04a507239c9d9a5335ac3e07ead30301","sha256:a9b9c31ad3c72d7295f87f720cc73daa1a0a33f722735b6b560dc199b547887d"],"state_sha256":"9f35fda4a477f8ff028814bceb2bb8ed7184ccadb43d6b38099d76744b017639"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xkMexh8RCt9MU/Ixcy9NobYVIl7N79K+W9rLbHG4CONcoj+S+tFI94EeWQJaKukfQOTmwdtl4GGCIduT2b6aDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:38:13.930226Z","bundle_sha256":"604a81f90a6504d191e658a35d7eb93db5a0b6aec3e9ac20355e4ec06c392bf8"}}