{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:42Z4SBSHZJSV652MLUFOP2BW5N","short_pith_number":"pith:42Z4SBSH","canonical_record":{"source":{"id":"1903.03697","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-08T23:26:46Z","cross_cats_sorted":["cs.DS","cs.RO"],"title_canon_sha256":"cc9c9e1cacde3fdfcfc429d4095162d8ef52faff31e6a04cff10cbae38391a0e","abstract_canon_sha256":"e7581f9a19440f338153122f473be0e3e3b9f4ed0cae088e8a198fd01d42d7d0"},"schema_version":"1.0"},"canonical_sha256":"e6b3c90647ca655f774c5d0ae7e836eb5307c7fb75f3e9156b5639a5ac2040d1","source":{"kind":"arxiv","id":"1903.03697","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.03697","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"arxiv_version","alias_value":"1903.03697v1","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03697","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"pith_short_12","alias_value":"42Z4SBSHZJSV","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"42Z4SBSHZJSV652M","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"42Z4SBSH","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:42Z4SBSHZJSV652MLUFOP2BW5N","target":"record","payload":{"canonical_record":{"source":{"id":"1903.03697","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-08T23:26:46Z","cross_cats_sorted":["cs.DS","cs.RO"],"title_canon_sha256":"cc9c9e1cacde3fdfcfc429d4095162d8ef52faff31e6a04cff10cbae38391a0e","abstract_canon_sha256":"e7581f9a19440f338153122f473be0e3e3b9f4ed0cae088e8a198fd01d42d7d0"},"schema_version":"1.0"},"canonical_sha256":"e6b3c90647ca655f774c5d0ae7e836eb5307c7fb75f3e9156b5639a5ac2040d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:41.232065Z","signature_b64":"EL9q73tC1HHd12px0Jz8Q6i3Gd90SR/LJFiygPR4dh3r5EOw5wCAICOoVNtcE9vIBeqanlUohaj2ecSDdGZfDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6b3c90647ca655f774c5d0ae7e836eb5307c7fb75f3e9156b5639a5ac2040d1","last_reissued_at":"2026-05-17T23:51:41.231454Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:41.231454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.03697","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-17T23:51:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Ejl3KKW3SnakBsLTXGdv8qhmZdjwjqD9n3ejvova3X+BhXOyiOrm23g4m7NOwy3YhDBxkD8kPzqqEec0CgpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:28:25.992052Z"},"content_sha256":"ca036fd1f6f8c2f37039090ebef222e3170a4799a65fbcb90423b5b887f04f18","schema_version":"1.0","event_id":"sha256:ca036fd1f6f8c2f37039090ebef222e3170a4799a65fbcb90423b5b887f04f18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:42Z4SBSHZJSV652MLUFOP2BW5N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable and Congestion-aware Routing for Autonomous Mobility-on-Demand via Frank-Wolfe Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.RO"],"primary_cat":"math.OC","authors_text":"Kiril Solovey, Marco Pavone, Mauro Salazar","submitted_at":"2019-03-08T23:26:46Z","abstract_excerpt":"We consider the problem of vehicle routing for Autonomous Mobility-on-Demand (AMoD) systems, wherein a fleet of self-driving vehicles provides on-demand mobility in a given environment. Specifically, the task it to compute routes for the vehicles (both customer-carrying and empty travelling) so that travel demand is fulfilled and operational cost is minimized. The routing process must account for congestion effects affecting travel times, as modeled via a volume-delay function (VDF). Route planning with VDF constraints is notoriously challenging, as such constraints compound the combinatorial "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03697","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-17T23:51:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vyRygc0+9+K7arzSKqftCEGBSjHi2Q7/GcLysHbaBm24CpuberaktJ0KICSLFHluHOifL1Xj6OJJolr8pGuHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:28:25.992417Z"},"content_sha256":"4d820884094b45b1eb2edda410c6af6464923fd831aa3e53a1cfa5f1528a0b38","schema_version":"1.0","event_id":"sha256:4d820884094b45b1eb2edda410c6af6464923fd831aa3e53a1cfa5f1528a0b38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/42Z4SBSHZJSV652MLUFOP2BW5N/bundle.json","state_url":"https://pith.science/pith/42Z4SBSHZJSV652MLUFOP2BW5N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/42Z4SBSHZJSV652MLUFOP2BW5N/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-01T08:28:25Z","links":{"resolver":"https://pith.science/pith/42Z4SBSHZJSV652MLUFOP2BW5N","bundle":"https://pith.science/pith/42Z4SBSHZJSV652MLUFOP2BW5N/bundle.json","state":"https://pith.science/pith/42Z4SBSHZJSV652MLUFOP2BW5N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/42Z4SBSHZJSV652MLUFOP2BW5N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:42Z4SBSHZJSV652MLUFOP2BW5N","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":"e7581f9a19440f338153122f473be0e3e3b9f4ed0cae088e8a198fd01d42d7d0","cross_cats_sorted":["cs.DS","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-08T23:26:46Z","title_canon_sha256":"cc9c9e1cacde3fdfcfc429d4095162d8ef52faff31e6a04cff10cbae38391a0e"},"schema_version":"1.0","source":{"id":"1903.03697","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.03697","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"arxiv_version","alias_value":"1903.03697v1","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03697","created_at":"2026-05-17T23:51:41Z"},{"alias_kind":"pith_short_12","alias_value":"42Z4SBSHZJSV","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"42Z4SBSHZJSV652M","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"42Z4SBSH","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:4d820884094b45b1eb2edda410c6af6464923fd831aa3e53a1cfa5f1528a0b38","target":"graph","created_at":"2026-05-17T23:51:41Z","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":"We consider the problem of vehicle routing for Autonomous Mobility-on-Demand (AMoD) systems, wherein a fleet of self-driving vehicles provides on-demand mobility in a given environment. Specifically, the task it to compute routes for the vehicles (both customer-carrying and empty travelling) so that travel demand is fulfilled and operational cost is minimized. The routing process must account for congestion effects affecting travel times, as modeled via a volume-delay function (VDF). Route planning with VDF constraints is notoriously challenging, as such constraints compound the combinatorial ","authors_text":"Kiril Solovey, Marco Pavone, Mauro Salazar","cross_cats":["cs.DS","cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-08T23:26:46Z","title":"Scalable and Congestion-aware Routing for Autonomous Mobility-on-Demand via Frank-Wolfe Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03697","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:ca036fd1f6f8c2f37039090ebef222e3170a4799a65fbcb90423b5b887f04f18","target":"record","created_at":"2026-05-17T23:51:41Z","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":"e7581f9a19440f338153122f473be0e3e3b9f4ed0cae088e8a198fd01d42d7d0","cross_cats_sorted":["cs.DS","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-08T23:26:46Z","title_canon_sha256":"cc9c9e1cacde3fdfcfc429d4095162d8ef52faff31e6a04cff10cbae38391a0e"},"schema_version":"1.0","source":{"id":"1903.03697","kind":"arxiv","version":1}},"canonical_sha256":"e6b3c90647ca655f774c5d0ae7e836eb5307c7fb75f3e9156b5639a5ac2040d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6b3c90647ca655f774c5d0ae7e836eb5307c7fb75f3e9156b5639a5ac2040d1","first_computed_at":"2026-05-17T23:51:41.231454Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:41.231454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EL9q73tC1HHd12px0Jz8Q6i3Gd90SR/LJFiygPR4dh3r5EOw5wCAICOoVNtcE9vIBeqanlUohaj2ecSDdGZfDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:41.232065Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.03697","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca036fd1f6f8c2f37039090ebef222e3170a4799a65fbcb90423b5b887f04f18","sha256:4d820884094b45b1eb2edda410c6af6464923fd831aa3e53a1cfa5f1528a0b38"],"state_sha256":"411dcd24721b8315ce1d8958872d849832528923bdd114fa4ed35ee9320cd2ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AG2l6By0qxQ3XBTT+4fUuOTuCL5NKVaNOW7nsgfA/L3p10h00aC3r3f0y6ePwvHZq2ZyJsQwOm2FpYI14KeJCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T08:28:25.994414Z","bundle_sha256":"d2989983ef176b7b4ebeffa3be08ae2e1e6c8cf1c6cf425cf17e2b1f36583222"}}