{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BI74UE4ZFRYQQCQDCEDPMTB6LF","short_pith_number":"pith:BI74UE4Z","schema_version":"1.0","canonical_sha256":"0a3fca13992c71080a031106f64c3e59740c91605b718c1f2fd3c7710197d7e3","source":{"kind":"arxiv","id":"1608.01465","version":1},"attestation_state":"computed","paper":{"title":"Enumerations, Forbidden Subgraph Characterizations, and the Split-Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"J\\'er\\'emie Lumbroso, Maryam Bahrani","submitted_at":"2016-08-04T08:49:03Z","abstract_excerpt":"Forbidden characterizations may sometimes be the most natural way to describe families of graphs, and yet these characterizations are usually very hard to exploit for enumerative purposes.\n  By building on the work of Gioan and Paul (2012) and Chauve et al. (2014), we show a methodology by which we constrain a split-decomposition tree to avoid certain patterns, thereby avoiding the corresponding induced subgraphs in the original graph.\n  We thus provide the grammars and full enumeration for a wide set of graph classes: ptolemaic, block, and variants of cactus graphs (2,3-cacti, 3-cacti and 4-c"},"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":"1608.01465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-04T08:49:03Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8dcd2a16ed7a5572952cba19cded7c983be3d3518caa76b5e835dfba24e48f91","abstract_canon_sha256":"5c0399b577b5f74f5dbff59657667f91b43f9bc64ae97cd6141c0ec9a619f595"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:52.368880Z","signature_b64":"xV4yqitJghs5jPDPJws8peeZGX9TjyZ0uDhTRsAg4QSzuyQinWprRL4patYhLm0Qpzfc40J2woO0Z/y1GhL2Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a3fca13992c71080a031106f64c3e59740c91605b718c1f2fd3c7710197d7e3","last_reissued_at":"2026-05-18T01:09:52.368241Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:52.368241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumerations, Forbidden Subgraph Characterizations, and the Split-Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"J\\'er\\'emie Lumbroso, Maryam Bahrani","submitted_at":"2016-08-04T08:49:03Z","abstract_excerpt":"Forbidden characterizations may sometimes be the most natural way to describe families of graphs, and yet these characterizations are usually very hard to exploit for enumerative purposes.\n  By building on the work of Gioan and Paul (2012) and Chauve et al. (2014), we show a methodology by which we constrain a split-decomposition tree to avoid certain patterns, thereby avoiding the corresponding induced subgraphs in the original graph.\n  We thus provide the grammars and full enumeration for a wide set of graph classes: ptolemaic, block, and variants of cactus graphs (2,3-cacti, 3-cacti and 4-c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01465","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":"1608.01465","created_at":"2026-05-18T01:09:52.368341+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.01465v1","created_at":"2026-05-18T01:09:52.368341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01465","created_at":"2026-05-18T01:09:52.368341+00:00"},{"alias_kind":"pith_short_12","alias_value":"BI74UE4ZFRYQ","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"BI74UE4ZFRYQQCQD","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"BI74UE4Z","created_at":"2026-05-18T12:30:07.202191+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/BI74UE4ZFRYQQCQDCEDPMTB6LF","json":"https://pith.science/pith/BI74UE4ZFRYQQCQDCEDPMTB6LF.json","graph_json":"https://pith.science/api/pith-number/BI74UE4ZFRYQQCQDCEDPMTB6LF/graph.json","events_json":"https://pith.science/api/pith-number/BI74UE4ZFRYQQCQDCEDPMTB6LF/events.json","paper":"https://pith.science/paper/BI74UE4Z"},"agent_actions":{"view_html":"https://pith.science/pith/BI74UE4ZFRYQQCQDCEDPMTB6LF","download_json":"https://pith.science/pith/BI74UE4ZFRYQQCQDCEDPMTB6LF.json","view_paper":"https://pith.science/paper/BI74UE4Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.01465&json=true","fetch_graph":"https://pith.science/api/pith-number/BI74UE4ZFRYQQCQDCEDPMTB6LF/graph.json","fetch_events":"https://pith.science/api/pith-number/BI74UE4ZFRYQQCQDCEDPMTB6LF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BI74UE4ZFRYQQCQDCEDPMTB6LF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BI74UE4ZFRYQQCQDCEDPMTB6LF/action/storage_attestation","attest_author":"https://pith.science/pith/BI74UE4ZFRYQQCQDCEDPMTB6LF/action/author_attestation","sign_citation":"https://pith.science/pith/BI74UE4ZFRYQQCQDCEDPMTB6LF/action/citation_signature","submit_replication":"https://pith.science/pith/BI74UE4ZFRYQQCQDCEDPMTB6LF/action/replication_record"}},"created_at":"2026-05-18T01:09:52.368341+00:00","updated_at":"2026-05-18T01:09:52.368341+00:00"}