{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KPSWJPMSGS2U7VSIEP45POJ5B2","short_pith_number":"pith:KPSWJPMS","schema_version":"1.0","canonical_sha256":"53e564bd9234b54fd64823f9d7b93d0ebe3239d7b35096f72104d9dfeb3ef192","source":{"kind":"arxiv","id":"1211.1714","version":2},"attestation_state":"computed","paper":{"title":"Even Subdivision-Factors of Cubic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arthur Hoffmann-Ostenhof","submitted_at":"2012-11-07T22:34:05Z","abstract_excerpt":"We call a set $\\mathcal S$ of graphs an \"even subdivison-factor\" of a cubic graph $G$ if $G$ contains a spanning subgraph $H$ such that every component of $H$ has an even number of vertices and is a subdivision of an element of $\\mathcal S$. We show that any set of 2-connected graphs which is an even subdivison-factor of every 3-connected cubic graph, satisfies certain properties. As a consequence, we disprove a conjecture which was stated in an attempt to solve the circuit double cover conjecture."},"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":"1211.1714","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-07T22:34:05Z","cross_cats_sorted":[],"title_canon_sha256":"6013fabd63bb477f5e4b6c67aee46d80e04d95f3d01225abb98b6f733760c769","abstract_canon_sha256":"88a6b3017b58fe82f0b8e5b01a747e4d2e3bef186c81bb9264b6ec489005a1ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:12.049027Z","signature_b64":"P/ShSg9b0UZL0lSHRz68JrqRAXJGXchA6pMkhF+TxscpxOjdeej1V2sg3Siglo+C75vJi6FCRHsMi1hyNApqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53e564bd9234b54fd64823f9d7b93d0ebe3239d7b35096f72104d9dfeb3ef192","last_reissued_at":"2026-05-18T03:41:12.048563Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:12.048563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Even Subdivision-Factors of Cubic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arthur Hoffmann-Ostenhof","submitted_at":"2012-11-07T22:34:05Z","abstract_excerpt":"We call a set $\\mathcal S$ of graphs an \"even subdivison-factor\" of a cubic graph $G$ if $G$ contains a spanning subgraph $H$ such that every component of $H$ has an even number of vertices and is a subdivision of an element of $\\mathcal S$. We show that any set of 2-connected graphs which is an even subdivison-factor of every 3-connected cubic graph, satisfies certain properties. As a consequence, we disprove a conjecture which was stated in an attempt to solve the circuit double cover conjecture."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1714","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":"1211.1714","created_at":"2026-05-18T03:41:12.048639+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.1714v2","created_at":"2026-05-18T03:41:12.048639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1714","created_at":"2026-05-18T03:41:12.048639+00:00"},{"alias_kind":"pith_short_12","alias_value":"KPSWJPMSGS2U","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KPSWJPMSGS2U7VSI","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KPSWJPMS","created_at":"2026-05-18T12:27:11.947152+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/KPSWJPMSGS2U7VSIEP45POJ5B2","json":"https://pith.science/pith/KPSWJPMSGS2U7VSIEP45POJ5B2.json","graph_json":"https://pith.science/api/pith-number/KPSWJPMSGS2U7VSIEP45POJ5B2/graph.json","events_json":"https://pith.science/api/pith-number/KPSWJPMSGS2U7VSIEP45POJ5B2/events.json","paper":"https://pith.science/paper/KPSWJPMS"},"agent_actions":{"view_html":"https://pith.science/pith/KPSWJPMSGS2U7VSIEP45POJ5B2","download_json":"https://pith.science/pith/KPSWJPMSGS2U7VSIEP45POJ5B2.json","view_paper":"https://pith.science/paper/KPSWJPMS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.1714&json=true","fetch_graph":"https://pith.science/api/pith-number/KPSWJPMSGS2U7VSIEP45POJ5B2/graph.json","fetch_events":"https://pith.science/api/pith-number/KPSWJPMSGS2U7VSIEP45POJ5B2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KPSWJPMSGS2U7VSIEP45POJ5B2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KPSWJPMSGS2U7VSIEP45POJ5B2/action/storage_attestation","attest_author":"https://pith.science/pith/KPSWJPMSGS2U7VSIEP45POJ5B2/action/author_attestation","sign_citation":"https://pith.science/pith/KPSWJPMSGS2U7VSIEP45POJ5B2/action/citation_signature","submit_replication":"https://pith.science/pith/KPSWJPMSGS2U7VSIEP45POJ5B2/action/replication_record"}},"created_at":"2026-05-18T03:41:12.048639+00:00","updated_at":"2026-05-18T03:41:12.048639+00:00"}