{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UBFQCFWGISE67542E26NJY367P","short_pith_number":"pith:UBFQCFWG","schema_version":"1.0","canonical_sha256":"a04b0116c64489eff79a26bcd4e37efbf4dac6064a478c23acb2f41703c247de","source":{"kind":"arxiv","id":"1712.05218","version":1},"attestation_state":"computed","paper":{"title":"Approximation Algorithms for Replenishment Problems with Fixed Turnover Times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alberto Marchetti-Spaccamela, Leen Stougie, Martijn van Ee, R. Ravi, Thomas Bosman, Yang Jiao","submitted_at":"2017-12-14T13:35:09Z","abstract_excerpt":"We introduce and study a class of optimization problems we coin replenishment problems with fixed turnover times: a very natural model that has received little attention in the literature. Nodes with capacity for storing a certain commodity are located at various places; at each node the commodity depletes within a certain time, the turnover time, which is constant but can vary between locations. Nodes should never run empty, and to prevent this we may schedule nodes for replenishment every day. The natural feature that makes this problem interesting is that we may schedule a replenishment (we"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1712.05218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-14T13:35:09Z","cross_cats_sorted":[],"title_canon_sha256":"7c9f14da4780060d194425bdddf9df6d630a2dfc336fcc242f21c784e982af13","abstract_canon_sha256":"b1410dede56272bf4ed5b9268e290012267efe0637481019a6b018b8dce0349c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:58.583125Z","signature_b64":"JNg0osB2mxb6DxwIEC2ACLUB0teOQyM17jTngCu3uFrz+HP0NCCfjCbIqqPRJgR7og3p6qoF3u+NDbjlGhM4DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a04b0116c64489eff79a26bcd4e37efbf4dac6064a478c23acb2f41703c247de","last_reissued_at":"2026-05-18T00:27:58.582389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:58.582389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Replenishment Problems with Fixed Turnover Times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alberto Marchetti-Spaccamela, Leen Stougie, Martijn van Ee, R. Ravi, Thomas Bosman, Yang Jiao","submitted_at":"2017-12-14T13:35:09Z","abstract_excerpt":"We introduce and study a class of optimization problems we coin replenishment problems with fixed turnover times: a very natural model that has received little attention in the literature. Nodes with capacity for storing a certain commodity are located at various places; at each node the commodity depletes within a certain time, the turnover time, which is constant but can vary between locations. Nodes should never run empty, and to prevent this we may schedule nodes for replenishment every day. The natural feature that makes this problem interesting is that we may schedule a replenishment (we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05218","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.05218","created_at":"2026-05-18T00:27:58.582499+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.05218v1","created_at":"2026-05-18T00:27:58.582499+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05218","created_at":"2026-05-18T00:27:58.582499+00:00"},{"alias_kind":"pith_short_12","alias_value":"UBFQCFWGISE6","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UBFQCFWGISE67542","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UBFQCFWG","created_at":"2026-05-18T12:31:46.661854+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UBFQCFWGISE67542E26NJY367P","json":"https://pith.science/pith/UBFQCFWGISE67542E26NJY367P.json","graph_json":"https://pith.science/api/pith-number/UBFQCFWGISE67542E26NJY367P/graph.json","events_json":"https://pith.science/api/pith-number/UBFQCFWGISE67542E26NJY367P/events.json","paper":"https://pith.science/paper/UBFQCFWG"},"agent_actions":{"view_html":"https://pith.science/pith/UBFQCFWGISE67542E26NJY367P","download_json":"https://pith.science/pith/UBFQCFWGISE67542E26NJY367P.json","view_paper":"https://pith.science/paper/UBFQCFWG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.05218&json=true","fetch_graph":"https://pith.science/api/pith-number/UBFQCFWGISE67542E26NJY367P/graph.json","fetch_events":"https://pith.science/api/pith-number/UBFQCFWGISE67542E26NJY367P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UBFQCFWGISE67542E26NJY367P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UBFQCFWGISE67542E26NJY367P/action/storage_attestation","attest_author":"https://pith.science/pith/UBFQCFWGISE67542E26NJY367P/action/author_attestation","sign_citation":"https://pith.science/pith/UBFQCFWGISE67542E26NJY367P/action/citation_signature","submit_replication":"https://pith.science/pith/UBFQCFWGISE67542E26NJY367P/action/replication_record"}},"created_at":"2026-05-18T00:27:58.582499+00:00","updated_at":"2026-05-18T00:27:58.582499+00:00"}