{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ICIMLZ2DTCQM6OZ7CY2VKJXB7K","short_pith_number":"pith:ICIMLZ2D","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"},"canonical_sha256":"4090c5e74398a0cf3b3f16355526e1fab34f8392f551a8fb7792176c2177b884","source":{"kind":"arxiv","id":"2603.17489","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.17489","created_at":"2026-07-13T01:18:05Z"},{"alias_kind":"arxiv_version","alias_value":"2603.17489v4","created_at":"2026-07-13T01:18:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.17489","created_at":"2026-07-13T01:18:05Z"},{"alias_kind":"pith_short_12","alias_value":"ICIMLZ2DTCQM","created_at":"2026-07-13T01:18:05Z"},{"alias_kind":"pith_short_16","alias_value":"ICIMLZ2DTCQM6OZ7","created_at":"2026-07-13T01:18:05Z"},{"alias_kind":"pith_short_8","alias_value":"ICIMLZ2D","created_at":"2026-07-13T01:18:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ICIMLZ2DTCQM6OZ7CY2VKJXB7K","target":"record","payload":{"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"},"canonical_sha256":"4090c5e74398a0cf3b3f16355526e1fab34f8392f551a8fb7792176c2177b884","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"},"source_kind":"arxiv","source_id":"2603.17489","source_version":4,"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-07-13T01:18:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gk7DZJ28hje2KPnJS5T5YlPjWeMiQnd3tJyD/a/aXcaldNVOlNI5PkG1SRUsrFc/mpcfYI+B5U5jk6YQbBNrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T15:21:08.437567Z"},"content_sha256":"0d5aae2938e2e5da902366ba67e019e4cb0729d2471a56c3c8ad2f3965827ad9","schema_version":"1.0","event_id":"sha256:0d5aae2938e2e5da902366ba67e019e4cb0729d2471a56c3c8ad2f3965827ad9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ICIMLZ2DTCQM6OZ7CY2VKJXB7K","target":"graph","payload":{"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"},"verdict_id":"0a0f9f40-c82a-4b9d-81d1-44b8076d1ee4"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-13T01:18:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"agzD5LMv5Rno9jgnNmIoQoeNngy8nWBy/X5s6cVvA0pbnPnnivOczT2ZXqaZY15+ivoEncCp/tXhbcMJFyGIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T15:21:08.438229Z"},"content_sha256":"02689bcbb66dc69f30d360a22e0092c26f71096baa20101086c9c7b6c1d76f7a","schema_version":"1.0","event_id":"sha256:02689bcbb66dc69f30d360a22e0092c26f71096baa20101086c9c7b6c1d76f7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ICIMLZ2DTCQM6OZ7CY2VKJXB7K/bundle.json","state_url":"https://pith.science/pith/ICIMLZ2DTCQM6OZ7CY2VKJXB7K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ICIMLZ2DTCQM6OZ7CY2VKJXB7K/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-08-12T15:21:08Z","links":{"resolver":"https://pith.science/pith/ICIMLZ2DTCQM6OZ7CY2VKJXB7K","bundle":"https://pith.science/pith/ICIMLZ2DTCQM6OZ7CY2VKJXB7K/bundle.json","state":"https://pith.science/pith/ICIMLZ2DTCQM6OZ7CY2VKJXB7K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ICIMLZ2DTCQM6OZ7CY2VKJXB7K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ICIMLZ2DTCQM6OZ7CY2VKJXB7K","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":"075067707c5099998551a2d4b1cb75682eabda6ce5f65e4285b07989f6a1f4fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-03-18T08:55:02Z","title_canon_sha256":"2080cfc63236a0532145b829a249864535cbf7cce1405198fcdd7b3d2e91f53f"},"schema_version":"1.0","source":{"id":"2603.17489","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.17489","created_at":"2026-07-13T01:18:05Z"},{"alias_kind":"arxiv_version","alias_value":"2603.17489v4","created_at":"2026-07-13T01:18:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.17489","created_at":"2026-07-13T01:18:05Z"},{"alias_kind":"pith_short_12","alias_value":"ICIMLZ2DTCQM","created_at":"2026-07-13T01:18:05Z"},{"alias_kind":"pith_short_16","alias_value":"ICIMLZ2DTCQM6OZ7","created_at":"2026-07-13T01:18:05Z"},{"alias_kind":"pith_short_8","alias_value":"ICIMLZ2D","created_at":"2026-07-13T01:18:05Z"}],"graph_snapshots":[{"event_id":"sha256:02689bcbb66dc69f30d360a22e0092c26f71096baa20101086c9c7b6c1d76f7a","target":"graph","created_at":"2026-07-13T01:18:05Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We prove that (assuming P != NP) the new notion is strictly stronger than FPTAS, but strictly weaker than having a polynomial-time algorithm."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A new approximation notion for NP-hard problems is strictly stronger than FPTAS but weaker than polynomial-time solvability."}],"snapshot_sha256":"b35ce977e41160d59580a25ea7c2dff20e97cd7e011e9f2b29bcefe0739941af"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2603.17489/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Erel Segal-Halevi, Samuel Bismuth","cross_cats":[],"headline":"A new approximation notion for NP-hard problems is strictly stronger than FPTAS but weaker than polynomial-time solvability.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-03-18T08:55:02Z","title":"An approximation notion between P and FPTAS"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.17489","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-15T08:48:25.598755Z","id":"0a0f9f40-c82a-4b9d-81d1-44b8076d1ee4","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"A new approximation notion for NP-hard problems is strictly stronger than FPTAS but weaker than polynomial-time solvability.","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.","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."}},"verdict_id":"0a0f9f40-c82a-4b9d-81d1-44b8076d1ee4"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0d5aae2938e2e5da902366ba67e019e4cb0729d2471a56c3c8ad2f3965827ad9","target":"record","created_at":"2026-07-13T01:18:05Z","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":"075067707c5099998551a2d4b1cb75682eabda6ce5f65e4285b07989f6a1f4fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-03-18T08:55:02Z","title_canon_sha256":"2080cfc63236a0532145b829a249864535cbf7cce1405198fcdd7b3d2e91f53f"},"schema_version":"1.0","source":{"id":"2603.17489","kind":"arxiv","version":4}},"canonical_sha256":"4090c5e74398a0cf3b3f16355526e1fab34f8392f551a8fb7792176c2177b884","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4090c5e74398a0cf3b3f16355526e1fab34f8392f551a8fb7792176c2177b884","first_computed_at":"2026-07-13T01:18:05.533589Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-13T01:18:05.533589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OE2ZyhQGWeIdxpR/NF+ktbHbPBWEsLstLpBENnZ2fO0oQo2W421xFUtXw1siEsv75/vGxVZpxHtlh1OGnEW/Bw==","signature_status":"signed_v1","signed_at":"2026-07-13T01:18:05.534795Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.17489","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d5aae2938e2e5da902366ba67e019e4cb0729d2471a56c3c8ad2f3965827ad9","sha256:02689bcbb66dc69f30d360a22e0092c26f71096baa20101086c9c7b6c1d76f7a"],"state_sha256":"b727ad0d663305f956f382b37f3f9394bc723ddeb771490fcce2bb21d50c870d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VqNo83MVNVdj4jAn0ksTTQgxrzTX3N1kxU8GbKSoda2EEkW7uZyAcgNRH9BJejvl3S8sdHloEGFiHWgCjLNmBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T15:21:08.443313Z","bundle_sha256":"8c141aed5b11aa249c58ca06cc9ce46d8d59bc3fc4751818d466bd3b0f0c38fa"}}