{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6E3HL33UN55WL7KWNW6H4N4SXA","short_pith_number":"pith:6E3HL33U","schema_version":"1.0","canonical_sha256":"f13675ef746f7b65fd566dbc7e3792b81fa144c00f117814e611dceccc2c1dc5","source":{"kind":"arxiv","id":"1410.6400","version":1},"attestation_state":"computed","paper":{"title":"On the Average-case Complexity of Parameterized Clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Danny Hermelin, Nikolaos Fountoulakis, Tobias Friedrich","submitted_at":"2014-10-23T15:33:01Z","abstract_excerpt":"The k-Clique problem is a fundamental combinatorial problem that plays a prominent role in classical as well as in parameterized complexity theory. It is among the most well-known NP-complete and W[1]-complete problems. Moreover, its average-case complexity analysis has created a long thread of research already since the 1970s. Here, we continue this line of research by studying the dependence of the average-case complexity of the k-Clique problem on the parameter k. To this end, we define two natural parameterized analogs of efficient average-case algorithms. We then show that k-Clique admits"},"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":"1410.6400","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-23T15:33:01Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"85c159f31fbb714f8cfff22fff643a9c07023469140f91ee9a425b3926ad9e61","abstract_canon_sha256":"eb55c677f5fd67d3a90ffb45556e726955c443b7730f56751222685e194847bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:30.986992Z","signature_b64":"Ht71jSHbCyCQqzAfnkOgVjxWlN+tsoWRl/PxFW2eqQiRKqiz5ADjbUt2pd6WeBMm1PbGme5v83VjvT0bwN5bBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f13675ef746f7b65fd566dbc7e3792b81fa144c00f117814e611dceccc2c1dc5","last_reissued_at":"2026-05-18T02:39:30.986411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:30.986411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Average-case Complexity of Parameterized Clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Danny Hermelin, Nikolaos Fountoulakis, Tobias Friedrich","submitted_at":"2014-10-23T15:33:01Z","abstract_excerpt":"The k-Clique problem is a fundamental combinatorial problem that plays a prominent role in classical as well as in parameterized complexity theory. It is among the most well-known NP-complete and W[1]-complete problems. Moreover, its average-case complexity analysis has created a long thread of research already since the 1970s. Here, we continue this line of research by studying the dependence of the average-case complexity of the k-Clique problem on the parameter k. To this end, we define two natural parameterized analogs of efficient average-case algorithms. We then show that k-Clique admits"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6400","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":"1410.6400","created_at":"2026-05-18T02:39:30.986494+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.6400v1","created_at":"2026-05-18T02:39:30.986494+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6400","created_at":"2026-05-18T02:39:30.986494+00:00"},{"alias_kind":"pith_short_12","alias_value":"6E3HL33UN55W","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6E3HL33UN55WL7KW","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6E3HL33U","created_at":"2026-05-18T12:28:16.859392+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/6E3HL33UN55WL7KWNW6H4N4SXA","json":"https://pith.science/pith/6E3HL33UN55WL7KWNW6H4N4SXA.json","graph_json":"https://pith.science/api/pith-number/6E3HL33UN55WL7KWNW6H4N4SXA/graph.json","events_json":"https://pith.science/api/pith-number/6E3HL33UN55WL7KWNW6H4N4SXA/events.json","paper":"https://pith.science/paper/6E3HL33U"},"agent_actions":{"view_html":"https://pith.science/pith/6E3HL33UN55WL7KWNW6H4N4SXA","download_json":"https://pith.science/pith/6E3HL33UN55WL7KWNW6H4N4SXA.json","view_paper":"https://pith.science/paper/6E3HL33U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.6400&json=true","fetch_graph":"https://pith.science/api/pith-number/6E3HL33UN55WL7KWNW6H4N4SXA/graph.json","fetch_events":"https://pith.science/api/pith-number/6E3HL33UN55WL7KWNW6H4N4SXA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6E3HL33UN55WL7KWNW6H4N4SXA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6E3HL33UN55WL7KWNW6H4N4SXA/action/storage_attestation","attest_author":"https://pith.science/pith/6E3HL33UN55WL7KWNW6H4N4SXA/action/author_attestation","sign_citation":"https://pith.science/pith/6E3HL33UN55WL7KWNW6H4N4SXA/action/citation_signature","submit_replication":"https://pith.science/pith/6E3HL33UN55WL7KWNW6H4N4SXA/action/replication_record"}},"created_at":"2026-05-18T02:39:30.986494+00:00","updated_at":"2026-05-18T02:39:30.986494+00:00"}