{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VYJHRXP7CK4GZAZ26RXETNODEA","short_pith_number":"pith:VYJHRXP7","canonical_record":{"source":{"id":"1912.00101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-30T00:16:52Z","cross_cats_sorted":[],"title_canon_sha256":"c756313ac19d11b4f0897bcce9cc1f7b0fef5ff3c303e15befb0377cfb649489","abstract_canon_sha256":"ab5c794862035b26afead98dca9011b8b4f3cfac550c39e74ec7d6dae8afc2c7"},"schema_version":"1.0"},"canonical_sha256":"ae1278ddff12b86c833af46e49b5c320263bff851792cd5bafcc3f61388fcb6a","source":{"kind":"arxiv","id":"1912.00101","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.00101","created_at":"2026-07-05T00:23:10Z"},{"alias_kind":"arxiv_version","alias_value":"1912.00101v1","created_at":"2026-07-05T00:23:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.00101","created_at":"2026-07-05T00:23:10Z"},{"alias_kind":"pith_short_12","alias_value":"VYJHRXP7CK4G","created_at":"2026-07-05T00:23:10Z"},{"alias_kind":"pith_short_16","alias_value":"VYJHRXP7CK4GZAZ2","created_at":"2026-07-05T00:23:10Z"},{"alias_kind":"pith_short_8","alias_value":"VYJHRXP7","created_at":"2026-07-05T00:23:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VYJHRXP7CK4GZAZ26RXETNODEA","target":"record","payload":{"canonical_record":{"source":{"id":"1912.00101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-30T00:16:52Z","cross_cats_sorted":[],"title_canon_sha256":"c756313ac19d11b4f0897bcce9cc1f7b0fef5ff3c303e15befb0377cfb649489","abstract_canon_sha256":"ab5c794862035b26afead98dca9011b8b4f3cfac550c39e74ec7d6dae8afc2c7"},"schema_version":"1.0"},"canonical_sha256":"ae1278ddff12b86c833af46e49b5c320263bff851792cd5bafcc3f61388fcb6a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:23:10.217035Z","signature_b64":"3FORi5hMdgQLoV424J0D4YEzZ9rttH4kB10HmDiqTMly7DzVkX2xIk5ZhUXByTq41Z+F6SucF72sMI86f+RZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae1278ddff12b86c833af46e49b5c320263bff851792cd5bafcc3f61388fcb6a","last_reissued_at":"2026-07-05T00:23:10.216704Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:23:10.216704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1912.00101","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-05T00:23:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iYHNYDpeuzpZCm8TOrjVmSMwHJDqE6lR8JCIUcVz4gYvGI5B9BqwnBG/lWaTfF1A7KZR2zpfKIzS6UPkuPl1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T18:28:00.092830Z"},"content_sha256":"8845c6b4196a99e965174a8b7b1f1049fca09784cf2db4ab20715b1ded71fed1","schema_version":"1.0","event_id":"sha256:8845c6b4196a99e965174a8b7b1f1049fca09784cf2db4ab20715b1ded71fed1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VYJHRXP7CK4GZAZ26RXETNODEA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Approximation Algorithms for Inventory Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Neil Olver, Thomas Bosman","submitted_at":"2019-11-30T00:16:52Z","abstract_excerpt":"We give new approximation algorithms for the submodular joint replenishment problem and the inventory routing problem, using an iterative rounding approach. In both problems, we are given a set of $N$ items and a discrete time horizon of $T$ days in which given demands for the items must be satisfied. Ordering a set of items incurs a cost according to a set function, with properties depending on the problem under consideration. Demand for an item at time $t$ can be satisfied by an order on any day prior to $t$, but a holding cost is charged for storing the items during the intermediate period;"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.00101","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/1912.00101/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-05T00:23:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BL/koSVxqN5O/q7GYTIfn3RyiwU+mXab8QYE9g4xme68xgxFiOj6XuowAIdHOohpUAA6OKAuxL8ougpMo8tRCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T18:28:00.093446Z"},"content_sha256":"fc94549faa361a1e368f82e7fdacf52631cf6f4dc555715a84dc93da8372dca8","schema_version":"1.0","event_id":"sha256:fc94549faa361a1e368f82e7fdacf52631cf6f4dc555715a84dc93da8372dca8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VYJHRXP7CK4GZAZ26RXETNODEA/bundle.json","state_url":"https://pith.science/pith/VYJHRXP7CK4GZAZ26RXETNODEA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VYJHRXP7CK4GZAZ26RXETNODEA/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-08-22T18:28:00Z","links":{"resolver":"https://pith.science/pith/VYJHRXP7CK4GZAZ26RXETNODEA","bundle":"https://pith.science/pith/VYJHRXP7CK4GZAZ26RXETNODEA/bundle.json","state":"https://pith.science/pith/VYJHRXP7CK4GZAZ26RXETNODEA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VYJHRXP7CK4GZAZ26RXETNODEA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VYJHRXP7CK4GZAZ26RXETNODEA","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":"ab5c794862035b26afead98dca9011b8b4f3cfac550c39e74ec7d6dae8afc2c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-30T00:16:52Z","title_canon_sha256":"c756313ac19d11b4f0897bcce9cc1f7b0fef5ff3c303e15befb0377cfb649489"},"schema_version":"1.0","source":{"id":"1912.00101","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.00101","created_at":"2026-07-05T00:23:10Z"},{"alias_kind":"arxiv_version","alias_value":"1912.00101v1","created_at":"2026-07-05T00:23:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.00101","created_at":"2026-07-05T00:23:10Z"},{"alias_kind":"pith_short_12","alias_value":"VYJHRXP7CK4G","created_at":"2026-07-05T00:23:10Z"},{"alias_kind":"pith_short_16","alias_value":"VYJHRXP7CK4GZAZ2","created_at":"2026-07-05T00:23:10Z"},{"alias_kind":"pith_short_8","alias_value":"VYJHRXP7","created_at":"2026-07-05T00:23:10Z"}],"graph_snapshots":[{"event_id":"sha256:fc94549faa361a1e368f82e7fdacf52631cf6f4dc555715a84dc93da8372dca8","target":"graph","created_at":"2026-07-05T00:23:10Z","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/1912.00101/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give new approximation algorithms for the submodular joint replenishment problem and the inventory routing problem, using an iterative rounding approach. In both problems, we are given a set of $N$ items and a discrete time horizon of $T$ days in which given demands for the items must be satisfied. Ordering a set of items incurs a cost according to a set function, with properties depending on the problem under consideration. Demand for an item at time $t$ can be satisfied by an order on any day prior to $t$, but a holding cost is charged for storing the items during the intermediate period;","authors_text":"Neil Olver, Thomas Bosman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-30T00:16:52Z","title":"Improved Approximation Algorithms for Inventory Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.00101","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:8845c6b4196a99e965174a8b7b1f1049fca09784cf2db4ab20715b1ded71fed1","target":"record","created_at":"2026-07-05T00:23:10Z","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":"ab5c794862035b26afead98dca9011b8b4f3cfac550c39e74ec7d6dae8afc2c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-30T00:16:52Z","title_canon_sha256":"c756313ac19d11b4f0897bcce9cc1f7b0fef5ff3c303e15befb0377cfb649489"},"schema_version":"1.0","source":{"id":"1912.00101","kind":"arxiv","version":1}},"canonical_sha256":"ae1278ddff12b86c833af46e49b5c320263bff851792cd5bafcc3f61388fcb6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae1278ddff12b86c833af46e49b5c320263bff851792cd5bafcc3f61388fcb6a","first_computed_at":"2026-07-05T00:23:10.216704Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:23:10.216704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3FORi5hMdgQLoV424J0D4YEzZ9rttH4kB10HmDiqTMly7DzVkX2xIk5ZhUXByTq41Z+F6SucF72sMI86f+RZBw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:23:10.217035Z","signed_message":"canonical_sha256_bytes"},"source_id":"1912.00101","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8845c6b4196a99e965174a8b7b1f1049fca09784cf2db4ab20715b1ded71fed1","sha256:fc94549faa361a1e368f82e7fdacf52631cf6f4dc555715a84dc93da8372dca8"],"state_sha256":"a32d9d541e067e1439f8cf0b2bdc7f9d80ea2336d0f8781668950b0b2ea35a2d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y4klx/vFx0Z6JwQEbUzvQuaYsSYu/Lw+v0Ey6Y/wh8BO2BxuFWXyXqdpKKqyj2xE6ko/Tx6VeM9MCC06rRJyCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T18:28:00.097977Z","bundle_sha256":"c16e9f5f0d78a70c285d63833ef5efa2ccfd68a6a68b554e041aafc2dd061e1e"}}