{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:C72CKME3YQ5ZJ6MMRF6RQTZU6H","short_pith_number":"pith:C72CKME3","schema_version":"1.0","canonical_sha256":"17f425309bc43b94f98c897d184f34f1d4e6b30cdd444c0430e2b1c20cfa5c14","source":{"kind":"arxiv","id":"2506.10478","version":1},"attestation_state":"computed","paper":{"title":"On the $4$-clique cover number of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jialin He, Tianying Xie, Yihan Chen","submitted_at":"2025-06-12T08:30:34Z","abstract_excerpt":"In 1966, Erd\\H{o}s, Goodman, and P\\'osa proved that $\\lfloor n^2/4 \\rfloor$ cliques are sufficient to cover all edges in any $n$-vertex graph, with tightness achieved by the balanced complete bipartite graph. This result was generalized by Dau, Milenkovic, and Puleo, who showed that at most $\\lfloor \\frac n 3 \\rfloor \\lfloor \\frac {n+1} 3 \\rfloor \\lfloor \\frac {n+2} 3 \\rfloor$ cliques are needed to cover all triangles in any $n$-vertex graph $G$, and the bound is best possible as witnessed by the balanced complete tripartite graph. They further conjectured that for $t \\geq 4$, the $t$-clique c"},"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":"2506.10478","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-12T08:30:34Z","cross_cats_sorted":[],"title_canon_sha256":"a45f2a4eec74dea596daf0b53820736110ef4cb84b43cfe304b1019bd7e30939","abstract_canon_sha256":"efae853917fe66d8f458c5c79b30d7de6bce9f2d42939a48ce9c0a4c9d8b0420"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:20:24.581997Z","signature_b64":"ddFwcHxg53v6pA1Qh0SX55NCnyExNANan2nTzGC/LOj7gaxyUG3fSYrA5wxJB8Pz98UDCHWYwd4NXfOzMTqXCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17f425309bc43b94f98c897d184f34f1d4e6b30cdd444c0430e2b1c20cfa5c14","last_reissued_at":"2026-07-05T11:20:24.581479Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:20:24.581479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the $4$-clique cover number of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jialin He, Tianying Xie, Yihan Chen","submitted_at":"2025-06-12T08:30:34Z","abstract_excerpt":"In 1966, Erd\\H{o}s, Goodman, and P\\'osa proved that $\\lfloor n^2/4 \\rfloor$ cliques are sufficient to cover all edges in any $n$-vertex graph, with tightness achieved by the balanced complete bipartite graph. This result was generalized by Dau, Milenkovic, and Puleo, who showed that at most $\\lfloor \\frac n 3 \\rfloor \\lfloor \\frac {n+1} 3 \\rfloor \\lfloor \\frac {n+2} 3 \\rfloor$ cliques are needed to cover all triangles in any $n$-vertex graph $G$, and the bound is best possible as witnessed by the balanced complete tripartite graph. They further conjectured that for $t \\geq 4$, the $t$-clique c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.10478","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/2506.10478/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":"2506.10478","created_at":"2026-07-05T11:20:24.581553+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.10478v1","created_at":"2026-07-05T11:20:24.581553+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.10478","created_at":"2026-07-05T11:20:24.581553+00:00"},{"alias_kind":"pith_short_12","alias_value":"C72CKME3YQ5Z","created_at":"2026-07-05T11:20:24.581553+00:00"},{"alias_kind":"pith_short_16","alias_value":"C72CKME3YQ5ZJ6MM","created_at":"2026-07-05T11:20:24.581553+00:00"},{"alias_kind":"pith_short_8","alias_value":"C72CKME3","created_at":"2026-07-05T11:20:24.581553+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/C72CKME3YQ5ZJ6MMRF6RQTZU6H","json":"https://pith.science/pith/C72CKME3YQ5ZJ6MMRF6RQTZU6H.json","graph_json":"https://pith.science/api/pith-number/C72CKME3YQ5ZJ6MMRF6RQTZU6H/graph.json","events_json":"https://pith.science/api/pith-number/C72CKME3YQ5ZJ6MMRF6RQTZU6H/events.json","paper":"https://pith.science/paper/C72CKME3"},"agent_actions":{"view_html":"https://pith.science/pith/C72CKME3YQ5ZJ6MMRF6RQTZU6H","download_json":"https://pith.science/pith/C72CKME3YQ5ZJ6MMRF6RQTZU6H.json","view_paper":"https://pith.science/paper/C72CKME3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.10478&json=true","fetch_graph":"https://pith.science/api/pith-number/C72CKME3YQ5ZJ6MMRF6RQTZU6H/graph.json","fetch_events":"https://pith.science/api/pith-number/C72CKME3YQ5ZJ6MMRF6RQTZU6H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C72CKME3YQ5ZJ6MMRF6RQTZU6H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C72CKME3YQ5ZJ6MMRF6RQTZU6H/action/storage_attestation","attest_author":"https://pith.science/pith/C72CKME3YQ5ZJ6MMRF6RQTZU6H/action/author_attestation","sign_citation":"https://pith.science/pith/C72CKME3YQ5ZJ6MMRF6RQTZU6H/action/citation_signature","submit_replication":"https://pith.science/pith/C72CKME3YQ5ZJ6MMRF6RQTZU6H/action/replication_record"}},"created_at":"2026-07-05T11:20:24.581553+00:00","updated_at":"2026-07-05T11:20:24.581553+00:00"}