{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:EOLSLWOTTAV4URSHJUQT33NBLG","short_pith_number":"pith:EOLSLWOT","schema_version":"1.0","canonical_sha256":"239725d9d3982bca46474d213deda159ae3cb14e78f332a0149fae412d80161a","source":{"kind":"arxiv","id":"2308.11416","version":1},"attestation_state":"computed","paper":{"title":"Consistency-Checking Problems: A Gateway to Parameterized Sample Complexity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kirill Simonov, Liana Khazaliya, Robert Ganian","submitted_at":"2023-08-22T13:02:09Z","abstract_excerpt":"Recently, Brand, Ganian and Simonov introduced a parameterized refinement of the classical PAC-learning sample complexity framework. A crucial outcome of their investigation is that for a very wide range of learning problems, there is a direct and provable correspondence between fixed-parameter PAC-learnability (in the sample complexity setting) and the fixed-parameter tractability of a corresponding \"consistency checking\" search problem (in the setting of computational complexity). The latter can be seen as generalizations of classical search problems where instead of receiving a single insta"},"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":"2308.11416","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-22T13:02:09Z","cross_cats_sorted":[],"title_canon_sha256":"4efcd866212deae127050ebbad02d8ddc701d9a2c211fa5a7b676e9bbab96b91","abstract_canon_sha256":"b30005ca68bd975381d7e807d9fd3d52c10bca39bd3f6c938f8ea8ddcd416c7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:43:34.064162Z","signature_b64":"pGhNbRgOiIbhUiY7Zh/pN/dYWEw9uu7eRya61R5LEehSbi7UEll+z6y11tIOnifGll+ijjDFgefspw7QA4YMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"239725d9d3982bca46474d213deda159ae3cb14e78f332a0149fae412d80161a","last_reissued_at":"2026-07-05T06:43:34.063628Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:43:34.063628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Consistency-Checking Problems: A Gateway to Parameterized Sample Complexity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kirill Simonov, Liana Khazaliya, Robert Ganian","submitted_at":"2023-08-22T13:02:09Z","abstract_excerpt":"Recently, Brand, Ganian and Simonov introduced a parameterized refinement of the classical PAC-learning sample complexity framework. A crucial outcome of their investigation is that for a very wide range of learning problems, there is a direct and provable correspondence between fixed-parameter PAC-learnability (in the sample complexity setting) and the fixed-parameter tractability of a corresponding \"consistency checking\" search problem (in the setting of computational complexity). The latter can be seen as generalizations of classical search problems where instead of receiving a single insta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.11416","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/2308.11416/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":"2308.11416","created_at":"2026-07-05T06:43:34.063687+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.11416v1","created_at":"2026-07-05T06:43:34.063687+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.11416","created_at":"2026-07-05T06:43:34.063687+00:00"},{"alias_kind":"pith_short_12","alias_value":"EOLSLWOTTAV4","created_at":"2026-07-05T06:43:34.063687+00:00"},{"alias_kind":"pith_short_16","alias_value":"EOLSLWOTTAV4URSH","created_at":"2026-07-05T06:43:34.063687+00:00"},{"alias_kind":"pith_short_8","alias_value":"EOLSLWOT","created_at":"2026-07-05T06:43:34.063687+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/EOLSLWOTTAV4URSHJUQT33NBLG","json":"https://pith.science/pith/EOLSLWOTTAV4URSHJUQT33NBLG.json","graph_json":"https://pith.science/api/pith-number/EOLSLWOTTAV4URSHJUQT33NBLG/graph.json","events_json":"https://pith.science/api/pith-number/EOLSLWOTTAV4URSHJUQT33NBLG/events.json","paper":"https://pith.science/paper/EOLSLWOT"},"agent_actions":{"view_html":"https://pith.science/pith/EOLSLWOTTAV4URSHJUQT33NBLG","download_json":"https://pith.science/pith/EOLSLWOTTAV4URSHJUQT33NBLG.json","view_paper":"https://pith.science/paper/EOLSLWOT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.11416&json=true","fetch_graph":"https://pith.science/api/pith-number/EOLSLWOTTAV4URSHJUQT33NBLG/graph.json","fetch_events":"https://pith.science/api/pith-number/EOLSLWOTTAV4URSHJUQT33NBLG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EOLSLWOTTAV4URSHJUQT33NBLG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EOLSLWOTTAV4URSHJUQT33NBLG/action/storage_attestation","attest_author":"https://pith.science/pith/EOLSLWOTTAV4URSHJUQT33NBLG/action/author_attestation","sign_citation":"https://pith.science/pith/EOLSLWOTTAV4URSHJUQT33NBLG/action/citation_signature","submit_replication":"https://pith.science/pith/EOLSLWOTTAV4URSHJUQT33NBLG/action/replication_record"}},"created_at":"2026-07-05T06:43:34.063687+00:00","updated_at":"2026-07-05T06:43:34.063687+00:00"}