{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MG3HXU3CVCJENYOYWEYFON4B2T","short_pith_number":"pith:MG3HXU3C","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"},"canonical_sha256":"61b67bd362a89246e1d8b130573781d4e943b865825dbf3752bcd8d899d9b274","source":{"kind":"arxiv","id":"1210.8101","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.8101","created_at":"2026-05-18T02:29:39Z"},{"alias_kind":"arxiv_version","alias_value":"1210.8101v2","created_at":"2026-05-18T02:29:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.8101","created_at":"2026-05-18T02:29:39Z"},{"alias_kind":"pith_short_12","alias_value":"MG3HXU3CVCJE","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MG3HXU3CVCJENYOY","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MG3HXU3C","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MG3HXU3CVCJENYOYWEYFON4B2T","target":"record","payload":{"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"},"canonical_sha256":"61b67bd362a89246e1d8b130573781d4e943b865825dbf3752bcd8d899d9b274","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"},"source_kind":"arxiv","source_id":"1210.8101","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-18T02:29:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"utzYnlrJV7+DSUQEti+05lPpdq17QBTFqGk619nW1P1TNttLxmDdseba3pNymW0nVEBPJgk77uro9W8LhzL8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:47:07.063604Z"},"content_sha256":"cefcec190bd4830194c309d4b18739ff1c600023802f6aefe52ae319e53070fb","schema_version":"1.0","event_id":"sha256:cefcec190bd4830194c309d4b18739ff1c600023802f6aefe52ae319e53070fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MG3HXU3CVCJENYOYWEYFON4B2T","target":"graph","payload":{"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"},"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-18T02:29:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"btNdlztYR/Jg5HwN3UpFkXZJ43gbjJkkbIv1RahPFIogluytEu3pJskKz1LEdOKGJ0H+izLdXqI6y9arFEZkBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:47:07.063951Z"},"content_sha256":"39deb6ac97c7f5cc2b82e552eb6747a72a3c078006d049dfca5ddb9486ee01bc","schema_version":"1.0","event_id":"sha256:39deb6ac97c7f5cc2b82e552eb6747a72a3c078006d049dfca5ddb9486ee01bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MG3HXU3CVCJENYOYWEYFON4B2T/bundle.json","state_url":"https://pith.science/pith/MG3HXU3CVCJENYOYWEYFON4B2T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MG3HXU3CVCJENYOYWEYFON4B2T/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-06-24T07:47:07Z","links":{"resolver":"https://pith.science/pith/MG3HXU3CVCJENYOYWEYFON4B2T","bundle":"https://pith.science/pith/MG3HXU3CVCJENYOYWEYFON4B2T/bundle.json","state":"https://pith.science/pith/MG3HXU3CVCJENYOYWEYFON4B2T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MG3HXU3CVCJENYOYWEYFON4B2T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MG3HXU3CVCJENYOYWEYFON4B2T","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":"af2547eaae39afe699978d95de685b8ec6d2688dcc902764407c70c54ddfcea2","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-30T18:00:41Z","title_canon_sha256":"9c0f13bb6bc52fc870c9108a2e8bda26320fa39d744a711e02bb69c19bdfb686"},"schema_version":"1.0","source":{"id":"1210.8101","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.8101","created_at":"2026-05-18T02:29:39Z"},{"alias_kind":"arxiv_version","alias_value":"1210.8101v2","created_at":"2026-05-18T02:29:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.8101","created_at":"2026-05-18T02:29:39Z"},{"alias_kind":"pith_short_12","alias_value":"MG3HXU3CVCJE","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MG3HXU3CVCJENYOY","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MG3HXU3C","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:39deb6ac97c7f5cc2b82e552eb6747a72a3c078006d049dfca5ddb9486ee01bc","target":"graph","created_at":"2026-05-18T02:29:39Z","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 {\\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 ","authors_text":"D.Labbate, J.Sheehan, M.Abreu, R.Rizzi","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-30T18:00:41Z","title":"Odd 2-factored snarks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.8101","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:cefcec190bd4830194c309d4b18739ff1c600023802f6aefe52ae319e53070fb","target":"record","created_at":"2026-05-18T02:29:39Z","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":"af2547eaae39afe699978d95de685b8ec6d2688dcc902764407c70c54ddfcea2","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-30T18:00:41Z","title_canon_sha256":"9c0f13bb6bc52fc870c9108a2e8bda26320fa39d744a711e02bb69c19bdfb686"},"schema_version":"1.0","source":{"id":"1210.8101","kind":"arxiv","version":2}},"canonical_sha256":"61b67bd362a89246e1d8b130573781d4e943b865825dbf3752bcd8d899d9b274","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61b67bd362a89246e1d8b130573781d4e943b865825dbf3752bcd8d899d9b274","first_computed_at":"2026-05-18T02:29:39.379419Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:39.379419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5JM7TWVMA5i9FalaKNi6zVRhCZ2IoxaoEdFS6jUGBNdQ0t0dtEU9I0s7mFZnJ5aYdLh7zYORQhz9+9ppMwmQCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:39.379804Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.8101","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cefcec190bd4830194c309d4b18739ff1c600023802f6aefe52ae319e53070fb","sha256:39deb6ac97c7f5cc2b82e552eb6747a72a3c078006d049dfca5ddb9486ee01bc"],"state_sha256":"ad9f31acfb53acfb27eb60788438ac21e512ff15dd8d69293e624765e440049c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LjDyHKTOuQxNwL3UElvAZ3USeX8gZ+BcPikIkbgkMkhAo3nHiHJXXhPmCsvusBSVOynz2SU/mjVHCvfu1KpVCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T07:47:07.065927Z","bundle_sha256":"f06463f9e9eb6e6aed99a56175c88a2ff6b9d365578f9bb855555f782662140f"}}