{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PGAZKGF5AO5ZNEBL2SQ4QVNAE7","short_pith_number":"pith:PGAZKGF5","canonical_record":{"source":{"id":"1802.09465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-02-26T17:23:02Z","cross_cats_sorted":["cs.AI","cs.CC"],"title_canon_sha256":"19e8878ac039e69143c576ab730a773d02acd80072b7971e40a4b93751f8562d","abstract_canon_sha256":"fac2586e3d8d509007ae48c8fc703498310761d4759f069ab440cf5c761b9f58"},"schema_version":"1.0"},"canonical_sha256":"79819518bd03bb96902bd4a1c855a027ef464a8ad51e9ba636d1f3153a5545e3","source":{"kind":"arxiv","id":"1802.09465","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09465","created_at":"2026-05-18T00:22:33Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09465v1","created_at":"2026-05-18T00:22:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09465","created_at":"2026-05-18T00:22:33Z"},{"alias_kind":"pith_short_12","alias_value":"PGAZKGF5AO5Z","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PGAZKGF5AO5ZNEBL","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PGAZKGF5","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PGAZKGF5AO5ZNEBL2SQ4QVNAE7","target":"record","payload":{"canonical_record":{"source":{"id":"1802.09465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-02-26T17:23:02Z","cross_cats_sorted":["cs.AI","cs.CC"],"title_canon_sha256":"19e8878ac039e69143c576ab730a773d02acd80072b7971e40a4b93751f8562d","abstract_canon_sha256":"fac2586e3d8d509007ae48c8fc703498310761d4759f069ab440cf5c761b9f58"},"schema_version":"1.0"},"canonical_sha256":"79819518bd03bb96902bd4a1c855a027ef464a8ad51e9ba636d1f3153a5545e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:33.646087Z","signature_b64":"Vk2by2Gbg2fLaJmvAc33rCbMB2fMlAhkL/96eeI8RgZ1pOgopXEXG8D7zxlv4Z3ug4Cx4D+jAnBQVESxjd4CAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79819518bd03bb96902bd4a1c855a027ef464a8ad51e9ba636d1f3153a5545e3","last_reissued_at":"2026-05-18T00:22:33.645631Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:33.645631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.09465","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-05-18T00:22:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vhTcezJN9g+vhSmhxaUIxw9MaSq0gBModIi9MtgcA2YuHRB9YqfNF5I4FF27m0tXNqE5W0lLinpghdZ457qxCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:39:07.102965Z"},"content_sha256":"23ab2465c06edf936bb495644e2519679cb876631cb744e7aff0b369a7ee939b","schema_version":"1.0","event_id":"sha256:23ab2465c06edf936bb495644e2519679cb876631cb744e7aff0b369a7ee939b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PGAZKGF5AO5ZNEBL2SQ4QVNAE7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Strong NP-Completeness of Rational Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC"],"primary_cat":"cs.DM","authors_text":"Dominik Wojtczak","submitted_at":"2018-02-26T17:23:02Z","abstract_excerpt":"The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems and their multiple variants were studied in numerous papers in the past where all the weights and profits were assumed to be integers. We re-examine here the computational complexity of all these problems in the setting where the weights and profits are allowed to be any rational numbers. We show that all of these problems in this setting become strongly NP-complete and, as a result, no pseudo-polynomial algorithm can exist for solving them unless P=NP. Despite this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09465","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":""},"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-18T00:22:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZMyVZwUF67xyA/WXcpNe6BYPxPiTXqXInwhJrJuDMV9HcCsK/Uuw7uOby+F5nulCiT9V618vdlA/E7y7SPMZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:39:07.103365Z"},"content_sha256":"1e87d6a2a22a099d747bcfba776422be2b859613dce4a0c963fde1f478c158aa","schema_version":"1.0","event_id":"sha256:1e87d6a2a22a099d747bcfba776422be2b859613dce4a0c963fde1f478c158aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PGAZKGF5AO5ZNEBL2SQ4QVNAE7/bundle.json","state_url":"https://pith.science/pith/PGAZKGF5AO5ZNEBL2SQ4QVNAE7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PGAZKGF5AO5ZNEBL2SQ4QVNAE7/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-06-07T11:39:07Z","links":{"resolver":"https://pith.science/pith/PGAZKGF5AO5ZNEBL2SQ4QVNAE7","bundle":"https://pith.science/pith/PGAZKGF5AO5ZNEBL2SQ4QVNAE7/bundle.json","state":"https://pith.science/pith/PGAZKGF5AO5ZNEBL2SQ4QVNAE7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PGAZKGF5AO5ZNEBL2SQ4QVNAE7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PGAZKGF5AO5ZNEBL2SQ4QVNAE7","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":"fac2586e3d8d509007ae48c8fc703498310761d4759f069ab440cf5c761b9f58","cross_cats_sorted":["cs.AI","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-02-26T17:23:02Z","title_canon_sha256":"19e8878ac039e69143c576ab730a773d02acd80072b7971e40a4b93751f8562d"},"schema_version":"1.0","source":{"id":"1802.09465","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09465","created_at":"2026-05-18T00:22:33Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09465v1","created_at":"2026-05-18T00:22:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09465","created_at":"2026-05-18T00:22:33Z"},{"alias_kind":"pith_short_12","alias_value":"PGAZKGF5AO5Z","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PGAZKGF5AO5ZNEBL","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PGAZKGF5","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:1e87d6a2a22a099d747bcfba776422be2b859613dce4a0c963fde1f478c158aa","target":"graph","created_at":"2026-05-18T00:22:33Z","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":"The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems and their multiple variants were studied in numerous papers in the past where all the weights and profits were assumed to be integers. We re-examine here the computational complexity of all these problems in the setting where the weights and profits are allowed to be any rational numbers. We show that all of these problems in this setting become strongly NP-complete and, as a result, no pseudo-polynomial algorithm can exist for solving them unless P=NP. Despite this","authors_text":"Dominik Wojtczak","cross_cats":["cs.AI","cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-02-26T17:23:02Z","title":"On Strong NP-Completeness of Rational Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09465","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:23ab2465c06edf936bb495644e2519679cb876631cb744e7aff0b369a7ee939b","target":"record","created_at":"2026-05-18T00:22:33Z","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":"fac2586e3d8d509007ae48c8fc703498310761d4759f069ab440cf5c761b9f58","cross_cats_sorted":["cs.AI","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-02-26T17:23:02Z","title_canon_sha256":"19e8878ac039e69143c576ab730a773d02acd80072b7971e40a4b93751f8562d"},"schema_version":"1.0","source":{"id":"1802.09465","kind":"arxiv","version":1}},"canonical_sha256":"79819518bd03bb96902bd4a1c855a027ef464a8ad51e9ba636d1f3153a5545e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79819518bd03bb96902bd4a1c855a027ef464a8ad51e9ba636d1f3153a5545e3","first_computed_at":"2026-05-18T00:22:33.645631Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:33.645631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vk2by2Gbg2fLaJmvAc33rCbMB2fMlAhkL/96eeI8RgZ1pOgopXEXG8D7zxlv4Z3ug4Cx4D+jAnBQVESxjd4CAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:33.646087Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09465","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23ab2465c06edf936bb495644e2519679cb876631cb744e7aff0b369a7ee939b","sha256:1e87d6a2a22a099d747bcfba776422be2b859613dce4a0c963fde1f478c158aa"],"state_sha256":"75310caae42e2aaa739eff5ebb9ca22eeaf7a206abfde1bcadc8d16e8315adfd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/zzUtCaFZDtPSzU1QbPiRkCIYDNk7OvUZzU0NJkxvwPcSkERj8rJERMSixmKiFVmzWoGELfnc2DvPyGbaaU3Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T11:39:07.106887Z","bundle_sha256":"9a04eba49455003730461c5bddb418c2bd5a57602370d72bf8ebe761bab743b4"}}