{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MG3HXU3CVCJENYOYWEYFON4B2T","short_pith_number":"pith:MG3HXU3C","schema_version":"1.0","canonical_sha256":"61b67bd362a89246e1d8b130573781d4e943b865825dbf3752bcd8d899d9b274","source":{"kind":"arxiv","id":"1210.8101","version":2},"attestation_state":"computed","paper":{"title":"Odd 2-factored snarks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"D.Labbate, J.Sheehan, M.Abreu, R.Rizzi","submitted_at":"2012-10-30T18:00:41Z","abstract_excerpt":"A {\\em snark} is a cubic cyclically 4-edge connected graph with edge chromatic number four and girth at least five. We say that a graph $G$ is {\\em odd 2-factored} if for each 2-factor F of G each cycle of F is odd.\n  In this paper, we present a method for constructing odd 2--factored snarks. In particular, we construct two families of odd 2-factored snarks that disprove a conjecture by some of the authors. Moreover, we approach the problem of characterizing odd 2-factored snarks furnishing a partial characterization of cyclically 4-edge connected odd 2-factored snarks. Finally, we pose a new "},"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":"1210.8101","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-30T18:00:41Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9c0f13bb6bc52fc870c9108a2e8bda26320fa39d744a711e02bb69c19bdfb686","abstract_canon_sha256":"af2547eaae39afe699978d95de685b8ec6d2688dcc902764407c70c54ddfcea2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:39.379804Z","signature_b64":"5JM7TWVMA5i9FalaKNi6zVRhCZ2IoxaoEdFS6jUGBNdQ0t0dtEU9I0s7mFZnJ5aYdLh7zYORQhz9+9ppMwmQCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61b67bd362a89246e1d8b130573781d4e943b865825dbf3752bcd8d899d9b274","last_reissued_at":"2026-05-18T02:29:39.379419Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:39.379419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Odd 2-factored snarks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"D.Labbate, J.Sheehan, M.Abreu, R.Rizzi","submitted_at":"2012-10-30T18:00:41Z","abstract_excerpt":"A {\\em snark} is a cubic cyclically 4-edge connected graph with edge chromatic number four and girth at least five. We say that a graph $G$ is {\\em odd 2-factored} if for each 2-factor F of G each cycle of F is odd.\n  In this paper, we present a method for constructing odd 2--factored snarks. In particular, we construct two families of odd 2-factored snarks that disprove a conjecture by some of the authors. Moreover, we approach the problem of characterizing odd 2-factored snarks furnishing a partial characterization of cyclically 4-edge connected odd 2-factored snarks. Finally, we pose a new "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.8101","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":"1210.8101","created_at":"2026-05-18T02:29:39.379476+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.8101v2","created_at":"2026-05-18T02:29:39.379476+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.8101","created_at":"2026-05-18T02:29:39.379476+00:00"},{"alias_kind":"pith_short_12","alias_value":"MG3HXU3CVCJE","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MG3HXU3CVCJENYOY","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MG3HXU3C","created_at":"2026-05-18T12:27:14.488303+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/MG3HXU3CVCJENYOYWEYFON4B2T","json":"https://pith.science/pith/MG3HXU3CVCJENYOYWEYFON4B2T.json","graph_json":"https://pith.science/api/pith-number/MG3HXU3CVCJENYOYWEYFON4B2T/graph.json","events_json":"https://pith.science/api/pith-number/MG3HXU3CVCJENYOYWEYFON4B2T/events.json","paper":"https://pith.science/paper/MG3HXU3C"},"agent_actions":{"view_html":"https://pith.science/pith/MG3HXU3CVCJENYOYWEYFON4B2T","download_json":"https://pith.science/pith/MG3HXU3CVCJENYOYWEYFON4B2T.json","view_paper":"https://pith.science/paper/MG3HXU3C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.8101&json=true","fetch_graph":"https://pith.science/api/pith-number/MG3HXU3CVCJENYOYWEYFON4B2T/graph.json","fetch_events":"https://pith.science/api/pith-number/MG3HXU3CVCJENYOYWEYFON4B2T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MG3HXU3CVCJENYOYWEYFON4B2T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MG3HXU3CVCJENYOYWEYFON4B2T/action/storage_attestation","attest_author":"https://pith.science/pith/MG3HXU3CVCJENYOYWEYFON4B2T/action/author_attestation","sign_citation":"https://pith.science/pith/MG3HXU3CVCJENYOYWEYFON4B2T/action/citation_signature","submit_replication":"https://pith.science/pith/MG3HXU3CVCJENYOYWEYFON4B2T/action/replication_record"}},"created_at":"2026-05-18T02:29:39.379476+00:00","updated_at":"2026-05-18T02:29:39.379476+00:00"}