{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5QIDZOTFNYU4YDCP4NDREW6S3N","short_pith_number":"pith:5QIDZOTF","canonical_record":{"source":{"id":"1506.06284","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-20T19:20:23Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"22916741eb01d031b242577de263773c9c809b75221aa13076779f3a2934c3e1","abstract_canon_sha256":"5435df2ee845d1c83c69caed54daa4a445ed9739d8d800ac2d49deca6c4f02ce"},"schema_version":"1.0"},"canonical_sha256":"ec103cba656e29cc0c4fe347125bd2db596462bc187d8932ae93333e1d77d442","source":{"kind":"arxiv","id":"1506.06284","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06284","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06284v1","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06284","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"pith_short_12","alias_value":"5QIDZOTFNYU4","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5QIDZOTFNYU4YDCP","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5QIDZOTF","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5QIDZOTFNYU4YDCP4NDREW6S3N","target":"record","payload":{"canonical_record":{"source":{"id":"1506.06284","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-20T19:20:23Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"22916741eb01d031b242577de263773c9c809b75221aa13076779f3a2934c3e1","abstract_canon_sha256":"5435df2ee845d1c83c69caed54daa4a445ed9739d8d800ac2d49deca6c4f02ce"},"schema_version":"1.0"},"canonical_sha256":"ec103cba656e29cc0c4fe347125bd2db596462bc187d8932ae93333e1d77d442","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:41:45.611007Z","signature_b64":"pcZCTllj6+NnpwWBaSrPmEeZVUjprZlwH2e7MOfEl4ZYvAXEtdZ0k4G0VG4/Gy0W7yocUZpImZpVXOJgMBIxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec103cba656e29cc0c4fe347125bd2db596462bc187d8932ae93333e1d77d442","last_reissued_at":"2026-05-18T01:41:45.609962Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:41:45.609962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.06284","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-18T01:41:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WFWTgW7T0Qo8BW2Csrc0jrBHljkhXQU9OsJydcp7Q7Y7zN5AHEaIjYnlO7aAgVP3qzQRiszLpJo1jAfB3WLMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:25:56.760032Z"},"content_sha256":"ae12e72b121142f3797d55f0f9ae41b4504922288a4e96231f18cca122968a1b","schema_version":"1.0","event_id":"sha256:ae12e72b121142f3797d55f0f9ae41b4504922288a4e96231f18cca122968a1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5QIDZOTFNYU4YDCP4NDREW6S3N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Upper bound on the number of steps for solving the subset sum problem by the Branch-and-Bound method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Mikhail Posypkin, Roman Kolpakov","submitted_at":"2015-06-20T19:20:23Z","abstract_excerpt":"We study the computational complexity of one of the particular cases of the knapsack problem: the subset sum problem. For solving this problem we consider one of the basic variants of the Branch-and-Bound method in which any sub-problem is decomposed along the free variable with the maximal weight. By the complexity of solving a problem by the Branch-and-Bound method we mean the number of steps required for solving the problem by this method. In the paper we obtain upper bounds on the complexity of solving the subset sum problem by the Branch-and-Bound method. These bounds can be easily comput"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06284","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-18T01:41:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cchc8dg6cjUEkX/95khEJB5/d4tp7TjyOKq/JTSdJGV/vtnvQ1Hz4evtpHHCX0m5N9QUivSw6MeY3BWaXV1jDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:25:56.760399Z"},"content_sha256":"0d2c11e4ac949fe19a5e3825f8bca1f3745920d93fb218140e5718e5de4cb548","schema_version":"1.0","event_id":"sha256:0d2c11e4ac949fe19a5e3825f8bca1f3745920d93fb218140e5718e5de4cb548"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5QIDZOTFNYU4YDCP4NDREW6S3N/bundle.json","state_url":"https://pith.science/pith/5QIDZOTFNYU4YDCP4NDREW6S3N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5QIDZOTFNYU4YDCP4NDREW6S3N/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-31T17:25:56Z","links":{"resolver":"https://pith.science/pith/5QIDZOTFNYU4YDCP4NDREW6S3N","bundle":"https://pith.science/pith/5QIDZOTFNYU4YDCP4NDREW6S3N/bundle.json","state":"https://pith.science/pith/5QIDZOTFNYU4YDCP4NDREW6S3N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5QIDZOTFNYU4YDCP4NDREW6S3N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5QIDZOTFNYU4YDCP4NDREW6S3N","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":"5435df2ee845d1c83c69caed54daa4a445ed9739d8d800ac2d49deca6c4f02ce","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-20T19:20:23Z","title_canon_sha256":"22916741eb01d031b242577de263773c9c809b75221aa13076779f3a2934c3e1"},"schema_version":"1.0","source":{"id":"1506.06284","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06284","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06284v1","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06284","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"pith_short_12","alias_value":"5QIDZOTFNYU4","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5QIDZOTFNYU4YDCP","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5QIDZOTF","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:0d2c11e4ac949fe19a5e3825f8bca1f3745920d93fb218140e5718e5de4cb548","target":"graph","created_at":"2026-05-18T01:41:45Z","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":"We study the computational complexity of one of the particular cases of the knapsack problem: the subset sum problem. For solving this problem we consider one of the basic variants of the Branch-and-Bound method in which any sub-problem is decomposed along the free variable with the maximal weight. By the complexity of solving a problem by the Branch-and-Bound method we mean the number of steps required for solving the problem by this method. In the paper we obtain upper bounds on the complexity of solving the subset sum problem by the Branch-and-Bound method. These bounds can be easily comput","authors_text":"Mikhail Posypkin, Roman Kolpakov","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-20T19:20:23Z","title":"Upper bound on the number of steps for solving the subset sum problem by the Branch-and-Bound method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06284","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:ae12e72b121142f3797d55f0f9ae41b4504922288a4e96231f18cca122968a1b","target":"record","created_at":"2026-05-18T01:41:45Z","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":"5435df2ee845d1c83c69caed54daa4a445ed9739d8d800ac2d49deca6c4f02ce","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-20T19:20:23Z","title_canon_sha256":"22916741eb01d031b242577de263773c9c809b75221aa13076779f3a2934c3e1"},"schema_version":"1.0","source":{"id":"1506.06284","kind":"arxiv","version":1}},"canonical_sha256":"ec103cba656e29cc0c4fe347125bd2db596462bc187d8932ae93333e1d77d442","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec103cba656e29cc0c4fe347125bd2db596462bc187d8932ae93333e1d77d442","first_computed_at":"2026-05-18T01:41:45.609962Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:41:45.609962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pcZCTllj6+NnpwWBaSrPmEeZVUjprZlwH2e7MOfEl4ZYvAXEtdZ0k4G0VG4/Gy0W7yocUZpImZpVXOJgMBIxCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:41:45.611007Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.06284","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae12e72b121142f3797d55f0f9ae41b4504922288a4e96231f18cca122968a1b","sha256:0d2c11e4ac949fe19a5e3825f8bca1f3745920d93fb218140e5718e5de4cb548"],"state_sha256":"8177844d663baa526281f3593c46ef5ebfb7cc6a5616f2d11cffb5979bd43104"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MNrFfD5SV78f3kc7Hx2fdr+/HnG4sWH+5OvTx1hpflha/pcuXxxiMKm5/OE+UHIT+H6n/Nl7CGhxPq76L8jGDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:25:56.762478Z","bundle_sha256":"fcda4e794584dc120982858be97aec790871cb20392a51aa9f0eae10d3528fde"}}