{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RTX3QKO4BLFMJDXNGLIG4HD4SG","short_pith_number":"pith:RTX3QKO4","canonical_record":{"source":{"id":"1705.04222","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-05-11T14:54:17Z","cross_cats_sorted":[],"title_canon_sha256":"04201812886b4cc49ae859892fd6417f4371a4ae790633d9c7c69801ee005bed","abstract_canon_sha256":"ae729558be056cbaf5e252f0a6046406acff5de7e4261000012d7542649ec368"},"schema_version":"1.0"},"canonical_sha256":"8cefb829dc0acac48eed32d06e1c7c918193cec193c770ce727aec4d5dc2cb44","source":{"kind":"arxiv","id":"1705.04222","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04222","created_at":"2026-05-18T00:44:39Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04222v1","created_at":"2026-05-18T00:44:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04222","created_at":"2026-05-18T00:44:39Z"},{"alias_kind":"pith_short_12","alias_value":"RTX3QKO4BLFM","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RTX3QKO4BLFMJDXN","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RTX3QKO4","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RTX3QKO4BLFMJDXNGLIG4HD4SG","target":"record","payload":{"canonical_record":{"source":{"id":"1705.04222","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-05-11T14:54:17Z","cross_cats_sorted":[],"title_canon_sha256":"04201812886b4cc49ae859892fd6417f4371a4ae790633d9c7c69801ee005bed","abstract_canon_sha256":"ae729558be056cbaf5e252f0a6046406acff5de7e4261000012d7542649ec368"},"schema_version":"1.0"},"canonical_sha256":"8cefb829dc0acac48eed32d06e1c7c918193cec193c770ce727aec4d5dc2cb44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:39.434825Z","signature_b64":"tC8eEb4oLaO5LrV4JLOBtEPreSdvmDU/f4rCY9+GiP1VxqsaWKZ+TP2oP/Gq+5rKk1FXunW6RwXNgwRHPdtmCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cefb829dc0acac48eed32d06e1c7c918193cec193c770ce727aec4d5dc2cb44","last_reissued_at":"2026-05-18T00:44:39.434331Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:39.434331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.04222","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:44:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dpzIKdZaZVmBHwypxNkpVKNoh5F9BAmCyFoVvPqzI7CYlB8sjPW3VJYqWH9Hyiv/pNvs2ws0A6Ex3GNSuRuUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:29:47.934407Z"},"content_sha256":"8e56ea136283fcb2658c73657bd4cccbb0fa9df47366a4423fd210690e2bdafb","schema_version":"1.0","event_id":"sha256:8e56ea136283fcb2658c73657bd4cccbb0fa9df47366a4423fd210690e2bdafb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RTX3QKO4BLFMJDXNGLIG4HD4SG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Dynamic Programming Solution to a Platoon Coordination Merge Problem With Stochastic Travel Times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Dimos V. Dimarogonas, Karl H. Johansson, Sebastian van de Hoef","submitted_at":"2017-05-11T14:54:17Z","abstract_excerpt":"The problem of maximizing the probability of two trucks being coordinated to merge into a platoon on a highway is considered. Truck platooning is a promising technology that allows heavy vehicles to save fuel by driving with small automatically controlled inter-vehicle distances. In order to leverage the full potential of platooning, platoons can be formed dynamically en route by small adjustments to their speeds. However, in heavily used parts of the road network, travel times are subject to random disturbances originating from traffic, weather and other sources. We formulate this problem as "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04222","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:44:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/hKpXKaw0ZR6U9eqzklWQytFfdn5iTi5eKtScrKoLfaQMFM48hbdnYvk5qOtYT9V8zG3ZuNSnfYxp7TLfY4RBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:29:47.934764Z"},"content_sha256":"bd4221fbdba99a62c9727a740f0e8de069d5c9ac9dcbd92481f7987ae221e3ed","schema_version":"1.0","event_id":"sha256:bd4221fbdba99a62c9727a740f0e8de069d5c9ac9dcbd92481f7987ae221e3ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RTX3QKO4BLFMJDXNGLIG4HD4SG/bundle.json","state_url":"https://pith.science/pith/RTX3QKO4BLFMJDXNGLIG4HD4SG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RTX3QKO4BLFMJDXNGLIG4HD4SG/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-06-01T07:29:47Z","links":{"resolver":"https://pith.science/pith/RTX3QKO4BLFMJDXNGLIG4HD4SG","bundle":"https://pith.science/pith/RTX3QKO4BLFMJDXNGLIG4HD4SG/bundle.json","state":"https://pith.science/pith/RTX3QKO4BLFMJDXNGLIG4HD4SG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RTX3QKO4BLFMJDXNGLIG4HD4SG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RTX3QKO4BLFMJDXNGLIG4HD4SG","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":"ae729558be056cbaf5e252f0a6046406acff5de7e4261000012d7542649ec368","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-05-11T14:54:17Z","title_canon_sha256":"04201812886b4cc49ae859892fd6417f4371a4ae790633d9c7c69801ee005bed"},"schema_version":"1.0","source":{"id":"1705.04222","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04222","created_at":"2026-05-18T00:44:39Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04222v1","created_at":"2026-05-18T00:44:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04222","created_at":"2026-05-18T00:44:39Z"},{"alias_kind":"pith_short_12","alias_value":"RTX3QKO4BLFM","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RTX3QKO4BLFMJDXN","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RTX3QKO4","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:bd4221fbdba99a62c9727a740f0e8de069d5c9ac9dcbd92481f7987ae221e3ed","target":"graph","created_at":"2026-05-18T00:44:39Z","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":"The problem of maximizing the probability of two trucks being coordinated to merge into a platoon on a highway is considered. Truck platooning is a promising technology that allows heavy vehicles to save fuel by driving with small automatically controlled inter-vehicle distances. In order to leverage the full potential of platooning, platoons can be formed dynamically en route by small adjustments to their speeds. However, in heavily used parts of the road network, travel times are subject to random disturbances originating from traffic, weather and other sources. We formulate this problem as ","authors_text":"Dimos V. Dimarogonas, Karl H. Johansson, Sebastian van de Hoef","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-05-11T14:54:17Z","title":"Efficient Dynamic Programming Solution to a Platoon Coordination Merge Problem With Stochastic Travel Times"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04222","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:8e56ea136283fcb2658c73657bd4cccbb0fa9df47366a4423fd210690e2bdafb","target":"record","created_at":"2026-05-18T00:44:39Z","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":"ae729558be056cbaf5e252f0a6046406acff5de7e4261000012d7542649ec368","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-05-11T14:54:17Z","title_canon_sha256":"04201812886b4cc49ae859892fd6417f4371a4ae790633d9c7c69801ee005bed"},"schema_version":"1.0","source":{"id":"1705.04222","kind":"arxiv","version":1}},"canonical_sha256":"8cefb829dc0acac48eed32d06e1c7c918193cec193c770ce727aec4d5dc2cb44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8cefb829dc0acac48eed32d06e1c7c918193cec193c770ce727aec4d5dc2cb44","first_computed_at":"2026-05-18T00:44:39.434331Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:39.434331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tC8eEb4oLaO5LrV4JLOBtEPreSdvmDU/f4rCY9+GiP1VxqsaWKZ+TP2oP/Gq+5rKk1FXunW6RwXNgwRHPdtmCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:39.434825Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.04222","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e56ea136283fcb2658c73657bd4cccbb0fa9df47366a4423fd210690e2bdafb","sha256:bd4221fbdba99a62c9727a740f0e8de069d5c9ac9dcbd92481f7987ae221e3ed"],"state_sha256":"6c4dbaa1ab1a0a08eb82c4b8b5644d11084b01ee4cadc592abee732caaf1b63a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uQThLUOxHzhrs8fqKh+LUWE0teUsP5N9goIHcbe/Y4DLus/NFYAZdH0+n6YgBYldrjJN1tiMC9iy2LyKoaPaDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T07:29:47.936751Z","bundle_sha256":"0e3e4c28403c62b07f27875b07beb48e7f40e762f328eee9443d6c66438a81f7"}}