{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:DOPNJ6LYIPZ2UEGOLQBU53HO55","short_pith_number":"pith:DOPNJ6LY","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"},"canonical_sha256":"1b9ed4f97843f3aa10ce5c034eeceeef5dda5dd0e9cbb2906ca62da226d3dd5e","source":{"kind":"arxiv","id":"2403.01568","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.01568","created_at":"2026-07-05T07:51:48Z"},{"alias_kind":"arxiv_version","alias_value":"2403.01568v1","created_at":"2026-07-05T07:51:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.01568","created_at":"2026-07-05T07:51:48Z"},{"alias_kind":"pith_short_12","alias_value":"DOPNJ6LYIPZ2","created_at":"2026-07-05T07:51:48Z"},{"alias_kind":"pith_short_16","alias_value":"DOPNJ6LYIPZ2UEGO","created_at":"2026-07-05T07:51:48Z"},{"alias_kind":"pith_short_8","alias_value":"DOPNJ6LY","created_at":"2026-07-05T07:51:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:DOPNJ6LYIPZ2UEGOLQBU53HO55","target":"record","payload":{"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"},"canonical_sha256":"1b9ed4f97843f3aa10ce5c034eeceeef5dda5dd0e9cbb2906ca62da226d3dd5e","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"},"source_kind":"arxiv","source_id":"2403.01568","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-05T07:51:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t3OmFhjpbkWU3bJ7xbhSloWtPl2nRb0mZseiCLlHFp3qt2DWs+gIT9Yx/2Urjyn5ol+6cGcZvZzZKcKIc6+KBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T08:35:25.889236Z"},"content_sha256":"350d38dea6c6aa88b709d0f4ca5057ac41c3aded159c83591b4bdc8670090ae2","schema_version":"1.0","event_id":"sha256:350d38dea6c6aa88b709d0f4ca5057ac41c3aded159c83591b4bdc8670090ae2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:DOPNJ6LYIPZ2UEGOLQBU53HO55","target":"graph","payload":{"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"},"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-05T07:51:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6SgdlimthiEh6kkNH7k0igYc9tUYMustGe1AjGEv+sBaU0DIi+4bK529iulzpSx/Nofv+/kPHtDaazHWTRXvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T08:35:25.889715Z"},"content_sha256":"e5cf6586169814a7e796d04f9d8840e8d138c474ff3f65f5e7d0870bb30a00fe","schema_version":"1.0","event_id":"sha256:e5cf6586169814a7e796d04f9d8840e8d138c474ff3f65f5e7d0870bb30a00fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DOPNJ6LYIPZ2UEGOLQBU53HO55/bundle.json","state_url":"https://pith.science/pith/DOPNJ6LYIPZ2UEGOLQBU53HO55/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DOPNJ6LYIPZ2UEGOLQBU53HO55/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-05T08:35:25Z","links":{"resolver":"https://pith.science/pith/DOPNJ6LYIPZ2UEGOLQBU53HO55","bundle":"https://pith.science/pith/DOPNJ6LYIPZ2UEGOLQBU53HO55/bundle.json","state":"https://pith.science/pith/DOPNJ6LYIPZ2UEGOLQBU53HO55/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DOPNJ6LYIPZ2UEGOLQBU53HO55/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DOPNJ6LYIPZ2UEGOLQBU53HO55","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":"f9a837b0ea68b9ae80d729aaa83cbabe1b84b44cce3929d94930c3d8a9c46a6c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-03-03T17:17:08Z","title_canon_sha256":"701d7544c97220b1424166ea043b993497f9ede1862ad5f5bc4427a50e880867"},"schema_version":"1.0","source":{"id":"2403.01568","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.01568","created_at":"2026-07-05T07:51:48Z"},{"alias_kind":"arxiv_version","alias_value":"2403.01568v1","created_at":"2026-07-05T07:51:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.01568","created_at":"2026-07-05T07:51:48Z"},{"alias_kind":"pith_short_12","alias_value":"DOPNJ6LYIPZ2","created_at":"2026-07-05T07:51:48Z"},{"alias_kind":"pith_short_16","alias_value":"DOPNJ6LYIPZ2UEGO","created_at":"2026-07-05T07:51:48Z"},{"alias_kind":"pith_short_8","alias_value":"DOPNJ6LY","created_at":"2026-07-05T07:51:48Z"}],"graph_snapshots":[{"event_id":"sha256:e5cf6586169814a7e796d04f9d8840e8d138c474ff3f65f5e7d0870bb30a00fe","target":"graph","created_at":"2026-07-05T07:51:48Z","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/2403.01568/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Baruch Schieber, Guy Kortsarz, Hadas Shachnai, Ilan Doron-Arad, Joseph Naor","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-03-03T17:17:08Z","title":"Approximations and Hardness of Packing Partially Ordered Items"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.01568","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:350d38dea6c6aa88b709d0f4ca5057ac41c3aded159c83591b4bdc8670090ae2","target":"record","created_at":"2026-07-05T07:51:48Z","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":"f9a837b0ea68b9ae80d729aaa83cbabe1b84b44cce3929d94930c3d8a9c46a6c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-03-03T17:17:08Z","title_canon_sha256":"701d7544c97220b1424166ea043b993497f9ede1862ad5f5bc4427a50e880867"},"schema_version":"1.0","source":{"id":"2403.01568","kind":"arxiv","version":1}},"canonical_sha256":"1b9ed4f97843f3aa10ce5c034eeceeef5dda5dd0e9cbb2906ca62da226d3dd5e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b9ed4f97843f3aa10ce5c034eeceeef5dda5dd0e9cbb2906ca62da226d3dd5e","first_computed_at":"2026-07-05T07:51:48.896696Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:51:48.896696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xdK902umOGwlM56aR6YVVDg+ucaI6PfFyBe7QF9X9laqDN+PBVyd4UpQZyqXJXEv416WByZLBsEwq05BG+MDBw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:51:48.897173Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.01568","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:350d38dea6c6aa88b709d0f4ca5057ac41c3aded159c83591b4bdc8670090ae2","sha256:e5cf6586169814a7e796d04f9d8840e8d138c474ff3f65f5e7d0870bb30a00fe"],"state_sha256":"d792f38898fa545db8c37318e9acffc860cbd90e16232cf1807aab0b74cf0003"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kzD2T6VGxDPyHnMd29pkiGXItWyEmNa+C+gtB6HfxftvAc0AF1S34oENqTiW5XlNVPBB7hW+Hso1vfTWqQIeAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T08:35:25.892856Z","bundle_sha256":"2d535ca910163d52da2c1c55a8e541ca442420efa200e018af0ca20268a9d988"}}