{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6DE6EEWT6ARJOVU6BCF2FOPP3R","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":"8fc11fdb46bfe2dda9e6c10de9c3e42e73f375e943a357054d07edc9aabb7a49","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-04T11:27:50Z","title_canon_sha256":"b23b07fab66ac1db7b5e7373679ed256a1f47ea6f847433290948b88b6866ad8"},"schema_version":"1.0","source":{"id":"1309.0979","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0979","created_at":"2026-05-18T01:18:19Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0979v1","created_at":"2026-05-18T01:18:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0979","created_at":"2026-05-18T01:18:19Z"},{"alias_kind":"pith_short_12","alias_value":"6DE6EEWT6ARJ","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6DE6EEWT6ARJOVU6","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6DE6EEWT","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:63562dd5bc83cd2139c293ac918d2864631d35f1883f76dd73055aaab3517269","target":"graph","created_at":"2026-05-18T01:18:19Z","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":"We give a structural description of the class $\\cal C$ of graphs that do not contain a cycle with a unique chord as an induced subgraph. Our main theorem states that any connected graph in $\\cal C$ is either in some simple basic class or has a decomposition. Basic classes are chordless cycles, cliques, bipartite graphs with one side containing only nodes of degree two and induced subgraphs of the famous Heawood or Petersen graph. Decompositions are node cutsets consisting of one or two nodes and edge cutsets called 1-joins. Our decomposition theorem actually gives a complete structure theorem ","authors_text":"Kristina Vu\\v{s}kovi\\'c, Nicolas Trotignon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-04T11:27:50Z","title":"A structure theorem for graphs with no cycle with a unique chord and its consequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0979","kind":"arxiv","version":1},"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:6c681677d109a9b1167cdc00dee8c15c8fdbc7949c13542df524bfe31e934507","target":"record","created_at":"2026-05-18T01:18:19Z","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":"8fc11fdb46bfe2dda9e6c10de9c3e42e73f375e943a357054d07edc9aabb7a49","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-04T11:27:50Z","title_canon_sha256":"b23b07fab66ac1db7b5e7373679ed256a1f47ea6f847433290948b88b6866ad8"},"schema_version":"1.0","source":{"id":"1309.0979","kind":"arxiv","version":1}},"canonical_sha256":"f0c9e212d3f02297569e088ba2b9efdc61c7e7d22b45939960b593f3abd4da7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0c9e212d3f02297569e088ba2b9efdc61c7e7d22b45939960b593f3abd4da7f","first_computed_at":"2026-05-18T01:18:19.641024Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:19.641024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KaT40KfiE5cQ0vrwjmWgLqRYHz3TviGtAwb7oE9s3YxzTIu1uWSgEKg/lVxuv0MqSxaE5MwMGbWUofmbcApQAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:19.641638Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.0979","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c681677d109a9b1167cdc00dee8c15c8fdbc7949c13542df524bfe31e934507","sha256:63562dd5bc83cd2139c293ac918d2864631d35f1883f76dd73055aaab3517269"],"state_sha256":"a7d1c468e69c56d4d85b4ebb52eeaf46e0cb217f48d3596844d2be6639f93aff"}