{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:H7AS6Q4DCVPLOIH5O3EAFSOXJJ","short_pith_number":"pith:H7AS6Q4D","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"},"canonical_sha256":"3fc12f4383155eb720fd76c802c9d74a5965466442b605adc67874f28fc1ab85","source":{"kind":"arxiv","id":"2412.05522","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.05522","created_at":"2026-07-05T09:53:08Z"},{"alias_kind":"arxiv_version","alias_value":"2412.05522v2","created_at":"2026-07-05T09:53:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.05522","created_at":"2026-07-05T09:53:08Z"},{"alias_kind":"pith_short_12","alias_value":"H7AS6Q4DCVPL","created_at":"2026-07-05T09:53:08Z"},{"alias_kind":"pith_short_16","alias_value":"H7AS6Q4DCVPLOIH5","created_at":"2026-07-05T09:53:08Z"},{"alias_kind":"pith_short_8","alias_value":"H7AS6Q4D","created_at":"2026-07-05T09:53:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:H7AS6Q4DCVPLOIH5O3EAFSOXJJ","target":"record","payload":{"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"},"canonical_sha256":"3fc12f4383155eb720fd76c802c9d74a5965466442b605adc67874f28fc1ab85","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"},"source_kind":"arxiv","source_id":"2412.05522","source_version":2,"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-05T09:53:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9R8fb1AlEDK0htkwTOwuW7nEiFZHylAwpSekz6w6+xnnhN6puRxcGBAf143Isv6X0j1oExR8ssEfWU7OSmSDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T23:16:08.263335Z"},"content_sha256":"cad4f5839e191b49a3a24635572f0957c336b0cd052f0147528390bc3c8ac242","schema_version":"1.0","event_id":"sha256:cad4f5839e191b49a3a24635572f0957c336b0cd052f0147528390bc3c8ac242"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:H7AS6Q4DCVPLOIH5O3EAFSOXJJ","target":"graph","payload":{"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"},"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-05T09:53:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hZzAliOpZPyllIF8XEGo6TnwjhbMnpRvRTiHXG5+HtH3ORhYs7zpmUTk/sPiZNDLis8O3QgXTAv3tr4q2VPgDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T23:16:08.263841Z"},"content_sha256":"f24bf7bcc9f444de34b0e4b29675d0d8db7520dfd785697797f3421379a410a1","schema_version":"1.0","event_id":"sha256:f24bf7bcc9f444de34b0e4b29675d0d8db7520dfd785697797f3421379a410a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H7AS6Q4DCVPLOIH5O3EAFSOXJJ/bundle.json","state_url":"https://pith.science/pith/H7AS6Q4DCVPLOIH5O3EAFSOXJJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H7AS6Q4DCVPLOIH5O3EAFSOXJJ/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-19T23:16:08Z","links":{"resolver":"https://pith.science/pith/H7AS6Q4DCVPLOIH5O3EAFSOXJJ","bundle":"https://pith.science/pith/H7AS6Q4DCVPLOIH5O3EAFSOXJJ/bundle.json","state":"https://pith.science/pith/H7AS6Q4DCVPLOIH5O3EAFSOXJJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H7AS6Q4DCVPLOIH5O3EAFSOXJJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:H7AS6Q4DCVPLOIH5O3EAFSOXJJ","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":"d8a0ea16c9fd51f50ef5d42d15add6cc308a9f209b337ad559b6d00c878cd75e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-07T03:37:42Z","title_canon_sha256":"5976e28f6c8ffff8024b47b4088a2bdf6d7217509fd4885a272aeea0c7d9a089"},"schema_version":"1.0","source":{"id":"2412.05522","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.05522","created_at":"2026-07-05T09:53:08Z"},{"alias_kind":"arxiv_version","alias_value":"2412.05522v2","created_at":"2026-07-05T09:53:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.05522","created_at":"2026-07-05T09:53:08Z"},{"alias_kind":"pith_short_12","alias_value":"H7AS6Q4DCVPL","created_at":"2026-07-05T09:53:08Z"},{"alias_kind":"pith_short_16","alias_value":"H7AS6Q4DCVPLOIH5","created_at":"2026-07-05T09:53:08Z"},{"alias_kind":"pith_short_8","alias_value":"H7AS6Q4D","created_at":"2026-07-05T09:53:08Z"}],"graph_snapshots":[{"event_id":"sha256:f24bf7bcc9f444de34b0e4b29675d0d8db7520dfd785697797f3421379a410a1","target":"graph","created_at":"2026-07-05T09:53:08Z","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/2412.05522/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\\'{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","authors_text":"Jialin He, J\\'ozsef Balogh, Michael C. Wigal, Robert A. Krueger, The Nguyen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-07T03:37:42Z","title":"Clique covers and decompositions of cliques of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.05522","kind":"arxiv","version":2},"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:cad4f5839e191b49a3a24635572f0957c336b0cd052f0147528390bc3c8ac242","target":"record","created_at":"2026-07-05T09:53:08Z","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":"d8a0ea16c9fd51f50ef5d42d15add6cc308a9f209b337ad559b6d00c878cd75e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-07T03:37:42Z","title_canon_sha256":"5976e28f6c8ffff8024b47b4088a2bdf6d7217509fd4885a272aeea0c7d9a089"},"schema_version":"1.0","source":{"id":"2412.05522","kind":"arxiv","version":2}},"canonical_sha256":"3fc12f4383155eb720fd76c802c9d74a5965466442b605adc67874f28fc1ab85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3fc12f4383155eb720fd76c802c9d74a5965466442b605adc67874f28fc1ab85","first_computed_at":"2026-07-05T09:53:08.324004Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:53:08.324004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+nJGUSj6aS6PrB+jZIy0BFr2Aa8iPLHyJIHp4f1eRE13hKKrEJIeBzodQjSAMK42TWHjsXKptv0WQlzuKdl6CA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:53:08.324573Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.05522","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cad4f5839e191b49a3a24635572f0957c336b0cd052f0147528390bc3c8ac242","sha256:f24bf7bcc9f444de34b0e4b29675d0d8db7520dfd785697797f3421379a410a1"],"state_sha256":"1f1e0dad80783489c27683ca3ff1e7ca0ae08978d8f5c460a4b006be77d6368d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wEP9f3IR+mFDYOaYbMRncYAtyQ5LQLPnwDMkgZg+fx4zS3eH6ZLqkLRO+XXxffPqP5bFMO93yAixxGGlJRpKDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T23:16:08.268678Z","bundle_sha256":"e3172030d44b73d592a7766fb3da1cbd8bf10f58c5411f62aefdf881375e84e9"}}