{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3SPAET44NIL5WTJS3PU32G4X3M","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":"a47dd1c63da62ae49272ce3b629aa6587d8747438ada83e805a92a68b4f1715a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-02-09T11:58:14Z","title_canon_sha256":"999c6298dac6456fb702b78dbcb5a263e27d9d536765c6dd48ae6604765b9fd1"},"schema_version":"1.0","source":{"id":"1602.02949","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02949","created_at":"2026-05-18T01:21:06Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02949v1","created_at":"2026-05-18T01:21:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02949","created_at":"2026-05-18T01:21:06Z"},{"alias_kind":"pith_short_12","alias_value":"3SPAET44NIL5","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"3SPAET44NIL5WTJS","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"3SPAET44","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:adcb51c9bdd4c307d2e684052f2f12d7e8298e320d756510a7b8114a47672296","target":"graph","created_at":"2026-05-18T01:21:06Z","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":"We introduce weak oddness $\\omega_{\\textrm w}$, a new measure of uncolourability of cubic graphs, defined as the least number of odd components in an even factor. For every bridgeless cubic graph $G$, $\\rho(G)\\le\\omega_{\\textrm w}(G)\\le\\omega(G)$, where $\\rho(G)$ denotes the resistance of $G$ and $\\omega(G)$ denotes the oddness of $G$, so this new measure is an approximation of both oddness and resistance. We demonstrate that there are graphs $G$ satisfying $\\rho(G) < \\omega_{\\textrm w}(G) < \\omega(G)$, and that the difference between any two of those three measures can be arbitrarily large. T","authors_text":"J\\'an Maz\\'ak, Robert Luko\\v{t}ka","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-02-09T11:58:14Z","title":"Weak oddness as an approximation of oddness and resistance in cubic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02949","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:6656b24b2769cbcfd561b2eb67ace6ff8d0939ef1f9af187e12c14e303cc465f","target":"record","created_at":"2026-05-18T01:21:06Z","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":"a47dd1c63da62ae49272ce3b629aa6587d8747438ada83e805a92a68b4f1715a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-02-09T11:58:14Z","title_canon_sha256":"999c6298dac6456fb702b78dbcb5a263e27d9d536765c6dd48ae6604765b9fd1"},"schema_version":"1.0","source":{"id":"1602.02949","kind":"arxiv","version":1}},"canonical_sha256":"dc9e024f9c6a17db4d32dbe9bd1b97db110caab76edb5b3c9f36fcb05c5edf66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc9e024f9c6a17db4d32dbe9bd1b97db110caab76edb5b3c9f36fcb05c5edf66","first_computed_at":"2026-05-18T01:21:06.017780Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:06.017780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AO+TluNqLfLlreLKcz1eXfeJXXLgLE13FCxW4VnCLJjTi3t3wYoHDYg3/XEu+umqiF2m4GyzlXOEaMWPa6MPDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:06.018406Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.02949","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6656b24b2769cbcfd561b2eb67ace6ff8d0939ef1f9af187e12c14e303cc465f","sha256:adcb51c9bdd4c307d2e684052f2f12d7e8298e320d756510a7b8114a47672296"],"state_sha256":"4e2f2b7e9e9d8d439f62855457549d4a3341c1568c0ee75eab0320aa5d7a115b"}