{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ICIMLZ2DTCQM6OZ7CY2VKJXB7K","short_pith_number":"pith:ICIMLZ2D","schema_version":"1.0","canonical_sha256":"4090c5e74398a0cf3b3f16355526e1fab34f8392f551a8fb7792176c2177b884","source":{"kind":"arxiv","id":"2603.17489","version":4},"attestation_state":"computed","paper":{"title":"An approximation notion between P and FPTAS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A new approximation notion for NP-hard problems is strictly stronger than FPTAS but weaker than polynomial-time solvability.","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Erel Segal-Halevi, Samuel Bismuth","submitted_at":"2026-03-18T08:55:02Z","abstract_excerpt":"We present an approximation notion for NP-hard optimization problems. The notion is based on an *amortized relaxation*: the relaxed optimum of an input is the largest per-copy value attainable when many copies of the input are solved together. We prove that (assuming P != NP) the new notion is strictly stronger than FPTAS, but strictly weaker than having a polynomial-time algorithm. Our results introduce a new computational complexity class for optimization problems, which is a strict superset of P and a strict subset of FPTAS."},"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":"2603.17489","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-03-18T08:55:02Z","cross_cats_sorted":[],"title_canon_sha256":"2080cfc63236a0532145b829a249864535cbf7cce1405198fcdd7b3d2e91f53f","abstract_canon_sha256":"075067707c5099998551a2d4b1cb75682eabda6ce5f65e4285b07989f6a1f4fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-13T01:18:05.534795Z","signature_b64":"OE2ZyhQGWeIdxpR/NF+ktbHbPBWEsLstLpBENnZ2fO0oQo2W421xFUtXw1siEsv75/vGxVZpxHtlh1OGnEW/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4090c5e74398a0cf3b3f16355526e1fab34f8392f551a8fb7792176c2177b884","last_reissued_at":"2026-07-13T01:18:05.533589Z","signature_status":"signed_v1","first_computed_at":"2026-07-13T01:18:05.533589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An approximation notion between P and FPTAS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A new approximation notion for NP-hard problems is strictly stronger than FPTAS but weaker than polynomial-time solvability.","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Erel Segal-Halevi, Samuel Bismuth","submitted_at":"2026-03-18T08:55:02Z","abstract_excerpt":"We present an approximation notion for NP-hard optimization problems. The notion is based on an *amortized relaxation*: the relaxed optimum of an input is the largest per-copy value attainable when many copies of the input are solved together. We prove that (assuming P != NP) the new notion is strictly stronger than FPTAS, but strictly weaker than having a polynomial-time algorithm. Our results introduce a new computational complexity class for optimization problems, which is a strict superset of P and a strict subset of FPTAS."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We prove that (assuming P != NP) the new notion is strictly stronger than FPTAS, but strictly weaker than having a polynomial-time algorithm.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The optimization problems must be representable by binary functions, and the standard assumption P ≠ NP must hold for the strict separation to be meaningful.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A new approximation notion for binary-function NP-hard problems is strictly stronger than FPTAS yet strictly weaker than polynomial-time algorithms, assuming P ≠ NP.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A new approximation notion for NP-hard problems is strictly stronger than FPTAS but weaker than polynomial-time solvability.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"b35ce977e41160d59580a25ea7c2dff20e97cd7e011e9f2b29bcefe0739941af"},"source":{"id":"2603.17489","kind":"arxiv","version":4},"verdict":{"id":"0a0f9f40-c82a-4b9d-81d1-44b8076d1ee4","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T08:48:25.598755Z","strongest_claim":"We prove that (assuming P != NP) the new notion is strictly stronger than FPTAS, but strictly weaker than having a polynomial-time algorithm.","one_line_summary":"A new approximation notion for binary-function NP-hard problems is strictly stronger than FPTAS yet strictly weaker than polynomial-time algorithms, assuming P ≠ NP.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The optimization problems must be representable by binary functions, and the standard assumption P ≠ NP must hold for the strict separation to be meaningful.","pith_extraction_headline":"A new approximation notion for NP-hard problems is strictly stronger than FPTAS but weaker than polynomial-time solvability."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.17489/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2603.17489","created_at":"2026-07-13T01:18:05.534141+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.17489v4","created_at":"2026-07-13T01:18:05.534141+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.17489","created_at":"2026-07-13T01:18:05.534141+00:00"},{"alias_kind":"pith_short_12","alias_value":"ICIMLZ2DTCQM","created_at":"2026-07-13T01:18:05.534141+00:00"},{"alias_kind":"pith_short_16","alias_value":"ICIMLZ2DTCQM6OZ7","created_at":"2026-07-13T01:18:05.534141+00:00"},{"alias_kind":"pith_short_8","alias_value":"ICIMLZ2D","created_at":"2026-07-13T01:18:05.534141+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/ICIMLZ2DTCQM6OZ7CY2VKJXB7K","json":"https://pith.science/pith/ICIMLZ2DTCQM6OZ7CY2VKJXB7K.json","graph_json":"https://pith.science/api/pith-number/ICIMLZ2DTCQM6OZ7CY2VKJXB7K/graph.json","events_json":"https://pith.science/api/pith-number/ICIMLZ2DTCQM6OZ7CY2VKJXB7K/events.json","paper":"https://pith.science/paper/ICIMLZ2D"},"agent_actions":{"view_html":"https://pith.science/pith/ICIMLZ2DTCQM6OZ7CY2VKJXB7K","download_json":"https://pith.science/pith/ICIMLZ2DTCQM6OZ7CY2VKJXB7K.json","view_paper":"https://pith.science/paper/ICIMLZ2D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.17489&json=true","fetch_graph":"https://pith.science/api/pith-number/ICIMLZ2DTCQM6OZ7CY2VKJXB7K/graph.json","fetch_events":"https://pith.science/api/pith-number/ICIMLZ2DTCQM6OZ7CY2VKJXB7K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ICIMLZ2DTCQM6OZ7CY2VKJXB7K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ICIMLZ2DTCQM6OZ7CY2VKJXB7K/action/storage_attestation","attest_author":"https://pith.science/pith/ICIMLZ2DTCQM6OZ7CY2VKJXB7K/action/author_attestation","sign_citation":"https://pith.science/pith/ICIMLZ2DTCQM6OZ7CY2VKJXB7K/action/citation_signature","submit_replication":"https://pith.science/pith/ICIMLZ2DTCQM6OZ7CY2VKJXB7K/action/replication_record"}},"created_at":"2026-07-13T01:18:05.534141+00:00","updated_at":"2026-07-13T01:18:05.534141+00:00"}