{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:FEY7TMNCCNEXSU6OECUOX6OFJE","short_pith_number":"pith:FEY7TMNC","schema_version":"1.0","canonical_sha256":"2931f9b1a213497953ce20a8ebf9c54926ea47db36fac5366e32688736864b7c","source":{"kind":"arxiv","id":"2307.07456","version":1},"attestation_state":"computed","paper":{"title":"Tur\\'{a}n's Theorem Through Algorithmic Lens","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danil Sagunov, Fedor V. Fomin, Kirill Simonov, Petr A. Golovach","submitted_at":"2023-07-14T16:33:47Z","abstract_excerpt":"The fundamental theorem of Tur\\'{a}n from Extremal Graph Theory determines the exact bound on the number of edges $t_r(n)$ in an $n$-vertex graph that does not contain a clique of size $r+1$. We establish an interesting link between Extremal Graph Theory and Algorithms by providing a simple compression algorithm that in linear time reduces the problem of finding a clique of size $\\ell$ in an $n$-vertex graph $G$ with $m \\ge t_r(n)-k$ edges, where $\\ell\\leq r+1$, to the problem of finding a maximum clique in a graph on at most $5k$ vertices. This also gives us an algorithm deciding in time $2.4"},"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":"2307.07456","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-07-14T16:33:47Z","cross_cats_sorted":[],"title_canon_sha256":"05befa6f5d33fab84e5685639beb62dce4d0f7182036fbb3e9fcd4e2e5b4c285","abstract_canon_sha256":"a7135ba4d1be0f98ae7473349a21ffe811db33eedd4e2b1850ff21e7165de4f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:30:55.969720Z","signature_b64":"CPdHGyKzBJqFeF3QiCB9UUbp+IvrvRmTb1M+28sZMYvKjYoCLCSn10AgXdtXD2NJJc0N3GO/TpgzfGgftl8bAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2931f9b1a213497953ce20a8ebf9c54926ea47db36fac5366e32688736864b7c","last_reissued_at":"2026-07-05T06:30:55.969231Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:30:55.969231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tur\\'{a}n's Theorem Through Algorithmic Lens","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danil Sagunov, Fedor V. Fomin, Kirill Simonov, Petr A. Golovach","submitted_at":"2023-07-14T16:33:47Z","abstract_excerpt":"The fundamental theorem of Tur\\'{a}n from Extremal Graph Theory determines the exact bound on the number of edges $t_r(n)$ in an $n$-vertex graph that does not contain a clique of size $r+1$. We establish an interesting link between Extremal Graph Theory and Algorithms by providing a simple compression algorithm that in linear time reduces the problem of finding a clique of size $\\ell$ in an $n$-vertex graph $G$ with $m \\ge t_r(n)-k$ edges, where $\\ell\\leq r+1$, to the problem of finding a maximum clique in a graph on at most $5k$ vertices. This also gives us an algorithm deciding in time $2.4"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.07456","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/2307.07456/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":"2307.07456","created_at":"2026-07-05T06:30:55.969293+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.07456v1","created_at":"2026-07-05T06:30:55.969293+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.07456","created_at":"2026-07-05T06:30:55.969293+00:00"},{"alias_kind":"pith_short_12","alias_value":"FEY7TMNCCNEX","created_at":"2026-07-05T06:30:55.969293+00:00"},{"alias_kind":"pith_short_16","alias_value":"FEY7TMNCCNEXSU6O","created_at":"2026-07-05T06:30:55.969293+00:00"},{"alias_kind":"pith_short_8","alias_value":"FEY7TMNC","created_at":"2026-07-05T06:30:55.969293+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/FEY7TMNCCNEXSU6OECUOX6OFJE","json":"https://pith.science/pith/FEY7TMNCCNEXSU6OECUOX6OFJE.json","graph_json":"https://pith.science/api/pith-number/FEY7TMNCCNEXSU6OECUOX6OFJE/graph.json","events_json":"https://pith.science/api/pith-number/FEY7TMNCCNEXSU6OECUOX6OFJE/events.json","paper":"https://pith.science/paper/FEY7TMNC"},"agent_actions":{"view_html":"https://pith.science/pith/FEY7TMNCCNEXSU6OECUOX6OFJE","download_json":"https://pith.science/pith/FEY7TMNCCNEXSU6OECUOX6OFJE.json","view_paper":"https://pith.science/paper/FEY7TMNC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.07456&json=true","fetch_graph":"https://pith.science/api/pith-number/FEY7TMNCCNEXSU6OECUOX6OFJE/graph.json","fetch_events":"https://pith.science/api/pith-number/FEY7TMNCCNEXSU6OECUOX6OFJE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FEY7TMNCCNEXSU6OECUOX6OFJE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FEY7TMNCCNEXSU6OECUOX6OFJE/action/storage_attestation","attest_author":"https://pith.science/pith/FEY7TMNCCNEXSU6OECUOX6OFJE/action/author_attestation","sign_citation":"https://pith.science/pith/FEY7TMNCCNEXSU6OECUOX6OFJE/action/citation_signature","submit_replication":"https://pith.science/pith/FEY7TMNCCNEXSU6OECUOX6OFJE/action/replication_record"}},"created_at":"2026-07-05T06:30:55.969293+00:00","updated_at":"2026-07-05T06:30:55.969293+00:00"}