{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FOQJHNNAG7YC67NTUHGPCBAZ4A","short_pith_number":"pith:FOQJHNNA","schema_version":"1.0","canonical_sha256":"2ba093b5a037f02f7db3a1ccf10419e001c48365a711113f186487a9f30bec25","source":{"kind":"arxiv","id":"1406.3131","version":1},"attestation_state":"computed","paper":{"title":"On the Sequential Multiknapsack polytope","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Paolo Detti","submitted_at":"2014-06-12T06:52:05Z","abstract_excerpt":"The Sequential Multiple Knapsack Problem is a special case of Multiple knapsack problem in which the items sizes are divisible. A characterization of the optimal solutions of the problem and a description of the convex hull of all the integer solutions are presented. More precisely, it is shown that a new formulation of the problem allows to generate a decomposition approach for enumerating all optimal solutions of the problem. Such a decomposition approach is used for finding the inequalities (defined by an inductive scheme) describing the Sequential Multiple Knapsack polytope."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1406.3131","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-12T06:52:05Z","cross_cats_sorted":[],"title_canon_sha256":"d35b44799f2c0eac4bd6c1666c7764cf3ebb95a26b9b4ff8deb506916598012a","abstract_canon_sha256":"7cdd9d0094ae9900a60126d2d8f4eb4dd82f028e255e739ee0541552c420a6f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:52.972286Z","signature_b64":"llvJztxlQUuj/6bw1CjbE6+vm8kCgyqYtxq4BhSmtSLlMNSBpUT7SX8j6ZxCNWb3+Pf9ZrlWJ2BHZL2cuuNODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ba093b5a037f02f7db3a1ccf10419e001c48365a711113f186487a9f30bec25","last_reissued_at":"2026-05-18T02:49:52.971779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:52.971779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Sequential Multiknapsack polytope","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Paolo Detti","submitted_at":"2014-06-12T06:52:05Z","abstract_excerpt":"The Sequential Multiple Knapsack Problem is a special case of Multiple knapsack problem in which the items sizes are divisible. A characterization of the optimal solutions of the problem and a description of the convex hull of all the integer solutions are presented. More precisely, it is shown that a new formulation of the problem allows to generate a decomposition approach for enumerating all optimal solutions of the problem. Such a decomposition approach is used for finding the inequalities (defined by an inductive scheme) describing the Sequential Multiple Knapsack polytope."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3131","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1406.3131","created_at":"2026-05-18T02:49:52.971854+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.3131v1","created_at":"2026-05-18T02:49:52.971854+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3131","created_at":"2026-05-18T02:49:52.971854+00:00"},{"alias_kind":"pith_short_12","alias_value":"FOQJHNNAG7YC","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FOQJHNNAG7YC67NT","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FOQJHNNA","created_at":"2026-05-18T12:28:28.263976+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FOQJHNNAG7YC67NTUHGPCBAZ4A","json":"https://pith.science/pith/FOQJHNNAG7YC67NTUHGPCBAZ4A.json","graph_json":"https://pith.science/api/pith-number/FOQJHNNAG7YC67NTUHGPCBAZ4A/graph.json","events_json":"https://pith.science/api/pith-number/FOQJHNNAG7YC67NTUHGPCBAZ4A/events.json","paper":"https://pith.science/paper/FOQJHNNA"},"agent_actions":{"view_html":"https://pith.science/pith/FOQJHNNAG7YC67NTUHGPCBAZ4A","download_json":"https://pith.science/pith/FOQJHNNAG7YC67NTUHGPCBAZ4A.json","view_paper":"https://pith.science/paper/FOQJHNNA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.3131&json=true","fetch_graph":"https://pith.science/api/pith-number/FOQJHNNAG7YC67NTUHGPCBAZ4A/graph.json","fetch_events":"https://pith.science/api/pith-number/FOQJHNNAG7YC67NTUHGPCBAZ4A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FOQJHNNAG7YC67NTUHGPCBAZ4A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FOQJHNNAG7YC67NTUHGPCBAZ4A/action/storage_attestation","attest_author":"https://pith.science/pith/FOQJHNNAG7YC67NTUHGPCBAZ4A/action/author_attestation","sign_citation":"https://pith.science/pith/FOQJHNNAG7YC67NTUHGPCBAZ4A/action/citation_signature","submit_replication":"https://pith.science/pith/FOQJHNNAG7YC67NTUHGPCBAZ4A/action/replication_record"}},"created_at":"2026-05-18T02:49:52.971854+00:00","updated_at":"2026-05-18T02:49:52.971854+00:00"}