{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:H7AS6Q4DCVPLOIH5O3EAFSOXJJ","short_pith_number":"pith:H7AS6Q4D","schema_version":"1.0","canonical_sha256":"3fc12f4383155eb720fd76c802c9d74a5965466442b605adc67874f28fc1ab85","source":{"kind":"arxiv","id":"2412.05522","version":2},"attestation_state":"computed","paper":{"title":"Clique covers and decompositions of cliques of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jialin He, J\\'ozsef Balogh, Michael C. Wigal, Robert A. Krueger, The Nguyen","submitted_at":"2024-12-07T03:37:42Z","abstract_excerpt":"In 1966, Erd\\H{o}s, Goodman, and P\\'{o}sa showed that if $G$ is an $n$-vertex graph, then at most $\\lfloor n^2/4 \\rfloor$ cliques of $G$ are needed to cover the edges of $G$, and the bound is best possible as witnessed by the balanced complete bipartite graph. This was generalized independently by Gy\\H{o}ri--Kostochka, Kahn, and Chung, who showed that every $n$-vertex graph admits an edge-decomposition into cliques of total `cost' at most $2 \\lfloor n^2/4 \\rfloor$, where an $i$-vertex clique has cost $i$. Erd\\H{o}s suggested the following strengthening: every $n$-vertex graph admits an edge-de"},"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":"2412.05522","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-07T03:37:42Z","cross_cats_sorted":[],"title_canon_sha256":"5976e28f6c8ffff8024b47b4088a2bdf6d7217509fd4885a272aeea0c7d9a089","abstract_canon_sha256":"d8a0ea16c9fd51f50ef5d42d15add6cc308a9f209b337ad559b6d00c878cd75e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:53:08.324573Z","signature_b64":"+nJGUSj6aS6PrB+jZIy0BFr2Aa8iPLHyJIHp4f1eRE13hKKrEJIeBzodQjSAMK42TWHjsXKptv0WQlzuKdl6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fc12f4383155eb720fd76c802c9d74a5965466442b605adc67874f28fc1ab85","last_reissued_at":"2026-07-05T09:53:08.324004Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:53:08.324004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clique covers and decompositions of cliques of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jialin He, J\\'ozsef Balogh, Michael C. Wigal, Robert A. Krueger, The Nguyen","submitted_at":"2024-12-07T03:37:42Z","abstract_excerpt":"In 1966, Erd\\H{o}s, Goodman, and P\\'{o}sa showed that if $G$ is an $n$-vertex graph, then at most $\\lfloor n^2/4 \\rfloor$ cliques of $G$ are needed to cover the edges of $G$, and the bound is best possible as witnessed by the balanced complete bipartite graph. This was generalized independently by Gy\\H{o}ri--Kostochka, Kahn, and Chung, who showed that every $n$-vertex graph admits an edge-decomposition into cliques of total `cost' at most $2 \\lfloor n^2/4 \\rfloor$, where an $i$-vertex clique has cost $i$. Erd\\H{o}s suggested the following strengthening: every $n$-vertex graph admits an edge-de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.05522","kind":"arxiv","version":2},"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/2412.05522/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":"2412.05522","created_at":"2026-07-05T09:53:08.324059+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.05522v2","created_at":"2026-07-05T09:53:08.324059+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.05522","created_at":"2026-07-05T09:53:08.324059+00:00"},{"alias_kind":"pith_short_12","alias_value":"H7AS6Q4DCVPL","created_at":"2026-07-05T09:53:08.324059+00:00"},{"alias_kind":"pith_short_16","alias_value":"H7AS6Q4DCVPLOIH5","created_at":"2026-07-05T09:53:08.324059+00:00"},{"alias_kind":"pith_short_8","alias_value":"H7AS6Q4D","created_at":"2026-07-05T09:53:08.324059+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11178","citing_title":"A Proof of Nash-Williams' Conjecture","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H7AS6Q4DCVPLOIH5O3EAFSOXJJ","json":"https://pith.science/pith/H7AS6Q4DCVPLOIH5O3EAFSOXJJ.json","graph_json":"https://pith.science/api/pith-number/H7AS6Q4DCVPLOIH5O3EAFSOXJJ/graph.json","events_json":"https://pith.science/api/pith-number/H7AS6Q4DCVPLOIH5O3EAFSOXJJ/events.json","paper":"https://pith.science/paper/H7AS6Q4D"},"agent_actions":{"view_html":"https://pith.science/pith/H7AS6Q4DCVPLOIH5O3EAFSOXJJ","download_json":"https://pith.science/pith/H7AS6Q4DCVPLOIH5O3EAFSOXJJ.json","view_paper":"https://pith.science/paper/H7AS6Q4D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.05522&json=true","fetch_graph":"https://pith.science/api/pith-number/H7AS6Q4DCVPLOIH5O3EAFSOXJJ/graph.json","fetch_events":"https://pith.science/api/pith-number/H7AS6Q4DCVPLOIH5O3EAFSOXJJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H7AS6Q4DCVPLOIH5O3EAFSOXJJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H7AS6Q4DCVPLOIH5O3EAFSOXJJ/action/storage_attestation","attest_author":"https://pith.science/pith/H7AS6Q4DCVPLOIH5O3EAFSOXJJ/action/author_attestation","sign_citation":"https://pith.science/pith/H7AS6Q4DCVPLOIH5O3EAFSOXJJ/action/citation_signature","submit_replication":"https://pith.science/pith/H7AS6Q4DCVPLOIH5O3EAFSOXJJ/action/replication_record"}},"created_at":"2026-07-05T09:53:08.324059+00:00","updated_at":"2026-07-05T09:53:08.324059+00:00"}