{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WZ4KIHWJFDKBFJSQ3TALG3VAMA","short_pith_number":"pith:WZ4KIHWJ","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"},"canonical_sha256":"b678a41ec928d412a650dcc0b36ea0601af3c2949f761def62a130067e7bd95a","source":{"kind":"arxiv","id":"1710.00757","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00757","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00757v2","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00757","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"WZ4KIHWJFDKB","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WZ4KIHWJFDKBFJSQ","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WZ4KIHWJ","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WZ4KIHWJFDKBFJSQ3TALG3VAMA","target":"record","payload":{"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"},"canonical_sha256":"b678a41ec928d412a650dcc0b36ea0601af3c2949f761def62a130067e7bd95a","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"},"source_kind":"arxiv","source_id":"1710.00757","source_version":2,"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:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bNO5Jt9iVGOLic0zeJNVdaQ7rC5TGJ7eQPTu3ZNxFtZBHSSHUM1ogZvyPySmvT1YsE9lOh4oTNVJuz7H6CwMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:12:51.171204Z"},"content_sha256":"7f2b83d5189831953377ab5840fd8126949264c6120742df6248dd8740e9729a","schema_version":"1.0","event_id":"sha256:7f2b83d5189831953377ab5840fd8126949264c6120742df6248dd8740e9729a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WZ4KIHWJFDKBFJSQ3TALG3VAMA","target":"graph","payload":{"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"},"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:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jtLrKupTgMftFJPOORFabzRG7wVmHUQ+kesHU2aES42qYXxAedqXywZu1moaEvYM7w8mdxjXZyA5v6FYCYjvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:12:51.171584Z"},"content_sha256":"0ffb9ef0f6bd36da7ee8bdf536fff7936008333bd5822ad87289069be3a3f685","schema_version":"1.0","event_id":"sha256:0ffb9ef0f6bd36da7ee8bdf536fff7936008333bd5822ad87289069be3a3f685"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WZ4KIHWJFDKBFJSQ3TALG3VAMA/bundle.json","state_url":"https://pith.science/pith/WZ4KIHWJFDKBFJSQ3TALG3VAMA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WZ4KIHWJFDKBFJSQ3TALG3VAMA/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-31T01:12:51Z","links":{"resolver":"https://pith.science/pith/WZ4KIHWJFDKBFJSQ3TALG3VAMA","bundle":"https://pith.science/pith/WZ4KIHWJFDKBFJSQ3TALG3VAMA/bundle.json","state":"https://pith.science/pith/WZ4KIHWJFDKBFJSQ3TALG3VAMA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WZ4KIHWJFDKBFJSQ3TALG3VAMA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WZ4KIHWJFDKBFJSQ3TALG3VAMA","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":"110b6ab546ab4ad1d9cc970ee47c36b3a5eec10b57a93567215f9687be243562","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-02T16:26:46Z","title_canon_sha256":"c09cd7b7385beb5f5c8e210babe8134cb1369c1f54ee9bb1e06c54ab9401a026"},"schema_version":"1.0","source":{"id":"1710.00757","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00757","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00757v2","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00757","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"WZ4KIHWJFDKB","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WZ4KIHWJFDKBFJSQ","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WZ4KIHWJ","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:0ffb9ef0f6bd36da7ee8bdf536fff7936008333bd5822ad87289069be3a3f685","target":"graph","created_at":"2026-05-18T00:17:24Z","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":"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","authors_text":"Jan Goedgebeur","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-02T16:26:46Z","title":"On the smallest snarks with oddness 4 and connectivity 2"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00757","kind":"arxiv","version":2},"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:7f2b83d5189831953377ab5840fd8126949264c6120742df6248dd8740e9729a","target":"record","created_at":"2026-05-18T00:17:24Z","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":"110b6ab546ab4ad1d9cc970ee47c36b3a5eec10b57a93567215f9687be243562","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-02T16:26:46Z","title_canon_sha256":"c09cd7b7385beb5f5c8e210babe8134cb1369c1f54ee9bb1e06c54ab9401a026"},"schema_version":"1.0","source":{"id":"1710.00757","kind":"arxiv","version":2}},"canonical_sha256":"b678a41ec928d412a650dcc0b36ea0601af3c2949f761def62a130067e7bd95a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b678a41ec928d412a650dcc0b36ea0601af3c2949f761def62a130067e7bd95a","first_computed_at":"2026-05-18T00:17:24.118000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:24.118000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T/cHn1PTHsoQLp55bpI1CFZ0AA8i+W2+z9lSflp0Xw6T9zngvQkReGp66ePsS6d5E6bkLhceVWC7gtJT7BGxBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:24.118721Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.00757","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f2b83d5189831953377ab5840fd8126949264c6120742df6248dd8740e9729a","sha256:0ffb9ef0f6bd36da7ee8bdf536fff7936008333bd5822ad87289069be3a3f685"],"state_sha256":"e9def5446e86b576c28da0e02e0d7a5d06207a581fb87b76a80ea83ed9b0e487"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SdBIahBQ+Ca5FQ7wUHRL2HZ854C5DFGQ74YCpybR492EVh5HmM7K5rz1sv11UH3zk3CzC4Qv7GqUQVn4lXo6Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:12:51.174125Z","bundle_sha256":"a693365fa0b0270d5fa6afbe97568bf3a9022f81d5cff48f10e7a0b13e1df6b9"}}