{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QECGL7JYO4L3N3SFQGZUBDHWPV","short_pith_number":"pith:QECGL7JY","schema_version":"1.0","canonical_sha256":"810465fd387717b6ee4581b3408cf67d7775379cac330e4fd7672fb143deb138","source":{"kind":"arxiv","id":"1504.01143","version":1},"attestation_state":"computed","paper":{"title":"Splitting cubic circle graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lorenzo Traldi","submitted_at":"2015-04-05T17:42:56Z","abstract_excerpt":"We show that every 3-regular circle graph has at least two pairs of twin vertices; consequently no such graph is prime with respect to the split decomposition. We also deduce that up to isomorphism, K_4 and K_{3,3} are the only 3-connected, 3-regular circle graphs."},"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":"1504.01143","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-05T17:42:56Z","cross_cats_sorted":[],"title_canon_sha256":"3fb8a79ce3c6c09c50a833aff5fe4b68bbab698879820648f025cd3b23459550","abstract_canon_sha256":"9fb44b49a0f9b373073a7cf99db5ff6d70fa384777855e779315757735e2026c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:13.572756Z","signature_b64":"uSDtBMncWiRaddZkk+mcaZKBY4HWwqACIlZljOU33WbwQFJPUM1uLGgt3G8tX7dIt1sE/945zLz4HYCt0PWzDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"810465fd387717b6ee4581b3408cf67d7775379cac330e4fd7672fb143deb138","last_reissued_at":"2026-05-18T01:11:13.572306Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:13.572306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Splitting cubic circle graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lorenzo Traldi","submitted_at":"2015-04-05T17:42:56Z","abstract_excerpt":"We show that every 3-regular circle graph has at least two pairs of twin vertices; consequently no such graph is prime with respect to the split decomposition. We also deduce that up to isomorphism, K_4 and K_{3,3} are the only 3-connected, 3-regular circle graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01143","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":"1504.01143","created_at":"2026-05-18T01:11:13.572375+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.01143v1","created_at":"2026-05-18T01:11:13.572375+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01143","created_at":"2026-05-18T01:11:13.572375+00:00"},{"alias_kind":"pith_short_12","alias_value":"QECGL7JYO4L3","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QECGL7JYO4L3N3SF","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QECGL7JY","created_at":"2026-05-18T12:29:37.295048+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/QECGL7JYO4L3N3SFQGZUBDHWPV","json":"https://pith.science/pith/QECGL7JYO4L3N3SFQGZUBDHWPV.json","graph_json":"https://pith.science/api/pith-number/QECGL7JYO4L3N3SFQGZUBDHWPV/graph.json","events_json":"https://pith.science/api/pith-number/QECGL7JYO4L3N3SFQGZUBDHWPV/events.json","paper":"https://pith.science/paper/QECGL7JY"},"agent_actions":{"view_html":"https://pith.science/pith/QECGL7JYO4L3N3SFQGZUBDHWPV","download_json":"https://pith.science/pith/QECGL7JYO4L3N3SFQGZUBDHWPV.json","view_paper":"https://pith.science/paper/QECGL7JY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.01143&json=true","fetch_graph":"https://pith.science/api/pith-number/QECGL7JYO4L3N3SFQGZUBDHWPV/graph.json","fetch_events":"https://pith.science/api/pith-number/QECGL7JYO4L3N3SFQGZUBDHWPV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QECGL7JYO4L3N3SFQGZUBDHWPV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QECGL7JYO4L3N3SFQGZUBDHWPV/action/storage_attestation","attest_author":"https://pith.science/pith/QECGL7JYO4L3N3SFQGZUBDHWPV/action/author_attestation","sign_citation":"https://pith.science/pith/QECGL7JYO4L3N3SFQGZUBDHWPV/action/citation_signature","submit_replication":"https://pith.science/pith/QECGL7JYO4L3N3SFQGZUBDHWPV/action/replication_record"}},"created_at":"2026-05-18T01:11:13.572375+00:00","updated_at":"2026-05-18T01:11:13.572375+00:00"}