{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:XULY7ZTPYEAOS2QBINXJWSI2K5","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":"f354ca67f0c5129603644110909d3bb7c1454c843dcbc31e6e158c30b9c1e717","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-12T07:46:29Z","title_canon_sha256":"2ceaff6f81310bf0cd4ee6a3b61c203eff7f98caec34fa4fa3a107f7b85ddf76"},"schema_version":"1.0","source":{"id":"2508.08703","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.08703","created_at":"2026-07-05T11:52:32Z"},{"alias_kind":"arxiv_version","alias_value":"2508.08703v1","created_at":"2026-07-05T11:52:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.08703","created_at":"2026-07-05T11:52:32Z"},{"alias_kind":"pith_short_12","alias_value":"XULY7ZTPYEAO","created_at":"2026-07-05T11:52:32Z"},{"alias_kind":"pith_short_16","alias_value":"XULY7ZTPYEAOS2QB","created_at":"2026-07-05T11:52:32Z"},{"alias_kind":"pith_short_8","alias_value":"XULY7ZTP","created_at":"2026-07-05T11:52:32Z"}],"graph_snapshots":[{"event_id":"sha256:a9d88cf56fbff3634c67f6969f2655afca635e248b2b3ba26cf7f0e205531c19","target":"graph","created_at":"2026-07-05T11:52:32Z","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/2508.08703/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Criticality is a fundamental notion in graph theory that has been studied continually since its introduction in the early 50s by Dirac. A graph is called $k$-vertex-critical ($k$-edge-critical) if it is $k$-chromatic but removing any vertex (edge) lowers the chromatic number to $k-1$. A set of edges in a graph is called critical if its removal reduces the chromatic number of the graph.\n  In 1970, Dirac conjectured a rather strong distinction between the notions of vertex- and edge-criticality, namely that for every $k\\ge 4$ there exists a $k$-vertex-critical graph that does not have any critic","authors_text":"Ema Skottova, Raphael Steiner","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-12T07:46:29Z","title":"Critical edge sets in vertex-critical graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.08703","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:1123212aa5e1916efff356afa2475f45a9555170720eb429253ec44fa3dc2813","target":"record","created_at":"2026-07-05T11:52:32Z","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":"f354ca67f0c5129603644110909d3bb7c1454c843dcbc31e6e158c30b9c1e717","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-12T07:46:29Z","title_canon_sha256":"2ceaff6f81310bf0cd4ee6a3b61c203eff7f98caec34fa4fa3a107f7b85ddf76"},"schema_version":"1.0","source":{"id":"2508.08703","kind":"arxiv","version":1}},"canonical_sha256":"bd178fe66fc100e96a01436e9b491a577b7e360bd6b8dc319b688e8f68e03112","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd178fe66fc100e96a01436e9b491a577b7e360bd6b8dc319b688e8f68e03112","first_computed_at":"2026-07-05T11:52:32.560230Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:52:32.560230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sGMBy14WoLGBraSmTCvKWYjz0dheS0lbDkQCMVA84pVWAqR98atLg+G7hC5+5ifu8E5gBlNUY25q551586pjBw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:52:32.560720Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.08703","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1123212aa5e1916efff356afa2475f45a9555170720eb429253ec44fa3dc2813","sha256:a9d88cf56fbff3634c67f6969f2655afca635e248b2b3ba26cf7f0e205531c19"],"state_sha256":"6273c50ee0e8480e4e3f40778ab645c976e2f6e59151d23520f8aa02516f7087"}