{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:DF4MYRWYTVAIEUMEYDYRJAF2LP","short_pith_number":"pith:DF4MYRWY","schema_version":"1.0","canonical_sha256":"1978cc46d89d40825184c0f11480ba5bfd26901d3feb6e8cb399ba25e551a59e","source":{"kind":"arxiv","id":"1212.3233","version":3},"attestation_state":"computed","paper":{"title":"Approximation Algorithms for the Joint Replenishment Problem with Deadlines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Grzegorz Swirszcz, Jaroslaw Byrka, Marcin Bienkowski, Marek Chrobak, Maxim Sviridenko, Neal E. Young, Neil Dobbs, Tomasz Nowicki","submitted_at":"2012-12-13T17:30:58Z","abstract_excerpt":"The Joint Replenishment Problem (JRP) is a fundamental optimization problem in supply-chain management, concerned with optimizing the flow of goods from a supplier to retailers. Over time, in response to demands at the retailers, the supplier ships orders, via a warehouse, to the retailers. The objective is to schedule these orders to minimize the sum of ordering costs and retailers' waiting costs.\n  We study the approximability of JRP-D, the version of JRP with deadlines, where instead of waiting costs the retailers impose strict deadlines. We study the integrality gap of the standard linear-"},"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":"1212.3233","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-13T17:30:58Z","cross_cats_sorted":[],"title_canon_sha256":"0a555f6338d7307395f1f7d514850aeac1ec79c1b3609f216a96b08a77fe37a9","abstract_canon_sha256":"e3d3cb83b617134bcca8937737885705594dd4a527f5926c7f2ff5bc37199512"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:24.900574Z","signature_b64":"e8asxoYSjpA0XQ97wOZ/sF/AARNhZlAZYAKKb9He2uJJ6uzWH9Z+BzqQWSenkGeYlkjeUWSLUjI3+o4rUy95CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1978cc46d89d40825184c0f11480ba5bfd26901d3feb6e8cb399ba25e551a59e","last_reissued_at":"2026-05-18T01:25:24.900151Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:24.900151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Algorithms for the Joint Replenishment Problem with Deadlines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Grzegorz Swirszcz, Jaroslaw Byrka, Marcin Bienkowski, Marek Chrobak, Maxim Sviridenko, Neal E. Young, Neil Dobbs, Tomasz Nowicki","submitted_at":"2012-12-13T17:30:58Z","abstract_excerpt":"The Joint Replenishment Problem (JRP) is a fundamental optimization problem in supply-chain management, concerned with optimizing the flow of goods from a supplier to retailers. Over time, in response to demands at the retailers, the supplier ships orders, via a warehouse, to the retailers. The objective is to schedule these orders to minimize the sum of ordering costs and retailers' waiting costs.\n  We study the approximability of JRP-D, the version of JRP with deadlines, where instead of waiting costs the retailers impose strict deadlines. We study the integrality gap of the standard linear-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3233","kind":"arxiv","version":3},"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":"1212.3233","created_at":"2026-05-18T01:25:24.900213+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.3233v3","created_at":"2026-05-18T01:25:24.900213+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3233","created_at":"2026-05-18T01:25:24.900213+00:00"},{"alias_kind":"pith_short_12","alias_value":"DF4MYRWYTVAI","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"DF4MYRWYTVAIEUME","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"DF4MYRWY","created_at":"2026-05-18T12:27:01.376967+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/DF4MYRWYTVAIEUMEYDYRJAF2LP","json":"https://pith.science/pith/DF4MYRWYTVAIEUMEYDYRJAF2LP.json","graph_json":"https://pith.science/api/pith-number/DF4MYRWYTVAIEUMEYDYRJAF2LP/graph.json","events_json":"https://pith.science/api/pith-number/DF4MYRWYTVAIEUMEYDYRJAF2LP/events.json","paper":"https://pith.science/paper/DF4MYRWY"},"agent_actions":{"view_html":"https://pith.science/pith/DF4MYRWYTVAIEUMEYDYRJAF2LP","download_json":"https://pith.science/pith/DF4MYRWYTVAIEUMEYDYRJAF2LP.json","view_paper":"https://pith.science/paper/DF4MYRWY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.3233&json=true","fetch_graph":"https://pith.science/api/pith-number/DF4MYRWYTVAIEUMEYDYRJAF2LP/graph.json","fetch_events":"https://pith.science/api/pith-number/DF4MYRWYTVAIEUMEYDYRJAF2LP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DF4MYRWYTVAIEUMEYDYRJAF2LP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DF4MYRWYTVAIEUMEYDYRJAF2LP/action/storage_attestation","attest_author":"https://pith.science/pith/DF4MYRWYTVAIEUMEYDYRJAF2LP/action/author_attestation","sign_citation":"https://pith.science/pith/DF4MYRWYTVAIEUMEYDYRJAF2LP/action/citation_signature","submit_replication":"https://pith.science/pith/DF4MYRWYTVAIEUMEYDYRJAF2LP/action/replication_record"}},"created_at":"2026-05-18T01:25:24.900213+00:00","updated_at":"2026-05-18T01:25:24.900213+00:00"}