{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:GNGL56BCBVKTQKTVRBI546DPV4","short_pith_number":"pith:GNGL56BC","canonical_record":{"source":{"id":"2301.07537","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-01-18T13:57:09Z","cross_cats_sorted":[],"title_canon_sha256":"485e6d0c6c2941df0c08a66a210ebac7b34cdb6045372674bdb47940d1265ef4","abstract_canon_sha256":"ebabd24b4a88d61b2d2919c6cc5b1301dc153eb1da76db2eae619f998f7dceb5"},"schema_version":"1.0"},"canonical_sha256":"334cbef8220d55382a758851de786faf16b01601e02b0baacc9c688ad8f501b9","source":{"kind":"arxiv","id":"2301.07537","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.07537","created_at":"2026-07-05T05:34:10Z"},{"alias_kind":"arxiv_version","alias_value":"2301.07537v1","created_at":"2026-07-05T05:34:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.07537","created_at":"2026-07-05T05:34:10Z"},{"alias_kind":"pith_short_12","alias_value":"GNGL56BCBVKT","created_at":"2026-07-05T05:34:10Z"},{"alias_kind":"pith_short_16","alias_value":"GNGL56BCBVKTQKTV","created_at":"2026-07-05T05:34:10Z"},{"alias_kind":"pith_short_8","alias_value":"GNGL56BC","created_at":"2026-07-05T05:34:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:GNGL56BCBVKTQKTVRBI546DPV4","target":"record","payload":{"canonical_record":{"source":{"id":"2301.07537","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-01-18T13:57:09Z","cross_cats_sorted":[],"title_canon_sha256":"485e6d0c6c2941df0c08a66a210ebac7b34cdb6045372674bdb47940d1265ef4","abstract_canon_sha256":"ebabd24b4a88d61b2d2919c6cc5b1301dc153eb1da76db2eae619f998f7dceb5"},"schema_version":"1.0"},"canonical_sha256":"334cbef8220d55382a758851de786faf16b01601e02b0baacc9c688ad8f501b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:34:10.242442Z","signature_b64":"k54qjbiD7/tp7QWZTrIR4a6FNTIBNyaUz0T0XPeClSkW3xtoxMMfMXdba2e+m9B/IlrAVbF375XQdmKy0PuAAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"334cbef8220d55382a758851de786faf16b01601e02b0baacc9c688ad8f501b9","last_reissued_at":"2026-07-05T05:34:10.242038Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:34:10.242038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.07537","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-05T05:34:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KWdVuRLXG7tiZB175QhpLapOXbmug+rXdEAzerCA0vomLCDxOlVBk9trIViotngck1dSCLEnhU1dihzaIiF+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T03:43:17.493817Z"},"content_sha256":"afb980d9daa73f483b5de4d5c1359568a58ed13b4178993a7f0ce3c26b474e9a","schema_version":"1.0","event_id":"sha256:afb980d9daa73f483b5de4d5c1359568a58ed13b4178993a7f0ce3c26b474e9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:GNGL56BCBVKTQKTVRBI546DPV4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Improved Approximation for Maximum Weighted $k$-Set Packing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Justin Ward, Theophile Thiery","submitted_at":"2023-01-18T13:57:09Z","abstract_excerpt":"We consider the weighted $k$-set packing problem, in which we are given a collection of weighted sets, each with at most $k$ elements and must return a collection of pairwise disjoint sets with maximum total weight. For $k = 3$, this problem generalizes the classical 3-dimensional matching problem listed as one of the Karp's original 21 NP-complete problems. We give an algorithm attaining an approximation factor of $1.786$ for weighted 3-set packing, improving on the recent best result of $2-\\frac{1}{63,700,992}$ due to Neuwohner.\n  Our algorithm is based on the local search procedure of Berma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.07537","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/2301.07537/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-05T05:34:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vshI2GQuJBO7ZoAC0IhFQxQwR/BQIzEbDSgLC6edt9xxOkRBONza7O61ij5ei8xoW1162PeUTwGHAys1favxCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T03:43:17.494402Z"},"content_sha256":"b80089cb0d0031ecbf65ee3f4a40b67c5483b40d2db19722385859624799f90b","schema_version":"1.0","event_id":"sha256:b80089cb0d0031ecbf65ee3f4a40b67c5483b40d2db19722385859624799f90b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GNGL56BCBVKTQKTVRBI546DPV4/bundle.json","state_url":"https://pith.science/pith/GNGL56BCBVKTQKTVRBI546DPV4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GNGL56BCBVKTQKTVRBI546DPV4/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-24T03:43:17Z","links":{"resolver":"https://pith.science/pith/GNGL56BCBVKTQKTVRBI546DPV4","bundle":"https://pith.science/pith/GNGL56BCBVKTQKTVRBI546DPV4/bundle.json","state":"https://pith.science/pith/GNGL56BCBVKTQKTVRBI546DPV4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GNGL56BCBVKTQKTVRBI546DPV4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:GNGL56BCBVKTQKTVRBI546DPV4","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":"ebabd24b4a88d61b2d2919c6cc5b1301dc153eb1da76db2eae619f998f7dceb5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-01-18T13:57:09Z","title_canon_sha256":"485e6d0c6c2941df0c08a66a210ebac7b34cdb6045372674bdb47940d1265ef4"},"schema_version":"1.0","source":{"id":"2301.07537","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.07537","created_at":"2026-07-05T05:34:10Z"},{"alias_kind":"arxiv_version","alias_value":"2301.07537v1","created_at":"2026-07-05T05:34:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.07537","created_at":"2026-07-05T05:34:10Z"},{"alias_kind":"pith_short_12","alias_value":"GNGL56BCBVKT","created_at":"2026-07-05T05:34:10Z"},{"alias_kind":"pith_short_16","alias_value":"GNGL56BCBVKTQKTV","created_at":"2026-07-05T05:34:10Z"},{"alias_kind":"pith_short_8","alias_value":"GNGL56BC","created_at":"2026-07-05T05:34:10Z"}],"graph_snapshots":[{"event_id":"sha256:b80089cb0d0031ecbf65ee3f4a40b67c5483b40d2db19722385859624799f90b","target":"graph","created_at":"2026-07-05T05:34: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/2301.07537/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the weighted $k$-set packing problem, in which we are given a collection of weighted sets, each with at most $k$ elements and must return a collection of pairwise disjoint sets with maximum total weight. For $k = 3$, this problem generalizes the classical 3-dimensional matching problem listed as one of the Karp's original 21 NP-complete problems. We give an algorithm attaining an approximation factor of $1.786$ for weighted 3-set packing, improving on the recent best result of $2-\\frac{1}{63,700,992}$ due to Neuwohner.\n  Our algorithm is based on the local search procedure of Berma","authors_text":"Justin Ward, Theophile Thiery","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-01-18T13:57:09Z","title":"An Improved Approximation for Maximum Weighted $k$-Set Packing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.07537","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:afb980d9daa73f483b5de4d5c1359568a58ed13b4178993a7f0ce3c26b474e9a","target":"record","created_at":"2026-07-05T05:34: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":"ebabd24b4a88d61b2d2919c6cc5b1301dc153eb1da76db2eae619f998f7dceb5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-01-18T13:57:09Z","title_canon_sha256":"485e6d0c6c2941df0c08a66a210ebac7b34cdb6045372674bdb47940d1265ef4"},"schema_version":"1.0","source":{"id":"2301.07537","kind":"arxiv","version":1}},"canonical_sha256":"334cbef8220d55382a758851de786faf16b01601e02b0baacc9c688ad8f501b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"334cbef8220d55382a758851de786faf16b01601e02b0baacc9c688ad8f501b9","first_computed_at":"2026-07-05T05:34:10.242038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:34:10.242038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k54qjbiD7/tp7QWZTrIR4a6FNTIBNyaUz0T0XPeClSkW3xtoxMMfMXdba2e+m9B/IlrAVbF375XQdmKy0PuAAw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:34:10.242442Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.07537","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:afb980d9daa73f483b5de4d5c1359568a58ed13b4178993a7f0ce3c26b474e9a","sha256:b80089cb0d0031ecbf65ee3f4a40b67c5483b40d2db19722385859624799f90b"],"state_sha256":"18506c2710b18a973e0947141487a7a68bf5110d73038df0d3fca1ed82ca5bcf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3yxAYMxgTqvYlkbaRhG5rFv4CtygBtCXAvlwS9uWdNCH89p49GsutwO9Gxc740Vrrsh/hr5PWbn8snLHclwHDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-24T03:43:17.498350Z","bundle_sha256":"a10e5fbc3db55dea04b0a9c84acd2c372e65f20275eeae6424189513dd34a8f5"}}