{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:XNTAFBY5TYSRDQXHRN5UFAG55H","short_pith_number":"pith:XNTAFBY5","canonical_record":{"source":{"id":"0905.0848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-05-06T14:58:02Z","cross_cats_sorted":[],"title_canon_sha256":"0272005c31833be069bb731bb41d462063496ea5417e6349111eb795f0ebda65","abstract_canon_sha256":"b39b7b885b1f7e2e6faa3f7fadf1bb6c548153a0c748127a626f176792dce8c1"},"schema_version":"1.0"},"canonical_sha256":"bb6602871d9e2511c2e78b7b4280dde9d1f1f55c423f542f983f7022c4d64d3a","source":{"kind":"arxiv","id":"0905.0848","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.0848","created_at":"2026-07-04T15:42:13Z"},{"alias_kind":"arxiv_version","alias_value":"0905.0848v1","created_at":"2026-07-04T15:42:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.0848","created_at":"2026-07-04T15:42:13Z"},{"alias_kind":"pith_short_12","alias_value":"XNTAFBY5TYSR","created_at":"2026-07-04T15:42:13Z"},{"alias_kind":"pith_short_16","alias_value":"XNTAFBY5TYSRDQXH","created_at":"2026-07-04T15:42:13Z"},{"alias_kind":"pith_short_8","alias_value":"XNTAFBY5","created_at":"2026-07-04T15:42:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:XNTAFBY5TYSRDQXHRN5UFAG55H","target":"record","payload":{"canonical_record":{"source":{"id":"0905.0848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-05-06T14:58:02Z","cross_cats_sorted":[],"title_canon_sha256":"0272005c31833be069bb731bb41d462063496ea5417e6349111eb795f0ebda65","abstract_canon_sha256":"b39b7b885b1f7e2e6faa3f7fadf1bb6c548153a0c748127a626f176792dce8c1"},"schema_version":"1.0"},"canonical_sha256":"bb6602871d9e2511c2e78b7b4280dde9d1f1f55c423f542f983f7022c4d64d3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:42:13.641607Z","signature_b64":"6PpjC5R/E6O1bKwbEC3sIsbpCWqs/QO7B2prT8iy6N9nNwkx0VpI7B9v1MNl/VshG9nGPPOYp1v70hUi+7n5AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb6602871d9e2511c2e78b7b4280dde9d1f1f55c423f542f983f7022c4d64d3a","last_reissued_at":"2026-07-04T15:42:13.641181Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:42:13.641181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0905.0848","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-04T15:42:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z8PijXyAtOxGDNuLiSoNtCn05tDF7sEBa/tO4OwpIb53sWzq0bzk23l0sTyzK7Kdpy5QcBo5KbHjTqIzRCu/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T03:27:30.433944Z"},"content_sha256":"8993865ff1e867d06e469be29bcc9c2ace4aa29a1822952a20ecc581ea1589d2","schema_version":"1.0","event_id":"sha256:8993865ff1e867d06e469be29bcc9c2ace4aa29a1822952a20ecc581ea1589d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:XNTAFBY5TYSRDQXHRN5UFAG55H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"EMA), Michel Vasquez (LGI2P, Philippe Michelon (LIA), Said Hanafi (LAMIH), Sylvain Boussier (LIA), Yannick Vimont (LGI2P)","submitted_at":"2009-05-06T14:58:02Z","abstract_excerpt":"We propose an exact method which combines the resolution search and branch & bound algorithms for solving the 0?1 Multidimensional Knapsack Problem. This algorithm is able to prove large?scale strong correlated instances. The optimal values of the 10 constraint, 500 variable instances of the OR-Library are exposed. These values were previously unknown."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.0848","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/0905.0848/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-04T15:42:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mJ8PuApbSypi7n5os2lif/Ceauw4elizGeDFaMyDxM5uEWt1O1mDyCm+ryPCzI3tdtMJ6Z7PV+M2UmYQMClYCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T03:27:30.434327Z"},"content_sha256":"f1fc7bd905ef81e3a2d0e5df01ad6a213ac594d786a6de99f6455f0d98f0e36c","schema_version":"1.0","event_id":"sha256:f1fc7bd905ef81e3a2d0e5df01ad6a213ac594d786a6de99f6455f0d98f0e36c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XNTAFBY5TYSRDQXHRN5UFAG55H/bundle.json","state_url":"https://pith.science/pith/XNTAFBY5TYSRDQXHRN5UFAG55H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XNTAFBY5TYSRDQXHRN5UFAG55H/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-07-05T03:27:30Z","links":{"resolver":"https://pith.science/pith/XNTAFBY5TYSRDQXHRN5UFAG55H","bundle":"https://pith.science/pith/XNTAFBY5TYSRDQXHRN5UFAG55H/bundle.json","state":"https://pith.science/pith/XNTAFBY5TYSRDQXHRN5UFAG55H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XNTAFBY5TYSRDQXHRN5UFAG55H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:XNTAFBY5TYSRDQXHRN5UFAG55H","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":"b39b7b885b1f7e2e6faa3f7fadf1bb6c548153a0c748127a626f176792dce8c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-05-06T14:58:02Z","title_canon_sha256":"0272005c31833be069bb731bb41d462063496ea5417e6349111eb795f0ebda65"},"schema_version":"1.0","source":{"id":"0905.0848","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.0848","created_at":"2026-07-04T15:42:13Z"},{"alias_kind":"arxiv_version","alias_value":"0905.0848v1","created_at":"2026-07-04T15:42:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.0848","created_at":"2026-07-04T15:42:13Z"},{"alias_kind":"pith_short_12","alias_value":"XNTAFBY5TYSR","created_at":"2026-07-04T15:42:13Z"},{"alias_kind":"pith_short_16","alias_value":"XNTAFBY5TYSRDQXH","created_at":"2026-07-04T15:42:13Z"},{"alias_kind":"pith_short_8","alias_value":"XNTAFBY5","created_at":"2026-07-04T15:42:13Z"}],"graph_snapshots":[{"event_id":"sha256:f1fc7bd905ef81e3a2d0e5df01ad6a213ac594d786a6de99f6455f0d98f0e36c","target":"graph","created_at":"2026-07-04T15:42:13Z","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/0905.0848/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose an exact method which combines the resolution search and branch & bound algorithms for solving the 0?1 Multidimensional Knapsack Problem. This algorithm is able to prove large?scale strong correlated instances. The optimal values of the 10 constraint, 500 variable instances of the OR-Library are exposed. These values were previously unknown.","authors_text":"EMA), Michel Vasquez (LGI2P, Philippe Michelon (LIA), Said Hanafi (LAMIH), Sylvain Boussier (LIA), Yannick Vimont (LGI2P)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-05-06T14:58:02Z","title":"Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.0848","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:8993865ff1e867d06e469be29bcc9c2ace4aa29a1822952a20ecc581ea1589d2","target":"record","created_at":"2026-07-04T15:42:13Z","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":"b39b7b885b1f7e2e6faa3f7fadf1bb6c548153a0c748127a626f176792dce8c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-05-06T14:58:02Z","title_canon_sha256":"0272005c31833be069bb731bb41d462063496ea5417e6349111eb795f0ebda65"},"schema_version":"1.0","source":{"id":"0905.0848","kind":"arxiv","version":1}},"canonical_sha256":"bb6602871d9e2511c2e78b7b4280dde9d1f1f55c423f542f983f7022c4d64d3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb6602871d9e2511c2e78b7b4280dde9d1f1f55c423f542f983f7022c4d64d3a","first_computed_at":"2026-07-04T15:42:13.641181Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:42:13.641181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6PpjC5R/E6O1bKwbEC3sIsbpCWqs/QO7B2prT8iy6N9nNwkx0VpI7B9v1MNl/VshG9nGPPOYp1v70hUi+7n5AQ==","signature_status":"signed_v1","signed_at":"2026-07-04T15:42:13.641607Z","signed_message":"canonical_sha256_bytes"},"source_id":"0905.0848","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8993865ff1e867d06e469be29bcc9c2ace4aa29a1822952a20ecc581ea1589d2","sha256:f1fc7bd905ef81e3a2d0e5df01ad6a213ac594d786a6de99f6455f0d98f0e36c"],"state_sha256":"067668fc9f7a19223fbc7313b78a386a0bee4d24438e7ce7dca36b6d1e45e11c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"quzW7wIvozYO77qvKPwpLsqIxpM7MAbmsvRchaz4A+EPF7Tk5gUKmIzD8AjTCau/Ag3vdPUA5ql1l2GFbIbjAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T03:27:30.436336Z","bundle_sha256":"3c37b7c0114a85b514bba6211e71b34ec729ec6d64d54fbe335e912345cdbc65"}}