{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:2ZC2LAU5FM46VI25TG423KGOT3","short_pith_number":"pith:2ZC2LAU5","canonical_record":{"source":{"id":"2205.14556","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-05-29T02:24:45Z","cross_cats_sorted":[],"title_canon_sha256":"857fa0c2d073224d801844aa6ed4dac7095c87a06c7a813b1b6fb297988cd8c9","abstract_canon_sha256":"bf057bef67982da8bd460630c10dcfb53bcd956455cd6874b424906efe60e357"},"schema_version":"1.0"},"canonical_sha256":"d645a5829d2b39eaa35d99b9ada8ce9edff2157d3485c588b4860d86077f5f53","source":{"kind":"arxiv","id":"2205.14556","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.14556","created_at":"2026-07-05T05:04:49Z"},{"alias_kind":"arxiv_version","alias_value":"2205.14556v2","created_at":"2026-07-05T05:04:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.14556","created_at":"2026-07-05T05:04:49Z"},{"alias_kind":"pith_short_12","alias_value":"2ZC2LAU5FM46","created_at":"2026-07-05T05:04:49Z"},{"alias_kind":"pith_short_16","alias_value":"2ZC2LAU5FM46VI25","created_at":"2026-07-05T05:04:49Z"},{"alias_kind":"pith_short_8","alias_value":"2ZC2LAU5","created_at":"2026-07-05T05:04:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:2ZC2LAU5FM46VI25TG423KGOT3","target":"record","payload":{"canonical_record":{"source":{"id":"2205.14556","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-05-29T02:24:45Z","cross_cats_sorted":[],"title_canon_sha256":"857fa0c2d073224d801844aa6ed4dac7095c87a06c7a813b1b6fb297988cd8c9","abstract_canon_sha256":"bf057bef67982da8bd460630c10dcfb53bcd956455cd6874b424906efe60e357"},"schema_version":"1.0"},"canonical_sha256":"d645a5829d2b39eaa35d99b9ada8ce9edff2157d3485c588b4860d86077f5f53","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:04:49.012124Z","signature_b64":"cceIymkhVOwA8IPQFtOCk6/9/jeA52T6tcZ4dWs+yiPkH/gDdTJuhQKc2ES+uZqihAw6oqjQv2hkUb2sneuDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d645a5829d2b39eaa35d99b9ada8ce9edff2157d3485c588b4860d86077f5f53","last_reissued_at":"2026-07-05T05:04:49.011668Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:04:49.011668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.14556","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-05T05:04:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RxyjhDGO/WocZ+ErPbarLLRpw2EBkKb1oRTzli500Znzdykz9BT+7eJdRpKpXV647OsBjqyEwvxKd6ZmLz/XBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:51:37.001613Z"},"content_sha256":"87b1a10388c1493b830b7635cdd97a2674ed9e6faf46640d76777cd64176f1af","schema_version":"1.0","event_id":"sha256:87b1a10388c1493b830b7635cdd97a2674ed9e6faf46640d76777cd64176f1af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:2ZC2LAU5FM46VI25TG423KGOT3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight bounds towards a conjecture of Gallai","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Jun Gao","submitted_at":"2022-05-29T02:24:45Z","abstract_excerpt":"We prove that for $n>k\\geq 3$, if $G$ is an $n$-vertex graph with chromatic number $k$ but any its proper subgraph has smaller chromatic number, then $G$ contains at most $n-k+3$ copies of cliques of size $k-1$. This answers a problem of Abbott and Zhou and provides a tight bound on a conjecture of Gallai."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.14556","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/2205.14556/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-05T05:04:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z7CdNJuoY9v441srSJYWqcvgSGXOpBkfOaUE93pvNiK9i8OUij3wv+1BKfgKfyXAyN9M+JNy6ZXOwLmXVSQ3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:51:37.002104Z"},"content_sha256":"5392940987d230eef1cdda5ac5d24f1da0fecccedf75cef9a09174cc67c34bd9","schema_version":"1.0","event_id":"sha256:5392940987d230eef1cdda5ac5d24f1da0fecccedf75cef9a09174cc67c34bd9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2ZC2LAU5FM46VI25TG423KGOT3/bundle.json","state_url":"https://pith.science/pith/2ZC2LAU5FM46VI25TG423KGOT3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2ZC2LAU5FM46VI25TG423KGOT3/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-03T18:51:37Z","links":{"resolver":"https://pith.science/pith/2ZC2LAU5FM46VI25TG423KGOT3","bundle":"https://pith.science/pith/2ZC2LAU5FM46VI25TG423KGOT3/bundle.json","state":"https://pith.science/pith/2ZC2LAU5FM46VI25TG423KGOT3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2ZC2LAU5FM46VI25TG423KGOT3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:2ZC2LAU5FM46VI25TG423KGOT3","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":"bf057bef67982da8bd460630c10dcfb53bcd956455cd6874b424906efe60e357","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-05-29T02:24:45Z","title_canon_sha256":"857fa0c2d073224d801844aa6ed4dac7095c87a06c7a813b1b6fb297988cd8c9"},"schema_version":"1.0","source":{"id":"2205.14556","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.14556","created_at":"2026-07-05T05:04:49Z"},{"alias_kind":"arxiv_version","alias_value":"2205.14556v2","created_at":"2026-07-05T05:04:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.14556","created_at":"2026-07-05T05:04:49Z"},{"alias_kind":"pith_short_12","alias_value":"2ZC2LAU5FM46","created_at":"2026-07-05T05:04:49Z"},{"alias_kind":"pith_short_16","alias_value":"2ZC2LAU5FM46VI25","created_at":"2026-07-05T05:04:49Z"},{"alias_kind":"pith_short_8","alias_value":"2ZC2LAU5","created_at":"2026-07-05T05:04:49Z"}],"graph_snapshots":[{"event_id":"sha256:5392940987d230eef1cdda5ac5d24f1da0fecccedf75cef9a09174cc67c34bd9","target":"graph","created_at":"2026-07-05T05:04:49Z","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/2205.14556/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that for $n>k\\geq 3$, if $G$ is an $n$-vertex graph with chromatic number $k$ but any its proper subgraph has smaller chromatic number, then $G$ contains at most $n-k+3$ copies of cliques of size $k-1$. This answers a problem of Abbott and Zhou and provides a tight bound on a conjecture of Gallai.","authors_text":"Jie Ma, Jun Gao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-05-29T02:24:45Z","title":"Tight bounds towards a conjecture of Gallai"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.14556","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:87b1a10388c1493b830b7635cdd97a2674ed9e6faf46640d76777cd64176f1af","target":"record","created_at":"2026-07-05T05:04:49Z","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":"bf057bef67982da8bd460630c10dcfb53bcd956455cd6874b424906efe60e357","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-05-29T02:24:45Z","title_canon_sha256":"857fa0c2d073224d801844aa6ed4dac7095c87a06c7a813b1b6fb297988cd8c9"},"schema_version":"1.0","source":{"id":"2205.14556","kind":"arxiv","version":2}},"canonical_sha256":"d645a5829d2b39eaa35d99b9ada8ce9edff2157d3485c588b4860d86077f5f53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d645a5829d2b39eaa35d99b9ada8ce9edff2157d3485c588b4860d86077f5f53","first_computed_at":"2026-07-05T05:04:49.011668Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:04:49.011668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cceIymkhVOwA8IPQFtOCk6/9/jeA52T6tcZ4dWs+yiPkH/gDdTJuhQKc2ES+uZqihAw6oqjQv2hkUb2sneuDAA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:04:49.012124Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.14556","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87b1a10388c1493b830b7635cdd97a2674ed9e6faf46640d76777cd64176f1af","sha256:5392940987d230eef1cdda5ac5d24f1da0fecccedf75cef9a09174cc67c34bd9"],"state_sha256":"3aec10814d8a2cf6836e337597b32023b3414818d589fc1baad9f582c1dbe41f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rLz2RoC9G5lF+8qcgDghvhvuKMI7KAiL+AWVltb8LfDkB//LGXjIsA0Qtle+Qk3PDK9o5f1YXAjsedU0SOOpBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T18:51:37.007879Z","bundle_sha256":"ac885ef7cb6b86d1e9b71b00b6c79ed5863973be60887ad71fbc7330d05702ea"}}