{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DC55LTB633DQLGY4EYE3WVLMF7","short_pith_number":"pith:DC55LTB6","canonical_record":{"source":{"id":"1304.1424","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-04T16:34:44Z","cross_cats_sorted":[],"title_canon_sha256":"ca5c6f315cbc8a63b73ecd1dd0764fb3268255ca9e55f4dbb6a6945f993e4d49","abstract_canon_sha256":"8f1b434cc01372c13fc423609af0b66a53fbbb5c2773e0d707597e0ee69d426b"},"schema_version":"1.0"},"canonical_sha256":"18bbd5cc3edec7059b1c2609bb556c2fc48680961e967371764d637eef823f46","source":{"kind":"arxiv","id":"1304.1424","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1424","created_at":"2026-05-18T03:15:34Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1424v2","created_at":"2026-05-18T03:15:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1424","created_at":"2026-05-18T03:15:34Z"},{"alias_kind":"pith_short_12","alias_value":"DC55LTB633DQ","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"DC55LTB633DQLGY4","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"DC55LTB6","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DC55LTB633DQLGY4EYE3WVLMF7","target":"record","payload":{"canonical_record":{"source":{"id":"1304.1424","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-04T16:34:44Z","cross_cats_sorted":[],"title_canon_sha256":"ca5c6f315cbc8a63b73ecd1dd0764fb3268255ca9e55f4dbb6a6945f993e4d49","abstract_canon_sha256":"8f1b434cc01372c13fc423609af0b66a53fbbb5c2773e0d707597e0ee69d426b"},"schema_version":"1.0"},"canonical_sha256":"18bbd5cc3edec7059b1c2609bb556c2fc48680961e967371764d637eef823f46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:34.230423Z","signature_b64":"Xxu5lotdq56OOSlRI602BnGbk+7scd/w0gwV0OBjA947zH6Fgw/zFCra3wrG4ySq3Mr7I8/8VKTKIKHZuHHYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18bbd5cc3edec7059b1c2609bb556c2fc48680961e967371764d637eef823f46","last_reissued_at":"2026-05-18T03:15:34.229863Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:34.229863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.1424","source_version":2,"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-05-18T03:15:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0F/PEh19/0cztHz7PJOamy3Jx0qYjUL3xN+M/L6jI2qBjyij5SMZuYhtBy5od28Fyj0oS1Rre4ucCVweeSZ0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T20:22:24.722825Z"},"content_sha256":"7ba2835133ff74984c0add3296dd869f5b283639399c7fd4eed756cdea38f912","schema_version":"1.0","event_id":"sha256:7ba2835133ff74984c0add3296dd869f5b283639399c7fd4eed756cdea38f912"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DC55LTB633DQLGY4EYE3WVLMF7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved approximation for 3-dimensional matching via bounded pathwidth local search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Marek Cygan","submitted_at":"2013-04-04T16:34:44Z","abstract_excerpt":"One of the most natural optimization problems is the k-Set Packing problem, where given a family of sets of size at most k one should select a maximum size subfamily of pairwise disjoint sets. A special case of 3-Set Packing is the well known 3-Dimensional Matching problem. Both problems belong to the Karp`s list of 21 NP-complete problems. The best known polynomial time approximation ratio for k-Set Packing is (k + eps)/2 and goes back to the work of Hurkens and Schrijver [SIDMA`89], which gives (1.5 + eps)-approximation for 3-Dimensional Matching. Those results are obtained by a simple local"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1424","kind":"arxiv","version":2},"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"},"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-05-18T03:15:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X5KgwH6EeHRqwvE6SI7SQQoQgXgT5wqWJIhihBp2hrH6D09AkEznLNw6bjrcdzvWe02YmaURwQ2QbTUq0axaBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T20:22:24.723187Z"},"content_sha256":"b7399aa8cf625adba9b14a8b6f831bf420a9398822873a358c3c26b00aa60fbf","schema_version":"1.0","event_id":"sha256:b7399aa8cf625adba9b14a8b6f831bf420a9398822873a358c3c26b00aa60fbf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DC55LTB633DQLGY4EYE3WVLMF7/bundle.json","state_url":"https://pith.science/pith/DC55LTB633DQLGY4EYE3WVLMF7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DC55LTB633DQLGY4EYE3WVLMF7/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-05-23T20:22:24Z","links":{"resolver":"https://pith.science/pith/DC55LTB633DQLGY4EYE3WVLMF7","bundle":"https://pith.science/pith/DC55LTB633DQLGY4EYE3WVLMF7/bundle.json","state":"https://pith.science/pith/DC55LTB633DQLGY4EYE3WVLMF7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DC55LTB633DQLGY4EYE3WVLMF7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DC55LTB633DQLGY4EYE3WVLMF7","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":"8f1b434cc01372c13fc423609af0b66a53fbbb5c2773e0d707597e0ee69d426b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-04T16:34:44Z","title_canon_sha256":"ca5c6f315cbc8a63b73ecd1dd0764fb3268255ca9e55f4dbb6a6945f993e4d49"},"schema_version":"1.0","source":{"id":"1304.1424","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1424","created_at":"2026-05-18T03:15:34Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1424v2","created_at":"2026-05-18T03:15:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1424","created_at":"2026-05-18T03:15:34Z"},{"alias_kind":"pith_short_12","alias_value":"DC55LTB633DQ","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"DC55LTB633DQLGY4","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"DC55LTB6","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:b7399aa8cf625adba9b14a8b6f831bf420a9398822873a358c3c26b00aa60fbf","target":"graph","created_at":"2026-05-18T03:15:34Z","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"},"paper":{"abstract_excerpt":"One of the most natural optimization problems is the k-Set Packing problem, where given a family of sets of size at most k one should select a maximum size subfamily of pairwise disjoint sets. A special case of 3-Set Packing is the well known 3-Dimensional Matching problem. Both problems belong to the Karp`s list of 21 NP-complete problems. The best known polynomial time approximation ratio for k-Set Packing is (k + eps)/2 and goes back to the work of Hurkens and Schrijver [SIDMA`89], which gives (1.5 + eps)-approximation for 3-Dimensional Matching. Those results are obtained by a simple local","authors_text":"Marek Cygan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-04T16:34:44Z","title":"Improved approximation for 3-dimensional matching via bounded pathwidth local search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1424","kind":"arxiv","version":2},"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:7ba2835133ff74984c0add3296dd869f5b283639399c7fd4eed756cdea38f912","target":"record","created_at":"2026-05-18T03:15:34Z","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":"8f1b434cc01372c13fc423609af0b66a53fbbb5c2773e0d707597e0ee69d426b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-04T16:34:44Z","title_canon_sha256":"ca5c6f315cbc8a63b73ecd1dd0764fb3268255ca9e55f4dbb6a6945f993e4d49"},"schema_version":"1.0","source":{"id":"1304.1424","kind":"arxiv","version":2}},"canonical_sha256":"18bbd5cc3edec7059b1c2609bb556c2fc48680961e967371764d637eef823f46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18bbd5cc3edec7059b1c2609bb556c2fc48680961e967371764d637eef823f46","first_computed_at":"2026-05-18T03:15:34.229863Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:34.229863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xxu5lotdq56OOSlRI602BnGbk+7scd/w0gwV0OBjA947zH6Fgw/zFCra3wrG4ySq3Mr7I8/8VKTKIKHZuHHYBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:34.230423Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.1424","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ba2835133ff74984c0add3296dd869f5b283639399c7fd4eed756cdea38f912","sha256:b7399aa8cf625adba9b14a8b6f831bf420a9398822873a358c3c26b00aa60fbf"],"state_sha256":"139363c70a83ffa7ea1feca2d77aa4e657410a9a61ec7230a7ce7394e1b0bf27"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CIaCzFL9aJS5rhrgJ65mIJHRURGaBjqQChTxMHeJCbZPKczaAP9uwxxR/SSWrLWIW/k1RsyDonxKiO5PMw+fAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T20:22:24.725682Z","bundle_sha256":"023351cc8dc710975d77449ac1fafbd4ef28adc31b42f74690e9740a293ec49c"}}