{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:RQQEJVNAHNMMNVUWIJ3VCEOVOZ","short_pith_number":"pith:RQQEJVNA","canonical_record":{"source":{"id":"2301.01656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-01-04T15:01:40Z","cross_cats_sorted":[],"title_canon_sha256":"9dfae4328ba2a2df73b6fd9e923d03d894a7987f8a522f19da22444666c72205","abstract_canon_sha256":"2105ea6a3e0b4ae3618914ab401d766dc959cb391354668079c6cad22e81d27e"},"schema_version":"1.0"},"canonical_sha256":"8c2044d5a03b58c6d69642775111d576548226168b1eba771581a5637638b9af","source":{"kind":"arxiv","id":"2301.01656","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.01656","created_at":"2026-07-05T05:30:39Z"},{"alias_kind":"arxiv_version","alias_value":"2301.01656v1","created_at":"2026-07-05T05:30:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.01656","created_at":"2026-07-05T05:30:39Z"},{"alias_kind":"pith_short_12","alias_value":"RQQEJVNAHNMM","created_at":"2026-07-05T05:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"RQQEJVNAHNMMNVUW","created_at":"2026-07-05T05:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"RQQEJVNA","created_at":"2026-07-05T05:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:RQQEJVNAHNMMNVUWIJ3VCEOVOZ","target":"record","payload":{"canonical_record":{"source":{"id":"2301.01656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-01-04T15:01:40Z","cross_cats_sorted":[],"title_canon_sha256":"9dfae4328ba2a2df73b6fd9e923d03d894a7987f8a522f19da22444666c72205","abstract_canon_sha256":"2105ea6a3e0b4ae3618914ab401d766dc959cb391354668079c6cad22e81d27e"},"schema_version":"1.0"},"canonical_sha256":"8c2044d5a03b58c6d69642775111d576548226168b1eba771581a5637638b9af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:30:39.322756Z","signature_b64":"urgHF7OlhiJmmZrVTafonV/lZz70wo3nexpbzK6qck6ofhazkqpPIKSRQTddUEbkZDGaq2EEA3/Io0bQBbodDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c2044d5a03b58c6d69642775111d576548226168b1eba771581a5637638b9af","last_reissued_at":"2026-07-05T05:30:39.322327Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:30:39.322327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.01656","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-05T05:30:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+VJgQSu0SxKfMvta/+z62VnnF6SEYKx3bdAqshAOKkMvOs9Md8raVF8dxo0hJxwgB9rQsIQQgDXD3LlsvlXbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T20:47:40.388344Z"},"content_sha256":"d477f128749a1dc514ac475d54bec8b1569b5306236d470404053b6a877953de","schema_version":"1.0","event_id":"sha256:d477f128749a1dc514ac475d54bec8b1569b5306236d470404053b6a877953de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:RQQEJVNAHNMMNVUWIJ3VCEOVOZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the maximum number of edges in k-critical graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cong Luo, Jie Ma, Tianchi Yang","submitted_at":"2023-01-04T15:01:40Z","abstract_excerpt":"A graph is called $k$-critical if its chromatic number is $k$ but any proper subgraph has chromatic number less than $k$. An old and important problem in graph theory asks to determine the maximum number of edges in an $n$-vertex $k$-critical graph. This is widely open for any integer $k\\geq 4$. Using a structural characterization of Greenwell and Lov\\'asz and an extremal result of Simonovits, Stiebitz proved in 1987 that for $k\\geq 4$ and sufficiently large $n$, this maximum number is less than the number of edges in the $n$-vertex balanced complete $(k-2)$-partite graph. In this paper we obt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.01656","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/2301.01656/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:30:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D6rB7r1GoF6XpCzPVwLxuY6arZk1BmsizoTt5GWZYR0m372gJVxDWujLHm17DL+oTLGmKGNhDrJGyluY+QDEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T20:47:40.388718Z"},"content_sha256":"20a24b2cb0c9c82b749c38b456156bd7aec73517d8d99ad57fe919a224df2be6","schema_version":"1.0","event_id":"sha256:20a24b2cb0c9c82b749c38b456156bd7aec73517d8d99ad57fe919a224df2be6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RQQEJVNAHNMMNVUWIJ3VCEOVOZ/bundle.json","state_url":"https://pith.science/pith/RQQEJVNAHNMMNVUWIJ3VCEOVOZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RQQEJVNAHNMMNVUWIJ3VCEOVOZ/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-07-18T20:47:40Z","links":{"resolver":"https://pith.science/pith/RQQEJVNAHNMMNVUWIJ3VCEOVOZ","bundle":"https://pith.science/pith/RQQEJVNAHNMMNVUWIJ3VCEOVOZ/bundle.json","state":"https://pith.science/pith/RQQEJVNAHNMMNVUWIJ3VCEOVOZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RQQEJVNAHNMMNVUWIJ3VCEOVOZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:RQQEJVNAHNMMNVUWIJ3VCEOVOZ","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":"2105ea6a3e0b4ae3618914ab401d766dc959cb391354668079c6cad22e81d27e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-01-04T15:01:40Z","title_canon_sha256":"9dfae4328ba2a2df73b6fd9e923d03d894a7987f8a522f19da22444666c72205"},"schema_version":"1.0","source":{"id":"2301.01656","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.01656","created_at":"2026-07-05T05:30:39Z"},{"alias_kind":"arxiv_version","alias_value":"2301.01656v1","created_at":"2026-07-05T05:30:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.01656","created_at":"2026-07-05T05:30:39Z"},{"alias_kind":"pith_short_12","alias_value":"RQQEJVNAHNMM","created_at":"2026-07-05T05:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"RQQEJVNAHNMMNVUW","created_at":"2026-07-05T05:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"RQQEJVNA","created_at":"2026-07-05T05:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:20a24b2cb0c9c82b749c38b456156bd7aec73517d8d99ad57fe919a224df2be6","target":"graph","created_at":"2026-07-05T05:30:39Z","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/2301.01656/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph is called $k$-critical if its chromatic number is $k$ but any proper subgraph has chromatic number less than $k$. An old and important problem in graph theory asks to determine the maximum number of edges in an $n$-vertex $k$-critical graph. This is widely open for any integer $k\\geq 4$. Using a structural characterization of Greenwell and Lov\\'asz and an extremal result of Simonovits, Stiebitz proved in 1987 that for $k\\geq 4$ and sufficiently large $n$, this maximum number is less than the number of edges in the $n$-vertex balanced complete $(k-2)$-partite graph. In this paper we obt","authors_text":"Cong Luo, Jie Ma, Tianchi Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-01-04T15:01:40Z","title":"On the maximum number of edges in k-critical graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.01656","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:d477f128749a1dc514ac475d54bec8b1569b5306236d470404053b6a877953de","target":"record","created_at":"2026-07-05T05:30:39Z","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":"2105ea6a3e0b4ae3618914ab401d766dc959cb391354668079c6cad22e81d27e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-01-04T15:01:40Z","title_canon_sha256":"9dfae4328ba2a2df73b6fd9e923d03d894a7987f8a522f19da22444666c72205"},"schema_version":"1.0","source":{"id":"2301.01656","kind":"arxiv","version":1}},"canonical_sha256":"8c2044d5a03b58c6d69642775111d576548226168b1eba771581a5637638b9af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c2044d5a03b58c6d69642775111d576548226168b1eba771581a5637638b9af","first_computed_at":"2026-07-05T05:30:39.322327Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:30:39.322327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"urgHF7OlhiJmmZrVTafonV/lZz70wo3nexpbzK6qck6ofhazkqpPIKSRQTddUEbkZDGaq2EEA3/Io0bQBbodDA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:30:39.322756Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.01656","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d477f128749a1dc514ac475d54bec8b1569b5306236d470404053b6a877953de","sha256:20a24b2cb0c9c82b749c38b456156bd7aec73517d8d99ad57fe919a224df2be6"],"state_sha256":"685538c16ff0fbe4ffd4bd60e67f2d65a7155461a9d28491e95733b99fa8005e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jLWBjIYCyz2SG4Sge2jEYfEK2GgbCPuY1+NBb8fEatBuLiDTWA2KJ9aSlPVtb7ZIV3RWq8c7ncDQzz0hdwDCCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-18T20:47:40.390847Z","bundle_sha256":"b2e5af7fcaae7380a37c8397c0dc89fe674d07edf0426762119d4843772712a5"}}