{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SIEMN4OIBJNWBM27PGEE6AQVCG","short_pith_number":"pith:SIEMN4OI","canonical_record":{"source":{"id":"1805.05996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-15T19:00:27Z","cross_cats_sorted":[],"title_canon_sha256":"efcb72b85c70b4cc3b96bd5548a58ee564b10976d31f9104c4015bbd6c7418db","abstract_canon_sha256":"25d54b90d04e40ed7f79490217a3d56f79b7833b838526b527a124998b59fc00"},"schema_version":"1.0"},"canonical_sha256":"9208c6f1c80a5b60b35f79884f0215118395d49e0b04577de2e1ab4fe84a5e05","source":{"kind":"arxiv","id":"1805.05996","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05996","created_at":"2026-05-18T00:15:49Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05996v1","created_at":"2026-05-18T00:15:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05996","created_at":"2026-05-18T00:15:49Z"},{"alias_kind":"pith_short_12","alias_value":"SIEMN4OIBJNW","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SIEMN4OIBJNWBM27","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SIEMN4OI","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SIEMN4OIBJNWBM27PGEE6AQVCG","target":"record","payload":{"canonical_record":{"source":{"id":"1805.05996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-15T19:00:27Z","cross_cats_sorted":[],"title_canon_sha256":"efcb72b85c70b4cc3b96bd5548a58ee564b10976d31f9104c4015bbd6c7418db","abstract_canon_sha256":"25d54b90d04e40ed7f79490217a3d56f79b7833b838526b527a124998b59fc00"},"schema_version":"1.0"},"canonical_sha256":"9208c6f1c80a5b60b35f79884f0215118395d49e0b04577de2e1ab4fe84a5e05","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:49.205930Z","signature_b64":"a39h7jivXpoy9y3UynrfeJdm+20rqbD0HCIbQZ8XwJ23wcaTllGuP8SC2+wYGJ9PUnuGfhcmxPSluUK1WjZeCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9208c6f1c80a5b60b35f79884f0215118395d49e0b04577de2e1ab4fe84a5e05","last_reissued_at":"2026-05-18T00:15:49.205384Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:49.205384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.05996","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-05-18T00:15:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zZz9ZgwG4DYUipQd+EnWFYLc8Ora1Pavv3CGcwfdtkangHzbhsrGMjGb6zpXndtHvsdRg58CukJP/DZsf/b8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T18:17:43.558297Z"},"content_sha256":"222cc1f4a7feb77cb00bf32f9a8b481950288a2441c009ab8de2332c484e9625","schema_version":"1.0","event_id":"sha256:222cc1f4a7feb77cb00bf32f9a8b481950288a2441c009ab8de2332c484e9625"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SIEMN4OIBJNWBM27PGEE6AQVCG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Independence number of edge-chromatic critical graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guangming Jing, Guantao Chen, Songling Shan, Yan Cao","submitted_at":"2018-05-15T19:00:27Z","abstract_excerpt":"Let $G$ be a simple graph with maximum degree $\\Delta(G)$ and chromatic index $\\chi'(G)$. A classic result of Vizing indicates that either $\\chi'(G )=\\Delta(G)$ or $\\chi'(G )=\\Delta(G)+1$. The graph $G$ is called $\\Delta$-critical if $G$ is connected, $\\chi'(G )=\\Delta(G)+1$ and for any $e\\in E(G)$, $\\chi'(G-e)=\\Delta(G)$. Let $G$ be an $n$-vertex $\\Delta$-critical graph. Vizing conjectured that $\\alpha(G)$, the independence number of $G$, is at most $\\frac{n}{2}$. The current best result on this conjecture, shown by Woodall, is that $\\alpha(G)<\\frac{3n}{5}$. We show that for any given $\\varep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05996","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":""},"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-05-18T00:15:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nDbk7eYdQ8HmbnlFincyUbWG3KAje7wb0/Gvaro8qIqdrzCtIfFDmquTt/NRQq21nvKkxwsJbgPDzK8iW2YwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T18:17:43.559002Z"},"content_sha256":"028301b8babfd6cd3d38bb9035872357331f9eed43be34b587cfdded6b0623a8","schema_version":"1.0","event_id":"sha256:028301b8babfd6cd3d38bb9035872357331f9eed43be34b587cfdded6b0623a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SIEMN4OIBJNWBM27PGEE6AQVCG/bundle.json","state_url":"https://pith.science/pith/SIEMN4OIBJNWBM27PGEE6AQVCG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SIEMN4OIBJNWBM27PGEE6AQVCG/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-05-24T18:17:43Z","links":{"resolver":"https://pith.science/pith/SIEMN4OIBJNWBM27PGEE6AQVCG","bundle":"https://pith.science/pith/SIEMN4OIBJNWBM27PGEE6AQVCG/bundle.json","state":"https://pith.science/pith/SIEMN4OIBJNWBM27PGEE6AQVCG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SIEMN4OIBJNWBM27PGEE6AQVCG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SIEMN4OIBJNWBM27PGEE6AQVCG","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":"25d54b90d04e40ed7f79490217a3d56f79b7833b838526b527a124998b59fc00","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-15T19:00:27Z","title_canon_sha256":"efcb72b85c70b4cc3b96bd5548a58ee564b10976d31f9104c4015bbd6c7418db"},"schema_version":"1.0","source":{"id":"1805.05996","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05996","created_at":"2026-05-18T00:15:49Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05996v1","created_at":"2026-05-18T00:15:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05996","created_at":"2026-05-18T00:15:49Z"},{"alias_kind":"pith_short_12","alias_value":"SIEMN4OIBJNW","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SIEMN4OIBJNWBM27","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SIEMN4OI","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:028301b8babfd6cd3d38bb9035872357331f9eed43be34b587cfdded6b0623a8","target":"graph","created_at":"2026-05-18T00:15: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"},"paper":{"abstract_excerpt":"Let $G$ be a simple graph with maximum degree $\\Delta(G)$ and chromatic index $\\chi'(G)$. A classic result of Vizing indicates that either $\\chi'(G )=\\Delta(G)$ or $\\chi'(G )=\\Delta(G)+1$. The graph $G$ is called $\\Delta$-critical if $G$ is connected, $\\chi'(G )=\\Delta(G)+1$ and for any $e\\in E(G)$, $\\chi'(G-e)=\\Delta(G)$. Let $G$ be an $n$-vertex $\\Delta$-critical graph. Vizing conjectured that $\\alpha(G)$, the independence number of $G$, is at most $\\frac{n}{2}$. The current best result on this conjecture, shown by Woodall, is that $\\alpha(G)<\\frac{3n}{5}$. We show that for any given $\\varep","authors_text":"Guangming Jing, Guantao Chen, Songling Shan, Yan Cao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-15T19:00:27Z","title":"Independence number of edge-chromatic critical graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05996","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:222cc1f4a7feb77cb00bf32f9a8b481950288a2441c009ab8de2332c484e9625","target":"record","created_at":"2026-05-18T00:15: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":"25d54b90d04e40ed7f79490217a3d56f79b7833b838526b527a124998b59fc00","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-15T19:00:27Z","title_canon_sha256":"efcb72b85c70b4cc3b96bd5548a58ee564b10976d31f9104c4015bbd6c7418db"},"schema_version":"1.0","source":{"id":"1805.05996","kind":"arxiv","version":1}},"canonical_sha256":"9208c6f1c80a5b60b35f79884f0215118395d49e0b04577de2e1ab4fe84a5e05","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9208c6f1c80a5b60b35f79884f0215118395d49e0b04577de2e1ab4fe84a5e05","first_computed_at":"2026-05-18T00:15:49.205384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:49.205384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a39h7jivXpoy9y3UynrfeJdm+20rqbD0HCIbQZ8XwJ23wcaTllGuP8SC2+wYGJ9PUnuGfhcmxPSluUK1WjZeCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:49.205930Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.05996","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:222cc1f4a7feb77cb00bf32f9a8b481950288a2441c009ab8de2332c484e9625","sha256:028301b8babfd6cd3d38bb9035872357331f9eed43be34b587cfdded6b0623a8"],"state_sha256":"cfbf13be23d41abc7d26f46dfe6002fa4ea2a6569ac3431b37bea6a671daafc0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wNPC2oHvruHWw7dc6uvg8tV1BF8yF34UpaldMygJRuF15ziakemacPWP8HCXmaPyjqXUVzlxPqe9dfDVm0vbCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T18:17:43.562595Z","bundle_sha256":"dcfce20799c4442ac110b4b3ce2a8befd66ebb2276c9dfd02475dafc40578ac3"}}