{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MXPNXP7DOKZHQGPLCOIUHR35HE","short_pith_number":"pith:MXPNXP7D","schema_version":"1.0","canonical_sha256":"65dedbbfe372b27819eb139143c77d39350494747aca81374c9b120f45399a3d","source":{"kind":"arxiv","id":"1704.06928","version":1},"attestation_state":"computed","paper":{"title":"A New Fully Polynomial Time Approximation Scheme for the Interval Subset Sum Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","math.OC"],"primary_cat":"cs.DS","authors_text":"Rui Diao, Ya-Feng Liu, Yu-Hong Dai","submitted_at":"2017-04-23T14:41:26Z","abstract_excerpt":"The interval subset sum problem (ISSP) is a generalization of the well-known subset sum problem. Given a set of intervals $\\left\\{[a_{i,1},a_{i,2}]\\right\\}_{i=1}^n$ and a target integer $T,$ the ISSP is to find a set of integers, at most one from each interval, such that their sum best approximates the target $T$ but cannot exceed it. In this paper, we first study the computational complexity of the ISSP. We show that the ISSP is relatively easy to solve compared to the 0-1 Knapsack problem (KP). We also identify several subclasses of the ISSP which are polynomial time solvable (with high prob"},"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":"1704.06928","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-23T14:41:26Z","cross_cats_sorted":["math.NA","math.OC"],"title_canon_sha256":"6a5c353564ce7a6b250fa60ee7259024798f0b9bf63cf26a7d3c0de1e3d7d370","abstract_canon_sha256":"cdf079ce88d9384a88f98d7379351d50e921c3369b8aa2b393a863b1acdc49d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:55.315028Z","signature_b64":"KaskMKCGGLjPXWC9BdTG3hWfzxCqBpHIzw/yHD70O6cnAkV/oWEkC+TzeI+BdQBGc6vnHhP4+56W6U40ehkNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65dedbbfe372b27819eb139143c77d39350494747aca81374c9b120f45399a3d","last_reissued_at":"2026-05-18T00:45:55.314361Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:55.314361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Fully Polynomial Time Approximation Scheme for the Interval Subset Sum Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","math.OC"],"primary_cat":"cs.DS","authors_text":"Rui Diao, Ya-Feng Liu, Yu-Hong Dai","submitted_at":"2017-04-23T14:41:26Z","abstract_excerpt":"The interval subset sum problem (ISSP) is a generalization of the well-known subset sum problem. Given a set of intervals $\\left\\{[a_{i,1},a_{i,2}]\\right\\}_{i=1}^n$ and a target integer $T,$ the ISSP is to find a set of integers, at most one from each interval, such that their sum best approximates the target $T$ but cannot exceed it. In this paper, we first study the computational complexity of the ISSP. We show that the ISSP is relatively easy to solve compared to the 0-1 Knapsack problem (KP). We also identify several subclasses of the ISSP which are polynomial time solvable (with high prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06928","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":"1704.06928","created_at":"2026-05-18T00:45:55.314453+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.06928v1","created_at":"2026-05-18T00:45:55.314453+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06928","created_at":"2026-05-18T00:45:55.314453+00:00"},{"alias_kind":"pith_short_12","alias_value":"MXPNXP7DOKZH","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MXPNXP7DOKZHQGPL","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MXPNXP7D","created_at":"2026-05-18T12:31:31.346846+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/MXPNXP7DOKZHQGPLCOIUHR35HE","json":"https://pith.science/pith/MXPNXP7DOKZHQGPLCOIUHR35HE.json","graph_json":"https://pith.science/api/pith-number/MXPNXP7DOKZHQGPLCOIUHR35HE/graph.json","events_json":"https://pith.science/api/pith-number/MXPNXP7DOKZHQGPLCOIUHR35HE/events.json","paper":"https://pith.science/paper/MXPNXP7D"},"agent_actions":{"view_html":"https://pith.science/pith/MXPNXP7DOKZHQGPLCOIUHR35HE","download_json":"https://pith.science/pith/MXPNXP7DOKZHQGPLCOIUHR35HE.json","view_paper":"https://pith.science/paper/MXPNXP7D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.06928&json=true","fetch_graph":"https://pith.science/api/pith-number/MXPNXP7DOKZHQGPLCOIUHR35HE/graph.json","fetch_events":"https://pith.science/api/pith-number/MXPNXP7DOKZHQGPLCOIUHR35HE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MXPNXP7DOKZHQGPLCOIUHR35HE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MXPNXP7DOKZHQGPLCOIUHR35HE/action/storage_attestation","attest_author":"https://pith.science/pith/MXPNXP7DOKZHQGPLCOIUHR35HE/action/author_attestation","sign_citation":"https://pith.science/pith/MXPNXP7DOKZHQGPLCOIUHR35HE/action/citation_signature","submit_replication":"https://pith.science/pith/MXPNXP7DOKZHQGPLCOIUHR35HE/action/replication_record"}},"created_at":"2026-05-18T00:45:55.314453+00:00","updated_at":"2026-05-18T00:45:55.314453+00:00"}