{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HQA4ONF6XE4CEOVOLQSELQEOWO","short_pith_number":"pith:HQA4ONF6","canonical_record":{"source":{"id":"1712.07867","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-21T10:40:49Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b0eb5a17ab76c68f46aafe24df6eec43726934186bafde4a8657e2ae0b29e99f","abstract_canon_sha256":"3223044a7166385cb76076f8981eb4981920e7788e987e954a9bff0ca74949c4"},"schema_version":"1.0"},"canonical_sha256":"3c01c734beb938223aae5c2445c08eb3ad36445cda5c4c5b978455f94e5b2d25","source":{"kind":"arxiv","id":"1712.07867","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07867","created_at":"2026-05-17T23:56:38Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07867v3","created_at":"2026-05-17T23:56:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07867","created_at":"2026-05-17T23:56:38Z"},{"alias_kind":"pith_short_12","alias_value":"HQA4ONF6XE4C","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HQA4ONF6XE4CEOVO","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HQA4ONF6","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HQA4ONF6XE4CEOVOLQSELQEOWO","target":"record","payload":{"canonical_record":{"source":{"id":"1712.07867","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-21T10:40:49Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b0eb5a17ab76c68f46aafe24df6eec43726934186bafde4a8657e2ae0b29e99f","abstract_canon_sha256":"3223044a7166385cb76076f8981eb4981920e7788e987e954a9bff0ca74949c4"},"schema_version":"1.0"},"canonical_sha256":"3c01c734beb938223aae5c2445c08eb3ad36445cda5c4c5b978455f94e5b2d25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:38.882140Z","signature_b64":"EUG9HaV6U0hVdPNv6aG0B2zqnKx6mAzMQDJAiyOvs2TzMhwHAYl9bjqh27Y7Qwtip12Q8sJw9z6K/E7UIDOWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c01c734beb938223aae5c2445c08eb3ad36445cda5c4c5b978455f94e5b2d25","last_reissued_at":"2026-05-17T23:56:38.881567Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:38.881567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.07867","source_version":3,"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-17T23:56:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TAYwl+UqRRX20xUbHCxBMcVbx0IURqSpTgsZUIXEuEyrBHpItY5O0EhGMdF9nA202ja7SPFI6oN/mhY1pJSjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:23:13.500562Z"},"content_sha256":"e346242c7f7f58098f76e9b81a66afa312820c10678642771a5d59fd22e3c778","schema_version":"1.0","event_id":"sha256:e346242c7f7f58098f76e9b81a66afa312820c10678642771a5d59fd22e3c778"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HQA4ONF6XE4CEOVOLQSELQEOWO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Edita M\\'a\\v{c}ajov\\'a, Jan Goedgebeur, Martin \\v{S}koviera","submitted_at":"2017-12-21T10:40:49Z","abstract_excerpt":"The family of snarks -- connected bridgeless cubic graphs that cannot be 3-edge-coloured -- is well-known as a potential source of counterexamples to several important and long-standing conjectures in graph theory. These include the cycle double cover conjecture, Tutte's 5-flow conjecture, Fulkerson's conjecture, and several others. One way of approaching these conjectures is through the study of structural properties of snarks and construction of small examples with given properties. In this paper we deal with the problem of determining the smallest order of a nontrivial snark (that is, one w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07867","kind":"arxiv","version":3},"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-17T23:56:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A93/8iKfrsTCjRy7whWqG+rML/7KYdZVwZQkXRj0DRSO1adMiVHjEt2iMS1UhJ5Zo3GuN21/24LrvG7GMScAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:23:13.500976Z"},"content_sha256":"1f8be8eac711a79ccc20a5bcff5fbc86f625d7791946dc071dd1710f5ff918ef","schema_version":"1.0","event_id":"sha256:1f8be8eac711a79ccc20a5bcff5fbc86f625d7791946dc071dd1710f5ff918ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HQA4ONF6XE4CEOVOLQSELQEOWO/bundle.json","state_url":"https://pith.science/pith/HQA4ONF6XE4CEOVOLQSELQEOWO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HQA4ONF6XE4CEOVOLQSELQEOWO/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-26T02:23:13Z","links":{"resolver":"https://pith.science/pith/HQA4ONF6XE4CEOVOLQSELQEOWO","bundle":"https://pith.science/pith/HQA4ONF6XE4CEOVOLQSELQEOWO/bundle.json","state":"https://pith.science/pith/HQA4ONF6XE4CEOVOLQSELQEOWO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HQA4ONF6XE4CEOVOLQSELQEOWO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HQA4ONF6XE4CEOVOLQSELQEOWO","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":"3223044a7166385cb76076f8981eb4981920e7788e987e954a9bff0ca74949c4","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-21T10:40:49Z","title_canon_sha256":"b0eb5a17ab76c68f46aafe24df6eec43726934186bafde4a8657e2ae0b29e99f"},"schema_version":"1.0","source":{"id":"1712.07867","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07867","created_at":"2026-05-17T23:56:38Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07867v3","created_at":"2026-05-17T23:56:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07867","created_at":"2026-05-17T23:56:38Z"},{"alias_kind":"pith_short_12","alias_value":"HQA4ONF6XE4C","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HQA4ONF6XE4CEOVO","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HQA4ONF6","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:1f8be8eac711a79ccc20a5bcff5fbc86f625d7791946dc071dd1710f5ff918ef","target":"graph","created_at":"2026-05-17T23:56:38Z","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":"The family of snarks -- connected bridgeless cubic graphs that cannot be 3-edge-coloured -- is well-known as a potential source of counterexamples to several important and long-standing conjectures in graph theory. These include the cycle double cover conjecture, Tutte's 5-flow conjecture, Fulkerson's conjecture, and several others. One way of approaching these conjectures is through the study of structural properties of snarks and construction of small examples with given properties. In this paper we deal with the problem of determining the smallest order of a nontrivial snark (that is, one w","authors_text":"Edita M\\'a\\v{c}ajov\\'a, Jan Goedgebeur, Martin \\v{S}koviera","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-21T10:40:49Z","title":"Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07867","kind":"arxiv","version":3},"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:e346242c7f7f58098f76e9b81a66afa312820c10678642771a5d59fd22e3c778","target":"record","created_at":"2026-05-17T23:56:38Z","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":"3223044a7166385cb76076f8981eb4981920e7788e987e954a9bff0ca74949c4","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-21T10:40:49Z","title_canon_sha256":"b0eb5a17ab76c68f46aafe24df6eec43726934186bafde4a8657e2ae0b29e99f"},"schema_version":"1.0","source":{"id":"1712.07867","kind":"arxiv","version":3}},"canonical_sha256":"3c01c734beb938223aae5c2445c08eb3ad36445cda5c4c5b978455f94e5b2d25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c01c734beb938223aae5c2445c08eb3ad36445cda5c4c5b978455f94e5b2d25","first_computed_at":"2026-05-17T23:56:38.881567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:38.881567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EUG9HaV6U0hVdPNv6aG0B2zqnKx6mAzMQDJAiyOvs2TzMhwHAYl9bjqh27Y7Qwtip12Q8sJw9z6K/E7UIDOWCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:38.882140Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.07867","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e346242c7f7f58098f76e9b81a66afa312820c10678642771a5d59fd22e3c778","sha256:1f8be8eac711a79ccc20a5bcff5fbc86f625d7791946dc071dd1710f5ff918ef"],"state_sha256":"d6ebdce1b3142b2ee219d81cb11a4f79b77de816b8002b2319e46f7bd5cd1ed4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qs7wYlahhJYMRWbCG8gZl/zrQq0W0O0LywMQyam5C4RxvuZc99aLnyscLSBQoTrvbbV5AvLJb5aNWruR/o+1Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:23:13.503901Z","bundle_sha256":"96d226aa137a0d3512de54558f45e772b40ad3c63eb8aa94ca9c606e6bf0af94"}}