{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WZ4KIHWJFDKBFJSQ3TALG3VAMA","short_pith_number":"pith:WZ4KIHWJ","schema_version":"1.0","canonical_sha256":"b678a41ec928d412a650dcc0b36ea0601af3c2949f761def62a130067e7bd95a","source":{"kind":"arxiv","id":"1710.00757","version":2},"attestation_state":"computed","paper":{"title":"On the smallest snarks with oddness 4 and connectivity 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jan Goedgebeur","submitted_at":"2017-10-02T16:26:46Z","abstract_excerpt":"A snark is a bridgeless cubic graph which is not 3-edge-colourable. The oddness of a bridgeless cubic graph is the minimum number of odd components in any 2-factor of the graph.\n  Lukot'ka, M\\'acajov\\'a, Maz\\'ak and \\v{S}koviera showed in [Electron. J. Combin. 22 (2015)] that the smallest snark with oddness 4 has 28 vertices and remarked that there are exactly two such graphs of that order. However, this remark is incorrect as -- using an exhaustive computer search -- we show that there are in fact three snarks with oddness 4 on 28 vertices. In this note we present the missing snark and also d"},"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":"1710.00757","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-02T16:26:46Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c09cd7b7385beb5f5c8e210babe8134cb1369c1f54ee9bb1e06c54ab9401a026","abstract_canon_sha256":"110b6ab546ab4ad1d9cc970ee47c36b3a5eec10b57a93567215f9687be243562"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:24.118721Z","signature_b64":"T/cHn1PTHsoQLp55bpI1CFZ0AA8i+W2+z9lSflp0Xw6T9zngvQkReGp66ePsS6d5E6bkLhceVWC7gtJT7BGxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b678a41ec928d412a650dcc0b36ea0601af3c2949f761def62a130067e7bd95a","last_reissued_at":"2026-05-18T00:17:24.118000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:24.118000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the smallest snarks with oddness 4 and connectivity 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jan Goedgebeur","submitted_at":"2017-10-02T16:26:46Z","abstract_excerpt":"A snark is a bridgeless cubic graph which is not 3-edge-colourable. The oddness of a bridgeless cubic graph is the minimum number of odd components in any 2-factor of the graph.\n  Lukot'ka, M\\'acajov\\'a, Maz\\'ak and \\v{S}koviera showed in [Electron. J. Combin. 22 (2015)] that the smallest snark with oddness 4 has 28 vertices and remarked that there are exactly two such graphs of that order. However, this remark is incorrect as -- using an exhaustive computer search -- we show that there are in fact three snarks with oddness 4 on 28 vertices. In this note we present the missing snark and also d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00757","kind":"arxiv","version":2},"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":"1710.00757","created_at":"2026-05-18T00:17:24.118124+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.00757v2","created_at":"2026-05-18T00:17:24.118124+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00757","created_at":"2026-05-18T00:17:24.118124+00:00"},{"alias_kind":"pith_short_12","alias_value":"WZ4KIHWJFDKB","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WZ4KIHWJFDKBFJSQ","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WZ4KIHWJ","created_at":"2026-05-18T12:31:53.515858+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/WZ4KIHWJFDKBFJSQ3TALG3VAMA","json":"https://pith.science/pith/WZ4KIHWJFDKBFJSQ3TALG3VAMA.json","graph_json":"https://pith.science/api/pith-number/WZ4KIHWJFDKBFJSQ3TALG3VAMA/graph.json","events_json":"https://pith.science/api/pith-number/WZ4KIHWJFDKBFJSQ3TALG3VAMA/events.json","paper":"https://pith.science/paper/WZ4KIHWJ"},"agent_actions":{"view_html":"https://pith.science/pith/WZ4KIHWJFDKBFJSQ3TALG3VAMA","download_json":"https://pith.science/pith/WZ4KIHWJFDKBFJSQ3TALG3VAMA.json","view_paper":"https://pith.science/paper/WZ4KIHWJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.00757&json=true","fetch_graph":"https://pith.science/api/pith-number/WZ4KIHWJFDKBFJSQ3TALG3VAMA/graph.json","fetch_events":"https://pith.science/api/pith-number/WZ4KIHWJFDKBFJSQ3TALG3VAMA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WZ4KIHWJFDKBFJSQ3TALG3VAMA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WZ4KIHWJFDKBFJSQ3TALG3VAMA/action/storage_attestation","attest_author":"https://pith.science/pith/WZ4KIHWJFDKBFJSQ3TALG3VAMA/action/author_attestation","sign_citation":"https://pith.science/pith/WZ4KIHWJFDKBFJSQ3TALG3VAMA/action/citation_signature","submit_replication":"https://pith.science/pith/WZ4KIHWJFDKBFJSQ3TALG3VAMA/action/replication_record"}},"created_at":"2026-05-18T00:17:24.118124+00:00","updated_at":"2026-05-18T00:17:24.118124+00:00"}