{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:C72CKME3YQ5ZJ6MMRF6RQTZU6H","short_pith_number":"pith:C72CKME3","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"},"canonical_sha256":"17f425309bc43b94f98c897d184f34f1d4e6b30cdd444c0430e2b1c20cfa5c14","source":{"kind":"arxiv","id":"2506.10478","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.10478","created_at":"2026-07-05T11:20:24Z"},{"alias_kind":"arxiv_version","alias_value":"2506.10478v1","created_at":"2026-07-05T11:20:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.10478","created_at":"2026-07-05T11:20:24Z"},{"alias_kind":"pith_short_12","alias_value":"C72CKME3YQ5Z","created_at":"2026-07-05T11:20:24Z"},{"alias_kind":"pith_short_16","alias_value":"C72CKME3YQ5ZJ6MM","created_at":"2026-07-05T11:20:24Z"},{"alias_kind":"pith_short_8","alias_value":"C72CKME3","created_at":"2026-07-05T11:20:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:C72CKME3YQ5ZJ6MMRF6RQTZU6H","target":"record","payload":{"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"},"canonical_sha256":"17f425309bc43b94f98c897d184f34f1d4e6b30cdd444c0430e2b1c20cfa5c14","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"},"source_kind":"arxiv","source_id":"2506.10478","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:20:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0GGn19njThTUsdMj3USR7T7WNwcUfzbMnczxRPLbDdzaHPvsJIYETgYciM0ERhbbiZtfJEMvHCtot3UEhKh4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T05:09:34.531332Z"},"content_sha256":"591a8665897bdc725f9b29922ab4b3376c0fd133351df638dd8f44ace369f432","schema_version":"1.0","event_id":"sha256:591a8665897bdc725f9b29922ab4b3376c0fd133351df638dd8f44ace369f432"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:C72CKME3YQ5ZJ6MMRF6RQTZU6H","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:20:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VxtDERMzJiEB9wdlDKJyCpQmAYoY9YFF32ab8LhOmhXFZ1y14TXxrdP2s/yn1CT/NIjTGlzk9DC1OKObKygbBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T05:09:34.532772Z"},"content_sha256":"f8d665b09e2c1e38c2b325bd40f3fd08976997b7c9493249ab91b558ec4f50f9","schema_version":"1.0","event_id":"sha256:f8d665b09e2c1e38c2b325bd40f3fd08976997b7c9493249ab91b558ec4f50f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C72CKME3YQ5ZJ6MMRF6RQTZU6H/bundle.json","state_url":"https://pith.science/pith/C72CKME3YQ5ZJ6MMRF6RQTZU6H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C72CKME3YQ5ZJ6MMRF6RQTZU6H/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-19T05:09:34Z","links":{"resolver":"https://pith.science/pith/C72CKME3YQ5ZJ6MMRF6RQTZU6H","bundle":"https://pith.science/pith/C72CKME3YQ5ZJ6MMRF6RQTZU6H/bundle.json","state":"https://pith.science/pith/C72CKME3YQ5ZJ6MMRF6RQTZU6H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C72CKME3YQ5ZJ6MMRF6RQTZU6H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:C72CKME3YQ5ZJ6MMRF6RQTZU6H","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"efae853917fe66d8f458c5c79b30d7de6bce9f2d42939a48ce9c0a4c9d8b0420","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-12T08:30:34Z","title_canon_sha256":"a45f2a4eec74dea596daf0b53820736110ef4cb84b43cfe304b1019bd7e30939"},"schema_version":"1.0","source":{"id":"2506.10478","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.10478","created_at":"2026-07-05T11:20:24Z"},{"alias_kind":"arxiv_version","alias_value":"2506.10478v1","created_at":"2026-07-05T11:20:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.10478","created_at":"2026-07-05T11:20:24Z"},{"alias_kind":"pith_short_12","alias_value":"C72CKME3YQ5Z","created_at":"2026-07-05T11:20:24Z"},{"alias_kind":"pith_short_16","alias_value":"C72CKME3YQ5ZJ6MM","created_at":"2026-07-05T11:20:24Z"},{"alias_kind":"pith_short_8","alias_value":"C72CKME3","created_at":"2026-07-05T11:20:24Z"}],"graph_snapshots":[{"event_id":"sha256:f8d665b09e2c1e38c2b325bd40f3fd08976997b7c9493249ab91b558ec4f50f9","target":"graph","created_at":"2026-07-05T11:20:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.10478/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jialin He, Tianying Xie, Yihan Chen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-12T08:30:34Z","title":"On the $4$-clique cover number of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.10478","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:591a8665897bdc725f9b29922ab4b3376c0fd133351df638dd8f44ace369f432","target":"record","created_at":"2026-07-05T11:20:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"efae853917fe66d8f458c5c79b30d7de6bce9f2d42939a48ce9c0a4c9d8b0420","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-12T08:30:34Z","title_canon_sha256":"a45f2a4eec74dea596daf0b53820736110ef4cb84b43cfe304b1019bd7e30939"},"schema_version":"1.0","source":{"id":"2506.10478","kind":"arxiv","version":1}},"canonical_sha256":"17f425309bc43b94f98c897d184f34f1d4e6b30cdd444c0430e2b1c20cfa5c14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17f425309bc43b94f98c897d184f34f1d4e6b30cdd444c0430e2b1c20cfa5c14","first_computed_at":"2026-07-05T11:20:24.581479Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:20:24.581479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ddFwcHxg53v6pA1Qh0SX55NCnyExNANan2nTzGC/LOj7gaxyUG3fSYrA5wxJB8Pz98UDCHWYwd4NXfOzMTqXCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:20:24.581997Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.10478","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:591a8665897bdc725f9b29922ab4b3376c0fd133351df638dd8f44ace369f432","sha256:f8d665b09e2c1e38c2b325bd40f3fd08976997b7c9493249ab91b558ec4f50f9"],"state_sha256":"1316cf462eac2b74f6752355f6b6a9e84896ec86e3c1bc61ef4b74727824881a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+AUxiwBpXRo1/rfEGnIEMLuicJLTcabRydeICN2IjOyXByoG0N+x6vOSe5jOUOawTSoAk81gSdPlVAcd0zhJDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T05:09:34.544334Z","bundle_sha256":"b0a20d9ca7499a319fdef72df92e24badfbb704d9c99bfb5569ff719b5e3918f"}}