{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3RCDZ33IUNDVVAMDTDKMVKVLJ4","short_pith_number":"pith:3RCDZ33I","schema_version":"1.0","canonical_sha256":"dc443cef68a3475a818398d4caaaab4f22ed408f421242ecc71e2921d482ec1d","source":{"kind":"arxiv","id":"2508.10550","version":1},"attestation_state":"computed","paper":{"title":"On Kernelization with Access to NP-Oracles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Hendrik Molter, Meirav Zehavi","submitted_at":"2025-08-14T11:39:47Z","abstract_excerpt":"Kernelization is the standard framework to analyze preprocessing routines mathematically. Here, in terms of efficiency, we demand the preprocessing routine to run in time polynomial in the input size. However, today, various NP-complete problems are already solved very fast in practice; in particular, SAT-solvers and ILP-solvers have become extremely powerful and used frequently. Still, this fails to capture the wide variety of computational problems that lie at higher levels of the polynomial hierarchy. Thus, for such problems, it is natural to relax the definition of kernelization to permit "},"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":"2508.10550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-08-14T11:39:47Z","cross_cats_sorted":[],"title_canon_sha256":"df8a9115470a4b4afc45f19ba77a30db5279f6576e73ee64f04f62a08671c00a","abstract_canon_sha256":"a35b5e863c3e9100315cd5d3e45124d1452429ef1913411645e2a0cc508e0041"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:53:58.120348Z","signature_b64":"GxyIRmnOx2KUq9B+kg45i1ZU1eY+fZPTywNXJfsHRo5b2HYZy5VaTI9+uMzv2LFbCkszHRGSc5E80HqxqdhgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc443cef68a3475a818398d4caaaab4f22ed408f421242ecc71e2921d482ec1d","last_reissued_at":"2026-07-05T11:53:58.119914Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:53:58.119914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Kernelization with Access to NP-Oracles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Hendrik Molter, Meirav Zehavi","submitted_at":"2025-08-14T11:39:47Z","abstract_excerpt":"Kernelization is the standard framework to analyze preprocessing routines mathematically. Here, in terms of efficiency, we demand the preprocessing routine to run in time polynomial in the input size. However, today, various NP-complete problems are already solved very fast in practice; in particular, SAT-solvers and ILP-solvers have become extremely powerful and used frequently. Still, this fails to capture the wide variety of computational problems that lie at higher levels of the polynomial hierarchy. Thus, for such problems, it is natural to relax the definition of kernelization to permit "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.10550","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.10550/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":"2508.10550","created_at":"2026-07-05T11:53:58.119977+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.10550v1","created_at":"2026-07-05T11:53:58.119977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.10550","created_at":"2026-07-05T11:53:58.119977+00:00"},{"alias_kind":"pith_short_12","alias_value":"3RCDZ33IUNDV","created_at":"2026-07-05T11:53:58.119977+00:00"},{"alias_kind":"pith_short_16","alias_value":"3RCDZ33IUNDVVAMD","created_at":"2026-07-05T11:53:58.119977+00:00"},{"alias_kind":"pith_short_8","alias_value":"3RCDZ33I","created_at":"2026-07-05T11:53:58.119977+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/3RCDZ33IUNDVVAMDTDKMVKVLJ4","json":"https://pith.science/pith/3RCDZ33IUNDVVAMDTDKMVKVLJ4.json","graph_json":"https://pith.science/api/pith-number/3RCDZ33IUNDVVAMDTDKMVKVLJ4/graph.json","events_json":"https://pith.science/api/pith-number/3RCDZ33IUNDVVAMDTDKMVKVLJ4/events.json","paper":"https://pith.science/paper/3RCDZ33I"},"agent_actions":{"view_html":"https://pith.science/pith/3RCDZ33IUNDVVAMDTDKMVKVLJ4","download_json":"https://pith.science/pith/3RCDZ33IUNDVVAMDTDKMVKVLJ4.json","view_paper":"https://pith.science/paper/3RCDZ33I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.10550&json=true","fetch_graph":"https://pith.science/api/pith-number/3RCDZ33IUNDVVAMDTDKMVKVLJ4/graph.json","fetch_events":"https://pith.science/api/pith-number/3RCDZ33IUNDVVAMDTDKMVKVLJ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3RCDZ33IUNDVVAMDTDKMVKVLJ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3RCDZ33IUNDVVAMDTDKMVKVLJ4/action/storage_attestation","attest_author":"https://pith.science/pith/3RCDZ33IUNDVVAMDTDKMVKVLJ4/action/author_attestation","sign_citation":"https://pith.science/pith/3RCDZ33IUNDVVAMDTDKMVKVLJ4/action/citation_signature","submit_replication":"https://pith.science/pith/3RCDZ33IUNDVVAMDTDKMVKVLJ4/action/replication_record"}},"created_at":"2026-07-05T11:53:58.119977+00:00","updated_at":"2026-07-05T11:53:58.119977+00:00"}