{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:76CTK7LBRFS67YMBDQFOETBB6H","short_pith_number":"pith:76CTK7LB","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"},"canonical_sha256":"ff85357d618965efe1811c0ae24c21f1e5f89c56e6951fb948b3089b1fa5eebf","source":{"kind":"arxiv","id":"1309.1841","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1841","created_at":"2026-05-18T01:18:19Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1841v1","created_at":"2026-05-18T01:18:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1841","created_at":"2026-05-18T01:18:19Z"},{"alias_kind":"pith_short_12","alias_value":"76CTK7LBRFS6","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"76CTK7LBRFS67YMB","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"76CTK7LB","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:76CTK7LBRFS67YMBDQFOETBB6H","target":"record","payload":{"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"},"canonical_sha256":"ff85357d618965efe1811c0ae24c21f1e5f89c56e6951fb948b3089b1fa5eebf","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"},"source_kind":"arxiv","source_id":"1309.1841","source_version":1,"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-18T01:18:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N8GSL7601vLhm8yopo4WTSCRAuRbi7GtX2Kzmaj6IB/YJtsYy3KfBDB+3VCF+n6hNJkDwbxjkiKY7NAR9VIIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:55:14.661310Z"},"content_sha256":"ea6fe5820ac58e4d3a8c837f8041f903df878dc1f467aa9ef481f5a4f0c0dcb9","schema_version":"1.0","event_id":"sha256:ea6fe5820ac58e4d3a8c837f8041f903df878dc1f467aa9ef481f5a4f0c0dcb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:76CTK7LBRFS67YMBDQFOETBB6H","target":"graph","payload":{"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"},"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-18T01:18:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dbo1SvR3R+VH8G++8EGU1Aidb7+ltUVm0uCOd5gwb5ydXHJBF8nKwiE+2X7ZBoYYswEEY6yfz/hYQ0QtLqxvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:55:14.661693Z"},"content_sha256":"832639888a18b8e44bc3b02db715e674fdb3fc20bbdb20c90aea2f2c1828bfa0","schema_version":"1.0","event_id":"sha256:832639888a18b8e44bc3b02db715e674fdb3fc20bbdb20c90aea2f2c1828bfa0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/76CTK7LBRFS67YMBDQFOETBB6H/bundle.json","state_url":"https://pith.science/pith/76CTK7LBRFS67YMBDQFOETBB6H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/76CTK7LBRFS67YMBDQFOETBB6H/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-05-25T10:55:14Z","links":{"resolver":"https://pith.science/pith/76CTK7LBRFS67YMBDQFOETBB6H","bundle":"https://pith.science/pith/76CTK7LBRFS67YMBDQFOETBB6H/bundle.json","state":"https://pith.science/pith/76CTK7LBRFS67YMBDQFOETBB6H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/76CTK7LBRFS67YMBDQFOETBB6H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:76CTK7LBRFS67YMBDQFOETBB6H","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":"06d290c81cce4aad30bf803dd648f12395f47e987f1cf33770e4712803816f99","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-07T08:32:13Z","title_canon_sha256":"2aa704c329c7ed52b5945446816f0cf541e3ae776ca173bf8cdb1a2f921cd1a0"},"schema_version":"1.0","source":{"id":"1309.1841","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1841","created_at":"2026-05-18T01:18:19Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1841v1","created_at":"2026-05-18T01:18:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1841","created_at":"2026-05-18T01:18:19Z"},{"alias_kind":"pith_short_12","alias_value":"76CTK7LBRFS6","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"76CTK7LBRFS67YMB","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"76CTK7LB","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:832639888a18b8e44bc3b02db715e674fdb3fc20bbdb20c90aea2f2c1828bfa0","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 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.","authors_text":"Kristina Vu\\v{s}kovi\\'c, Marko Radovanovi\\'c, Nicolas Trotignon, Pierre Aboulker","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-07T08:32:13Z","title":"Graphs that do not contain a cycle with a node that has at least two neighbors on it"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1841","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:ea6fe5820ac58e4d3a8c837f8041f903df878dc1f467aa9ef481f5a4f0c0dcb9","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":"06d290c81cce4aad30bf803dd648f12395f47e987f1cf33770e4712803816f99","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-07T08:32:13Z","title_canon_sha256":"2aa704c329c7ed52b5945446816f0cf541e3ae776ca173bf8cdb1a2f921cd1a0"},"schema_version":"1.0","source":{"id":"1309.1841","kind":"arxiv","version":1}},"canonical_sha256":"ff85357d618965efe1811c0ae24c21f1e5f89c56e6951fb948b3089b1fa5eebf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff85357d618965efe1811c0ae24c21f1e5f89c56e6951fb948b3089b1fa5eebf","first_computed_at":"2026-05-18T01:18:19.614792Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:19.614792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J1T9TNr4IfLRbpliRpUsSW28qpAPhXK10ZE0pVwUeiGadupBdwW4qKdTWrTN35ggB+3Ezsky2JsCrsdIMYFlCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:19.615565Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.1841","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea6fe5820ac58e4d3a8c837f8041f903df878dc1f467aa9ef481f5a4f0c0dcb9","sha256:832639888a18b8e44bc3b02db715e674fdb3fc20bbdb20c90aea2f2c1828bfa0"],"state_sha256":"031f724e72d0d7ea269c6524274dd2dfac94f1ad56ecd3fd20399044b2c298f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UI+VT1RThOudMS6wOm9KweRyZ0Kxw0pUTy0YYDCEwVbEW+w9IzTBOWh62Esuq7WpW8Xn5MDHeVu3521o6ClfBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:55:14.665129Z","bundle_sha256":"cde18dc2d82fd085bb1727a3276f4ba0389a396bfb25da95fc92df735780f656"}}