{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:IWHZQ6WM32Y2YAUNIEBI2EOFVN","short_pith_number":"pith:IWHZQ6WM","schema_version":"1.0","canonical_sha256":"458f987accdeb1ac028d41028d11c5ab6fd2b5ad6c7edb9cec4ba2fc2a5b6fac","source":{"kind":"arxiv","id":"1212.3641","version":1},"attestation_state":"computed","paper":{"title":"Small snarks with large oddness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Edita Macajova, Jan Mazak, Martin Skoviera, Robert Lukotka","submitted_at":"2012-12-14T23:54:55Z","abstract_excerpt":"We estimate the minimum number of vertices of a cubic graph with given oddness and cyclic connectivity. We prove that a bridgeless cubic graph $G$ with oddness $\\omega(G)$ other than the Petersen graph has at least $5.41\\cdot\\omega(G)$ vertices, and for each integer $k$ with $2\\le k\\le 6$ we construct an infinite family of cubic graphs with cyclic connectivity $k$ and small oddness ratio $|V(G)|/\\omega(G)$. In particular, for cyclic connectivity 2, 4, 5, and 6 we improve the upper bounds on the oddness ratio of snarks to 7.5, 13, 25, and 99 from the known values 9, 15, 76, and 118, respectivel"},"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":"1212.3641","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-12-14T23:54:55Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"14e0d7e9977d166c506c7d29ba2dbbf9e5c938300ff90106330156268941013c","abstract_canon_sha256":"bce3cf005171a6e40c5764745dce4c40b4c68fb8fa23e80693af2ae7e1bed993"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:22.778208Z","signature_b64":"hjpZu5oQjgVn9BK+gHki6PNjReCHtDAlF+aP1aqgbLfIGBj+oo+Im8O6hYReeq7ImMg5Urtw4rVriviQSc79Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"458f987accdeb1ac028d41028d11c5ab6fd2b5ad6c7edb9cec4ba2fc2a5b6fac","last_reissued_at":"2026-05-18T03:38:22.777817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:22.777817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Small snarks with large oddness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Edita Macajova, Jan Mazak, Martin Skoviera, Robert Lukotka","submitted_at":"2012-12-14T23:54:55Z","abstract_excerpt":"We estimate the minimum number of vertices of a cubic graph with given oddness and cyclic connectivity. We prove that a bridgeless cubic graph $G$ with oddness $\\omega(G)$ other than the Petersen graph has at least $5.41\\cdot\\omega(G)$ vertices, and for each integer $k$ with $2\\le k\\le 6$ we construct an infinite family of cubic graphs with cyclic connectivity $k$ and small oddness ratio $|V(G)|/\\omega(G)$. In particular, for cyclic connectivity 2, 4, 5, and 6 we improve the upper bounds on the oddness ratio of snarks to 7.5, 13, 25, and 99 from the known values 9, 15, 76, and 118, respectivel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3641","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":"1212.3641","created_at":"2026-05-18T03:38:22.777876+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.3641v1","created_at":"2026-05-18T03:38:22.777876+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3641","created_at":"2026-05-18T03:38:22.777876+00:00"},{"alias_kind":"pith_short_12","alias_value":"IWHZQ6WM32Y2","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"IWHZQ6WM32Y2YAUN","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"IWHZQ6WM","created_at":"2026-05-18T12:27:09.501522+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/IWHZQ6WM32Y2YAUNIEBI2EOFVN","json":"https://pith.science/pith/IWHZQ6WM32Y2YAUNIEBI2EOFVN.json","graph_json":"https://pith.science/api/pith-number/IWHZQ6WM32Y2YAUNIEBI2EOFVN/graph.json","events_json":"https://pith.science/api/pith-number/IWHZQ6WM32Y2YAUNIEBI2EOFVN/events.json","paper":"https://pith.science/paper/IWHZQ6WM"},"agent_actions":{"view_html":"https://pith.science/pith/IWHZQ6WM32Y2YAUNIEBI2EOFVN","download_json":"https://pith.science/pith/IWHZQ6WM32Y2YAUNIEBI2EOFVN.json","view_paper":"https://pith.science/paper/IWHZQ6WM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.3641&json=true","fetch_graph":"https://pith.science/api/pith-number/IWHZQ6WM32Y2YAUNIEBI2EOFVN/graph.json","fetch_events":"https://pith.science/api/pith-number/IWHZQ6WM32Y2YAUNIEBI2EOFVN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IWHZQ6WM32Y2YAUNIEBI2EOFVN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IWHZQ6WM32Y2YAUNIEBI2EOFVN/action/storage_attestation","attest_author":"https://pith.science/pith/IWHZQ6WM32Y2YAUNIEBI2EOFVN/action/author_attestation","sign_citation":"https://pith.science/pith/IWHZQ6WM32Y2YAUNIEBI2EOFVN/action/citation_signature","submit_replication":"https://pith.science/pith/IWHZQ6WM32Y2YAUNIEBI2EOFVN/action/replication_record"}},"created_at":"2026-05-18T03:38:22.777876+00:00","updated_at":"2026-05-18T03:38:22.777876+00:00"}