{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3SPAET44NIL5WTJS3PU32G4X3M","short_pith_number":"pith:3SPAET44","schema_version":"1.0","canonical_sha256":"dc9e024f9c6a17db4d32dbe9bd1b97db110caab76edb5b3c9f36fcb05c5edf66","source":{"kind":"arxiv","id":"1602.02949","version":1},"attestation_state":"computed","paper":{"title":"Weak oddness as an approximation of oddness and resistance in cubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"J\\'an Maz\\'ak, Robert Luko\\v{t}ka","submitted_at":"2016-02-09T11:58:14Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1602.02949","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-02-09T11:58:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"999c6298dac6456fb702b78dbcb5a263e27d9d536765c6dd48ae6604765b9fd1","abstract_canon_sha256":"a47dd1c63da62ae49272ce3b629aa6587d8747438ada83e805a92a68b4f1715a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:06.018406Z","signature_b64":"AO+TluNqLfLlreLKcz1eXfeJXXLgLE13FCxW4VnCLJjTi3t3wYoHDYg3/XEu+umqiF2m4GyzlXOEaMWPa6MPDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc9e024f9c6a17db4d32dbe9bd1b97db110caab76edb5b3c9f36fcb05c5edf66","last_reissued_at":"2026-05-18T01:21:06.017780Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:06.017780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weak oddness as an approximation of oddness and resistance in cubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"J\\'an Maz\\'ak, Robert Luko\\v{t}ka","submitted_at":"2016-02-09T11:58:14Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02949","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.02949","created_at":"2026-05-18T01:21:06.017889+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.02949v1","created_at":"2026-05-18T01:21:06.017889+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02949","created_at":"2026-05-18T01:21:06.017889+00:00"},{"alias_kind":"pith_short_12","alias_value":"3SPAET44NIL5","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"3SPAET44NIL5WTJS","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"3SPAET44","created_at":"2026-05-18T12:29:58.707656+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3SPAET44NIL5WTJS3PU32G4X3M","json":"https://pith.science/pith/3SPAET44NIL5WTJS3PU32G4X3M.json","graph_json":"https://pith.science/api/pith-number/3SPAET44NIL5WTJS3PU32G4X3M/graph.json","events_json":"https://pith.science/api/pith-number/3SPAET44NIL5WTJS3PU32G4X3M/events.json","paper":"https://pith.science/paper/3SPAET44"},"agent_actions":{"view_html":"https://pith.science/pith/3SPAET44NIL5WTJS3PU32G4X3M","download_json":"https://pith.science/pith/3SPAET44NIL5WTJS3PU32G4X3M.json","view_paper":"https://pith.science/paper/3SPAET44","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.02949&json=true","fetch_graph":"https://pith.science/api/pith-number/3SPAET44NIL5WTJS3PU32G4X3M/graph.json","fetch_events":"https://pith.science/api/pith-number/3SPAET44NIL5WTJS3PU32G4X3M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3SPAET44NIL5WTJS3PU32G4X3M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3SPAET44NIL5WTJS3PU32G4X3M/action/storage_attestation","attest_author":"https://pith.science/pith/3SPAET44NIL5WTJS3PU32G4X3M/action/author_attestation","sign_citation":"https://pith.science/pith/3SPAET44NIL5WTJS3PU32G4X3M/action/citation_signature","submit_replication":"https://pith.science/pith/3SPAET44NIL5WTJS3PU32G4X3M/action/replication_record"}},"created_at":"2026-05-18T01:21:06.017889+00:00","updated_at":"2026-05-18T01:21:06.017889+00:00"}