{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:MVRHBCOSQMULQF3VPMPR7WQE3S","short_pith_number":"pith:MVRHBCOS","canonical_record":{"source":{"id":"2008.12905","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-08-29T03:42:03Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"31a912b6d77b61c76b5351d78e96d654a3a3da9d99a0179cd20d16227d692f31","abstract_canon_sha256":"f9ee1c66b333c608c231819a51e91bf60fca5baad310cc99ec670133e58e778e"},"schema_version":"1.0"},"canonical_sha256":"65627089d28328b817757b1f1fda04dcaa0f12ac1a9e1effe4f6742a3426f70b","source":{"kind":"arxiv","id":"2008.12905","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.12905","created_at":"2026-07-05T01:31:32Z"},{"alias_kind":"arxiv_version","alias_value":"2008.12905v1","created_at":"2026-07-05T01:31:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.12905","created_at":"2026-07-05T01:31:32Z"},{"alias_kind":"pith_short_12","alias_value":"MVRHBCOSQMUL","created_at":"2026-07-05T01:31:32Z"},{"alias_kind":"pith_short_16","alias_value":"MVRHBCOSQMULQF3V","created_at":"2026-07-05T01:31:32Z"},{"alias_kind":"pith_short_8","alias_value":"MVRHBCOS","created_at":"2026-07-05T01:31:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:MVRHBCOSQMULQF3VPMPR7WQE3S","target":"record","payload":{"canonical_record":{"source":{"id":"2008.12905","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-08-29T03:42:03Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"31a912b6d77b61c76b5351d78e96d654a3a3da9d99a0179cd20d16227d692f31","abstract_canon_sha256":"f9ee1c66b333c608c231819a51e91bf60fca5baad310cc99ec670133e58e778e"},"schema_version":"1.0"},"canonical_sha256":"65627089d28328b817757b1f1fda04dcaa0f12ac1a9e1effe4f6742a3426f70b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:31:32.370008Z","signature_b64":"9VXlVSoMNpFINkXdNIJMTgg2QDHL0xpcGo5Gz/jeeciLJG/E+lhAw37zr1ovmVQqxl5h34uxluJC7FNccBeqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65627089d28328b817757b1f1fda04dcaa0f12ac1a9e1effe4f6742a3426f70b","last_reissued_at":"2026-07-05T01:31:32.369651Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:31:32.369651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2008.12905","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-07-05T01:31:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aJnGbTnO9zbpJXodRJcdT7L1Mi1y0Oqq7XAkrVThzhHmrJ+P9TvqhAcbRhlTEjUdrMM2M8SrP9Cv3emgPnAIDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-28T17:10:31.566028Z"},"content_sha256":"1d3569c97e99dcb5e6c6cf288d2fffbee7105a3a40901ecb136ca8511c7e8bb7","schema_version":"1.0","event_id":"sha256:1d3569c97e99dcb5e6c6cf288d2fffbee7105a3a40901ecb136ca8511c7e8bb7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:MVRHBCOSQMULQF3VPMPR7WQE3S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Batching and Matching for Food Delivery in Dynamic Road Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Amitabha Bagchi, Arshdeep Singh, Manas Joshi, Priyank Karia, Puneet Kala, Sayan Ranu","submitted_at":"2020-08-29T03:42:03Z","abstract_excerpt":"Given a stream of food orders and available delivery vehicles, how should orders be assigned to vehicles so that the delivery time is minimized? Several decisions have to be made: (1) assignment of orders to vehicles, (2) grouping orders into batches to cope with limited vehicle availability, and (3) adapting to dynamic positions of delivery vehicles. We show that the minimization problem is not only NP-hard but inapproximable in polynomial time. To mitigate this computational bottleneck, we develop an algorithm called FoodMatch, which maps the vehicle assignment problem to that of minimum wei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.12905","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.12905/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-05T01:31:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TOZX41nIbW5ykWFlufguR5VcDt0XwvY3RbFyKCldyftzZbE/TH/yIPPF08cNNdoXLFo4dVmCcjoUGFnwlPjBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-28T17:10:31.566424Z"},"content_sha256":"504319abcb084911824ee199f7de61f1ae006812a162f31fbc821e0a9ad817d9","schema_version":"1.0","event_id":"sha256:504319abcb084911824ee199f7de61f1ae006812a162f31fbc821e0a9ad817d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MVRHBCOSQMULQF3VPMPR7WQE3S/bundle.json","state_url":"https://pith.science/pith/MVRHBCOSQMULQF3VPMPR7WQE3S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MVRHBCOSQMULQF3VPMPR7WQE3S/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-28T17:10:31Z","links":{"resolver":"https://pith.science/pith/MVRHBCOSQMULQF3VPMPR7WQE3S","bundle":"https://pith.science/pith/MVRHBCOSQMULQF3VPMPR7WQE3S/bundle.json","state":"https://pith.science/pith/MVRHBCOSQMULQF3VPMPR7WQE3S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MVRHBCOSQMULQF3VPMPR7WQE3S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:MVRHBCOSQMULQF3VPMPR7WQE3S","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":"f9ee1c66b333c608c231819a51e91bf60fca5baad310cc99ec670133e58e778e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-08-29T03:42:03Z","title_canon_sha256":"31a912b6d77b61c76b5351d78e96d654a3a3da9d99a0179cd20d16227d692f31"},"schema_version":"1.0","source":{"id":"2008.12905","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.12905","created_at":"2026-07-05T01:31:32Z"},{"alias_kind":"arxiv_version","alias_value":"2008.12905v1","created_at":"2026-07-05T01:31:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.12905","created_at":"2026-07-05T01:31:32Z"},{"alias_kind":"pith_short_12","alias_value":"MVRHBCOSQMUL","created_at":"2026-07-05T01:31:32Z"},{"alias_kind":"pith_short_16","alias_value":"MVRHBCOSQMULQF3V","created_at":"2026-07-05T01:31:32Z"},{"alias_kind":"pith_short_8","alias_value":"MVRHBCOS","created_at":"2026-07-05T01:31:32Z"}],"graph_snapshots":[{"event_id":"sha256:504319abcb084911824ee199f7de61f1ae006812a162f31fbc821e0a9ad817d9","target":"graph","created_at":"2026-07-05T01:31:32Z","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/2008.12905/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a stream of food orders and available delivery vehicles, how should orders be assigned to vehicles so that the delivery time is minimized? Several decisions have to be made: (1) assignment of orders to vehicles, (2) grouping orders into batches to cope with limited vehicle availability, and (3) adapting to dynamic positions of delivery vehicles. We show that the minimization problem is not only NP-hard but inapproximable in polynomial time. To mitigate this computational bottleneck, we develop an algorithm called FoodMatch, which maps the vehicle assignment problem to that of minimum wei","authors_text":"Amitabha Bagchi, Arshdeep Singh, Manas Joshi, Priyank Karia, Puneet Kala, Sayan Ranu","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-08-29T03:42:03Z","title":"Batching and Matching for Food Delivery in Dynamic Road Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.12905","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:1d3569c97e99dcb5e6c6cf288d2fffbee7105a3a40901ecb136ca8511c7e8bb7","target":"record","created_at":"2026-07-05T01:31:32Z","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":"f9ee1c66b333c608c231819a51e91bf60fca5baad310cc99ec670133e58e778e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-08-29T03:42:03Z","title_canon_sha256":"31a912b6d77b61c76b5351d78e96d654a3a3da9d99a0179cd20d16227d692f31"},"schema_version":"1.0","source":{"id":"2008.12905","kind":"arxiv","version":1}},"canonical_sha256":"65627089d28328b817757b1f1fda04dcaa0f12ac1a9e1effe4f6742a3426f70b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65627089d28328b817757b1f1fda04dcaa0f12ac1a9e1effe4f6742a3426f70b","first_computed_at":"2026-07-05T01:31:32.369651Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:31:32.369651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9VXlVSoMNpFINkXdNIJMTgg2QDHL0xpcGo5Gz/jeeciLJG/E+lhAw37zr1ovmVQqxl5h34uxluJC7FNccBeqAA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:31:32.370008Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.12905","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d3569c97e99dcb5e6c6cf288d2fffbee7105a3a40901ecb136ca8511c7e8bb7","sha256:504319abcb084911824ee199f7de61f1ae006812a162f31fbc821e0a9ad817d9"],"state_sha256":"0ed9897903e779958f0c6323bdf0279d5b03bf5101a9336a71e8ea19f419897c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IoBjZwoXhE6Jz5F77Q1X3RT0xb8OmU2iC7YbyOtxlZ24nhE0hOrRt4dvImF1Y44zFwnwNhhejG48lC/DekXcDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-28T17:10:31.568854Z","bundle_sha256":"b38aa7fc26cd99632cba9ce3b9ca8eafc56974388dc66c210484c4d2e4925ca2"}}