{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:ZTAOBW5UFOTWKPXK2VD6DOM4ME","short_pith_number":"pith:ZTAOBW5U","canonical_record":{"source":{"id":"2004.08025","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-04-17T01:50:18Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"e4e109878ff4e9ddb5393d85804c5412f338c97387019c1632cba13f1fa945f4","abstract_canon_sha256":"6cfaade0e67048b59e0dbe804e30820297a66af74582ebbf76709acc41ffbbaa"},"schema_version":"1.0"},"canonical_sha256":"ccc0e0dbb42ba7653eead547e1b99c611acefcd6167c07a7c09f857286a1b265","source":{"kind":"arxiv","id":"2004.08025","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.08025","created_at":"2026-07-05T03:09:55Z"},{"alias_kind":"arxiv_version","alias_value":"2004.08025v2","created_at":"2026-07-05T03:09:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.08025","created_at":"2026-07-05T03:09:55Z"},{"alias_kind":"pith_short_12","alias_value":"ZTAOBW5UFOTW","created_at":"2026-07-05T03:09:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZTAOBW5UFOTWKPXK","created_at":"2026-07-05T03:09:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZTAOBW5U","created_at":"2026-07-05T03:09:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:ZTAOBW5UFOTWKPXK2VD6DOM4ME","target":"record","payload":{"canonical_record":{"source":{"id":"2004.08025","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-04-17T01:50:18Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"e4e109878ff4e9ddb5393d85804c5412f338c97387019c1632cba13f1fa945f4","abstract_canon_sha256":"6cfaade0e67048b59e0dbe804e30820297a66af74582ebbf76709acc41ffbbaa"},"schema_version":"1.0"},"canonical_sha256":"ccc0e0dbb42ba7653eead547e1b99c611acefcd6167c07a7c09f857286a1b265","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:09:55.374064Z","signature_b64":"PjDXKRrY36WlBmINYCPRrfbsyBMjxd6plYZjDveiobOkdq9CZMbUrB3qxSUqQwsfxcF9mqaAciWfcuV/mMkmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccc0e0dbb42ba7653eead547e1b99c611acefcd6167c07a7c09f857286a1b265","last_reissued_at":"2026-07-05T03:09:55.373639Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:09:55.373639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2004.08025","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-07-05T03:09:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iOyS4UsAm1Zxj+U2SSuloGn+zNgdlKrfrpRC1e84EYb7a3I+/NP30lCR6s5VQ0W5TcfNk9tPyM4lXDNDDEnPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-21T04:02:18.251737Z"},"content_sha256":"0fdb3b658970cd8e7c58f3b9bb23a0b462d58ae6be962c9d3ed2c5025d5c6189","schema_version":"1.0","event_id":"sha256:0fdb3b658970cd8e7c58f3b9bb23a0b462d58ae6be962c9d3ed2c5025d5c6189"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:ZTAOBW5UFOTWKPXK2VD6DOM4ME","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"STT-CBS: A Conflict-Based Search Algorithm for Multi-Agent Path Finding with Stochastic Travel Times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Kyle Brown, Mac Schwager, Martin Sehr, Mykel J. Kochenderfer, Oriana Peltzer","submitted_at":"2020-04-17T01:50:18Z","abstract_excerpt":"We present an algorithm for finding optimal paths for multiple stochastic agents in a graph to reach their destinations with a user-specified maximum pairwise collision probability. Our algorithm, called STT-CBS, uses Conflict-Based Search (CBS) with a stochastic travel time (STT) model for the agents. We model robot travel time along each edge of the graph by independent gamma-distributed random variables, and propose probabilistic collision identification and constraint creation methods to robustly handle travel time uncertainty. We show that under reasonable assumptions our algorithm is opt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.08025","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2004.08025/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-05T03:09:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gXg7A5qwNqbyLZic6KStH8+eLNd8V4ekL87+ZHPGBRtOX8e2Qy80mRY0/RUqCPl09eD89K27NDTJWt9EuanRDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-21T04:02:18.252111Z"},"content_sha256":"0424e96ad3a473381ff9d1846a55ddbc1952199516c7d41478acf2ecd8a4f220","schema_version":"1.0","event_id":"sha256:0424e96ad3a473381ff9d1846a55ddbc1952199516c7d41478acf2ecd8a4f220"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTAOBW5UFOTWKPXK2VD6DOM4ME/bundle.json","state_url":"https://pith.science/pith/ZTAOBW5UFOTWKPXK2VD6DOM4ME/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTAOBW5UFOTWKPXK2VD6DOM4ME/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-07-21T04:02:18Z","links":{"resolver":"https://pith.science/pith/ZTAOBW5UFOTWKPXK2VD6DOM4ME","bundle":"https://pith.science/pith/ZTAOBW5UFOTWKPXK2VD6DOM4ME/bundle.json","state":"https://pith.science/pith/ZTAOBW5UFOTWKPXK2VD6DOM4ME/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTAOBW5UFOTWKPXK2VD6DOM4ME/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:ZTAOBW5UFOTWKPXK2VD6DOM4ME","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":"6cfaade0e67048b59e0dbe804e30820297a66af74582ebbf76709acc41ffbbaa","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-04-17T01:50:18Z","title_canon_sha256":"e4e109878ff4e9ddb5393d85804c5412f338c97387019c1632cba13f1fa945f4"},"schema_version":"1.0","source":{"id":"2004.08025","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.08025","created_at":"2026-07-05T03:09:55Z"},{"alias_kind":"arxiv_version","alias_value":"2004.08025v2","created_at":"2026-07-05T03:09:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.08025","created_at":"2026-07-05T03:09:55Z"},{"alias_kind":"pith_short_12","alias_value":"ZTAOBW5UFOTW","created_at":"2026-07-05T03:09:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZTAOBW5UFOTWKPXK","created_at":"2026-07-05T03:09:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZTAOBW5U","created_at":"2026-07-05T03:09:55Z"}],"graph_snapshots":[{"event_id":"sha256:0424e96ad3a473381ff9d1846a55ddbc1952199516c7d41478acf2ecd8a4f220","target":"graph","created_at":"2026-07-05T03:09:55Z","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/2004.08025/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present an algorithm for finding optimal paths for multiple stochastic agents in a graph to reach their destinations with a user-specified maximum pairwise collision probability. Our algorithm, called STT-CBS, uses Conflict-Based Search (CBS) with a stochastic travel time (STT) model for the agents. We model robot travel time along each edge of the graph by independent gamma-distributed random variables, and propose probabilistic collision identification and constraint creation methods to robustly handle travel time uncertainty. We show that under reasonable assumptions our algorithm is opt","authors_text":"Kyle Brown, Mac Schwager, Martin Sehr, Mykel J. Kochenderfer, Oriana Peltzer","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-04-17T01:50:18Z","title":"STT-CBS: A Conflict-Based Search Algorithm for Multi-Agent Path Finding with Stochastic Travel Times"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.08025","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:0fdb3b658970cd8e7c58f3b9bb23a0b462d58ae6be962c9d3ed2c5025d5c6189","target":"record","created_at":"2026-07-05T03:09:55Z","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":"6cfaade0e67048b59e0dbe804e30820297a66af74582ebbf76709acc41ffbbaa","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-04-17T01:50:18Z","title_canon_sha256":"e4e109878ff4e9ddb5393d85804c5412f338c97387019c1632cba13f1fa945f4"},"schema_version":"1.0","source":{"id":"2004.08025","kind":"arxiv","version":2}},"canonical_sha256":"ccc0e0dbb42ba7653eead547e1b99c611acefcd6167c07a7c09f857286a1b265","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ccc0e0dbb42ba7653eead547e1b99c611acefcd6167c07a7c09f857286a1b265","first_computed_at":"2026-07-05T03:09:55.373639Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:09:55.373639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PjDXKRrY36WlBmINYCPRrfbsyBMjxd6plYZjDveiobOkdq9CZMbUrB3qxSUqQwsfxcF9mqaAciWfcuV/mMkmBw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:09:55.374064Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.08025","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fdb3b658970cd8e7c58f3b9bb23a0b462d58ae6be962c9d3ed2c5025d5c6189","sha256:0424e96ad3a473381ff9d1846a55ddbc1952199516c7d41478acf2ecd8a4f220"],"state_sha256":"fb8cdc56d183d49ffd5f7376194d0d2bea0858249e564d844bb12fc2e7a3338b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vLZ+dlDrge5z4PCzQz7jeLH5+UYP9Um4/CcOJjK4Zl17t4DvC6sLOBDBlEt8YY6GiArseTW8eDHDSZle4N61Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-21T04:02:18.254272Z","bundle_sha256":"838e5725b8de310e732532f132c321776e7c2558cb4524149472a7af725a6f11"}}