{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7BD4GOGU2UBN2JY2AE56TOXEWY","short_pith_number":"pith:7BD4GOGU","schema_version":"1.0","canonical_sha256":"f847c338d4d502dd271a013be9bae4b6090da9b5ee1362dd6fe11f63e59b2056","source":{"kind":"arxiv","id":"2601.18571","version":2},"attestation_state":"computed","paper":{"title":"Well-quasi-ordered classes of bounded clique-width","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.FL","cs.LO"],"primary_cat":"math.CO","authors_text":"Aliaume Lopez, Ma\\\"el Dumas","submitted_at":"2026-01-26T15:14:21Z","abstract_excerpt":"We study classes of graphs with bounded clique-width that are well-quasi-ordered by the induced subgraph relation, in the presence of labels on the vertices. We prove that, given a finite presentation of a class of graphs, one can decide whether the class is labelled-well-quasi-ordered. This solves an open problem raised by Daligault, Rao and Thomass\\'e in 2010, and answers positively to two conjectures of Pouzet in the restricted case of bounded clique-width classes. Namely, we prove that being labelled-well-quasi-ordered by a set of size 2 or by a well-quasi-ordered infinite set are equivale"},"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":"2601.18571","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-01-26T15:14:21Z","cross_cats_sorted":["cs.FL","cs.LO"],"title_canon_sha256":"da77fb51708b2b183960f741badbb1734bb75679ee2737eda4881da62bfa3e98","abstract_canon_sha256":"0fc7cf8ac6e3177ef5fa5672448627c706f39cbe0e8eeaade907084485dd64c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T02:04:45.490447Z","signature_b64":"z4LJbIDn3g8bncF3YVuzinn47szbg8Wa4gbrn6XUQvEvVaZc0rHNkUE9/e+GUY6jPNz5q4BB4WMw6MuyKnUjAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f847c338d4d502dd271a013be9bae4b6090da9b5ee1362dd6fe11f63e59b2056","last_reissued_at":"2026-05-28T02:04:45.489941Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T02:04:45.489941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Well-quasi-ordered classes of bounded clique-width","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.FL","cs.LO"],"primary_cat":"math.CO","authors_text":"Aliaume Lopez, Ma\\\"el Dumas","submitted_at":"2026-01-26T15:14:21Z","abstract_excerpt":"We study classes of graphs with bounded clique-width that are well-quasi-ordered by the induced subgraph relation, in the presence of labels on the vertices. We prove that, given a finite presentation of a class of graphs, one can decide whether the class is labelled-well-quasi-ordered. This solves an open problem raised by Daligault, Rao and Thomass\\'e in 2010, and answers positively to two conjectures of Pouzet in the restricted case of bounded clique-width classes. Namely, we prove that being labelled-well-quasi-ordered by a set of size 2 or by a well-quasi-ordered infinite set are equivale"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.18571","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.18571/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2601.18571","created_at":"2026-05-28T02:04:45.490001+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.18571v2","created_at":"2026-05-28T02:04:45.490001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.18571","created_at":"2026-05-28T02:04:45.490001+00:00"},{"alias_kind":"pith_short_12","alias_value":"7BD4GOGU2UBN","created_at":"2026-05-28T02:04:45.490001+00:00"},{"alias_kind":"pith_short_16","alias_value":"7BD4GOGU2UBN2JY2","created_at":"2026-05-28T02:04:45.490001+00:00"},{"alias_kind":"pith_short_8","alias_value":"7BD4GOGU","created_at":"2026-05-28T02:04:45.490001+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/7BD4GOGU2UBN2JY2AE56TOXEWY","json":"https://pith.science/pith/7BD4GOGU2UBN2JY2AE56TOXEWY.json","graph_json":"https://pith.science/api/pith-number/7BD4GOGU2UBN2JY2AE56TOXEWY/graph.json","events_json":"https://pith.science/api/pith-number/7BD4GOGU2UBN2JY2AE56TOXEWY/events.json","paper":"https://pith.science/paper/7BD4GOGU"},"agent_actions":{"view_html":"https://pith.science/pith/7BD4GOGU2UBN2JY2AE56TOXEWY","download_json":"https://pith.science/pith/7BD4GOGU2UBN2JY2AE56TOXEWY.json","view_paper":"https://pith.science/paper/7BD4GOGU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.18571&json=true","fetch_graph":"https://pith.science/api/pith-number/7BD4GOGU2UBN2JY2AE56TOXEWY/graph.json","fetch_events":"https://pith.science/api/pith-number/7BD4GOGU2UBN2JY2AE56TOXEWY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7BD4GOGU2UBN2JY2AE56TOXEWY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7BD4GOGU2UBN2JY2AE56TOXEWY/action/storage_attestation","attest_author":"https://pith.science/pith/7BD4GOGU2UBN2JY2AE56TOXEWY/action/author_attestation","sign_citation":"https://pith.science/pith/7BD4GOGU2UBN2JY2AE56TOXEWY/action/citation_signature","submit_replication":"https://pith.science/pith/7BD4GOGU2UBN2JY2AE56TOXEWY/action/replication_record"}},"created_at":"2026-05-28T02:04:45.490001+00:00","updated_at":"2026-05-28T02:04:45.490001+00:00"}