{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:76CTK7LBRFS67YMBDQFOETBB6H","short_pith_number":"pith:76CTK7LB","schema_version":"1.0","canonical_sha256":"ff85357d618965efe1811c0ae24c21f1e5f89c56e6951fb948b3089b1fa5eebf","source":{"kind":"arxiv","id":"1309.1841","version":1},"attestation_state":"computed","paper":{"title":"Graphs that do not contain a cycle with a node that has at least two neighbors on it","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Kristina Vu\\v{s}kovi\\'c, Marko Radovanovi\\'c, Nicolas Trotignon, Pierre Aboulker","submitted_at":"2013-09-07T08:32:13Z","abstract_excerpt":"We recall several known results about minimally 2-connected graphs, and show that they all follow from a decomposition theorem. Starting from an analogy with critically 2-connected graphs, we give structural characterizations of the classes of graphs that do not contain as a subgraph and as an induced subgraph, a cycle with a node that has at least two neighbors on the cycle. From these characterizations we get polynomial time recognition algorithms for these classes, as well as polynomial time algorithms for vertex-coloring and edge-coloring."},"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":"1309.1841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-07T08:32:13Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2aa704c329c7ed52b5945446816f0cf541e3ae776ca173bf8cdb1a2f921cd1a0","abstract_canon_sha256":"06d290c81cce4aad30bf803dd648f12395f47e987f1cf33770e4712803816f99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:19.615565Z","signature_b64":"J1T9TNr4IfLRbpliRpUsSW28qpAPhXK10ZE0pVwUeiGadupBdwW4qKdTWrTN35ggB+3Ezsky2JsCrsdIMYFlCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff85357d618965efe1811c0ae24c21f1e5f89c56e6951fb948b3089b1fa5eebf","last_reissued_at":"2026-05-18T01:18:19.614792Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:19.614792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs that do not contain a cycle with a node that has at least two neighbors on it","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Kristina Vu\\v{s}kovi\\'c, Marko Radovanovi\\'c, Nicolas Trotignon, Pierre Aboulker","submitted_at":"2013-09-07T08:32:13Z","abstract_excerpt":"We recall several known results about minimally 2-connected graphs, and show that they all follow from a decomposition theorem. Starting from an analogy with critically 2-connected graphs, we give structural characterizations of the classes of graphs that do not contain as a subgraph and as an induced subgraph, a cycle with a node that has at least two neighbors on the cycle. From these characterizations we get polynomial time recognition algorithms for these classes, as well as polynomial time algorithms for vertex-coloring and edge-coloring."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1841","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":"1309.1841","created_at":"2026-05-18T01:18:19.614925+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.1841v1","created_at":"2026-05-18T01:18:19.614925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1841","created_at":"2026-05-18T01:18:19.614925+00:00"},{"alias_kind":"pith_short_12","alias_value":"76CTK7LBRFS6","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"76CTK7LBRFS67YMB","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"76CTK7LB","created_at":"2026-05-18T12:27:36.564083+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/76CTK7LBRFS67YMBDQFOETBB6H","json":"https://pith.science/pith/76CTK7LBRFS67YMBDQFOETBB6H.json","graph_json":"https://pith.science/api/pith-number/76CTK7LBRFS67YMBDQFOETBB6H/graph.json","events_json":"https://pith.science/api/pith-number/76CTK7LBRFS67YMBDQFOETBB6H/events.json","paper":"https://pith.science/paper/76CTK7LB"},"agent_actions":{"view_html":"https://pith.science/pith/76CTK7LBRFS67YMBDQFOETBB6H","download_json":"https://pith.science/pith/76CTK7LBRFS67YMBDQFOETBB6H.json","view_paper":"https://pith.science/paper/76CTK7LB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.1841&json=true","fetch_graph":"https://pith.science/api/pith-number/76CTK7LBRFS67YMBDQFOETBB6H/graph.json","fetch_events":"https://pith.science/api/pith-number/76CTK7LBRFS67YMBDQFOETBB6H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/76CTK7LBRFS67YMBDQFOETBB6H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/76CTK7LBRFS67YMBDQFOETBB6H/action/storage_attestation","attest_author":"https://pith.science/pith/76CTK7LBRFS67YMBDQFOETBB6H/action/author_attestation","sign_citation":"https://pith.science/pith/76CTK7LBRFS67YMBDQFOETBB6H/action/citation_signature","submit_replication":"https://pith.science/pith/76CTK7LBRFS67YMBDQFOETBB6H/action/replication_record"}},"created_at":"2026-05-18T01:18:19.614925+00:00","updated_at":"2026-05-18T01:18:19.614925+00:00"}