{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DOPNJ6LYIPZ2UEGOLQBU53HO55","short_pith_number":"pith:DOPNJ6LY","schema_version":"1.0","canonical_sha256":"1b9ed4f97843f3aa10ce5c034eeceeef5dda5dd0e9cbb2906ca62da226d3dd5e","source":{"kind":"arxiv","id":"2403.01568","version":1},"attestation_state":"computed","paper":{"title":"Approximations and Hardness of Packing Partially Ordered Items","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Baruch Schieber, Guy Kortsarz, Hadas Shachnai, Ilan Doron-Arad, Joseph Naor","submitted_at":"2024-03-03T17:17:08Z","abstract_excerpt":"Motivated by applications in production planning and storage allocation in hierarchical databases, we initiate the study of covering partially ordered items (CPO). Given a capacity $k \\in \\mathbb{Z}^+$, and a directed graph $G=(V,E)$ where each vertex has a size in $\\{0,1, \\ldots,k\\}$, we seek a collection of subsets of vertices $S_1, \\ldots, S_m$ that cover all the vertices, such that for any $1 \\leq j \\leq m$, the total size of vertices in $S_j$ is bounded by $k$, and there are no edges from $V \\setminus S_j$ to $S_j$. The objective is to minimize the number of subsets $m$. CPO is closely re"},"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":"2403.01568","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-03-03T17:17:08Z","cross_cats_sorted":[],"title_canon_sha256":"701d7544c97220b1424166ea043b993497f9ede1862ad5f5bc4427a50e880867","abstract_canon_sha256":"f9a837b0ea68b9ae80d729aaa83cbabe1b84b44cce3929d94930c3d8a9c46a6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:51:48.897173Z","signature_b64":"xdK902umOGwlM56aR6YVVDg+ucaI6PfFyBe7QF9X9laqDN+PBVyd4UpQZyqXJXEv416WByZLBsEwq05BG+MDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b9ed4f97843f3aa10ce5c034eeceeef5dda5dd0e9cbb2906ca62da226d3dd5e","last_reissued_at":"2026-07-05T07:51:48.896696Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:51:48.896696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximations and Hardness of Packing Partially Ordered Items","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Baruch Schieber, Guy Kortsarz, Hadas Shachnai, Ilan Doron-Arad, Joseph Naor","submitted_at":"2024-03-03T17:17:08Z","abstract_excerpt":"Motivated by applications in production planning and storage allocation in hierarchical databases, we initiate the study of covering partially ordered items (CPO). Given a capacity $k \\in \\mathbb{Z}^+$, and a directed graph $G=(V,E)$ where each vertex has a size in $\\{0,1, \\ldots,k\\}$, we seek a collection of subsets of vertices $S_1, \\ldots, S_m$ that cover all the vertices, such that for any $1 \\leq j \\leq m$, the total size of vertices in $S_j$ is bounded by $k$, and there are no edges from $V \\setminus S_j$ to $S_j$. The objective is to minimize the number of subsets $m$. CPO is closely re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.01568","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/2403.01568/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2403.01568","created_at":"2026-07-05T07:51:48.896752+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.01568v1","created_at":"2026-07-05T07:51:48.896752+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.01568","created_at":"2026-07-05T07:51:48.896752+00:00"},{"alias_kind":"pith_short_12","alias_value":"DOPNJ6LYIPZ2","created_at":"2026-07-05T07:51:48.896752+00:00"},{"alias_kind":"pith_short_16","alias_value":"DOPNJ6LYIPZ2UEGO","created_at":"2026-07-05T07:51:48.896752+00:00"},{"alias_kind":"pith_short_8","alias_value":"DOPNJ6LY","created_at":"2026-07-05T07:51:48.896752+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/DOPNJ6LYIPZ2UEGOLQBU53HO55","json":"https://pith.science/pith/DOPNJ6LYIPZ2UEGOLQBU53HO55.json","graph_json":"https://pith.science/api/pith-number/DOPNJ6LYIPZ2UEGOLQBU53HO55/graph.json","events_json":"https://pith.science/api/pith-number/DOPNJ6LYIPZ2UEGOLQBU53HO55/events.json","paper":"https://pith.science/paper/DOPNJ6LY"},"agent_actions":{"view_html":"https://pith.science/pith/DOPNJ6LYIPZ2UEGOLQBU53HO55","download_json":"https://pith.science/pith/DOPNJ6LYIPZ2UEGOLQBU53HO55.json","view_paper":"https://pith.science/paper/DOPNJ6LY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.01568&json=true","fetch_graph":"https://pith.science/api/pith-number/DOPNJ6LYIPZ2UEGOLQBU53HO55/graph.json","fetch_events":"https://pith.science/api/pith-number/DOPNJ6LYIPZ2UEGOLQBU53HO55/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DOPNJ6LYIPZ2UEGOLQBU53HO55/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DOPNJ6LYIPZ2UEGOLQBU53HO55/action/storage_attestation","attest_author":"https://pith.science/pith/DOPNJ6LYIPZ2UEGOLQBU53HO55/action/author_attestation","sign_citation":"https://pith.science/pith/DOPNJ6LYIPZ2UEGOLQBU53HO55/action/citation_signature","submit_replication":"https://pith.science/pith/DOPNJ6LYIPZ2UEGOLQBU53HO55/action/replication_record"}},"created_at":"2026-07-05T07:51:48.896752+00:00","updated_at":"2026-07-05T07:51:48.896752+00:00"}