{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:47CK62P6YL2XBABLRLJFIKO2JD","short_pith_number":"pith:47CK62P6","schema_version":"1.0","canonical_sha256":"e7c4af69fec2f570802b8ad25429da48e33e501ac4c461897eb26544ea09f9c2","source":{"kind":"arxiv","id":"1410.3260","version":2},"attestation_state":"computed","paper":{"title":"Graphs without large bicliques and well-quasi-orderability by the induced subgraph relation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aistis Atminas, Igor Razgon, Vadim V. Lozin","submitted_at":"2014-10-13T11:04:44Z","abstract_excerpt":"Recently, Daligault, Rao and Thomass\\'e asked in [3] if every hereditary class which is well-quasi-ordered by the induced subgraph relation is of bounded clique-width. There are two reasons why this questions is interesting. First, it connects two seemingly unrelated notions. Second, if the question is answered affirmatively, this will have a strong algorithmic consequence. In particular, this will mean (through the use of Courcelle theorem [2]), that any problem definable in Monadic Second Order Logic can be solved in a polynomial time on any class well-quasi-ordered by the induced subgraph r"},"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":"1410.3260","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-13T11:04:44Z","cross_cats_sorted":[],"title_canon_sha256":"d34ebd09fb29b2002c718f07fbacb6990373835f710733fee04da0ded7a4e1c2","abstract_canon_sha256":"3df7b9434766ff244878bd23db20e1a03224d59d0f5b02294c4ce9604f83503a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:50.825238Z","signature_b64":"dNJd+Esn2/f0YzpdNo7LYotuYfbNwiUuoX/3wanQ90oUFSviiCY+iF76A5OLpDhmNFJ9Vvmjd7MZlAgaxn3oCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7c4af69fec2f570802b8ad25429da48e33e501ac4c461897eb26544ea09f9c2","last_reissued_at":"2026-05-18T01:34:50.824810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:50.824810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs without large bicliques and well-quasi-orderability by the induced subgraph relation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aistis Atminas, Igor Razgon, Vadim V. Lozin","submitted_at":"2014-10-13T11:04:44Z","abstract_excerpt":"Recently, Daligault, Rao and Thomass\\'e asked in [3] if every hereditary class which is well-quasi-ordered by the induced subgraph relation is of bounded clique-width. There are two reasons why this questions is interesting. First, it connects two seemingly unrelated notions. Second, if the question is answered affirmatively, this will have a strong algorithmic consequence. In particular, this will mean (through the use of Courcelle theorem [2]), that any problem definable in Monadic Second Order Logic can be solved in a polynomial time on any class well-quasi-ordered by the induced subgraph r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3260","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":""},"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":"1410.3260","created_at":"2026-05-18T01:34:50.824873+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.3260v2","created_at":"2026-05-18T01:34:50.824873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3260","created_at":"2026-05-18T01:34:50.824873+00:00"},{"alias_kind":"pith_short_12","alias_value":"47CK62P6YL2X","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"47CK62P6YL2XBABL","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"47CK62P6","created_at":"2026-05-18T12:28:14.216126+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/47CK62P6YL2XBABLRLJFIKO2JD","json":"https://pith.science/pith/47CK62P6YL2XBABLRLJFIKO2JD.json","graph_json":"https://pith.science/api/pith-number/47CK62P6YL2XBABLRLJFIKO2JD/graph.json","events_json":"https://pith.science/api/pith-number/47CK62P6YL2XBABLRLJFIKO2JD/events.json","paper":"https://pith.science/paper/47CK62P6"},"agent_actions":{"view_html":"https://pith.science/pith/47CK62P6YL2XBABLRLJFIKO2JD","download_json":"https://pith.science/pith/47CK62P6YL2XBABLRLJFIKO2JD.json","view_paper":"https://pith.science/paper/47CK62P6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.3260&json=true","fetch_graph":"https://pith.science/api/pith-number/47CK62P6YL2XBABLRLJFIKO2JD/graph.json","fetch_events":"https://pith.science/api/pith-number/47CK62P6YL2XBABLRLJFIKO2JD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/47CK62P6YL2XBABLRLJFIKO2JD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/47CK62P6YL2XBABLRLJFIKO2JD/action/storage_attestation","attest_author":"https://pith.science/pith/47CK62P6YL2XBABLRLJFIKO2JD/action/author_attestation","sign_citation":"https://pith.science/pith/47CK62P6YL2XBABLRLJFIKO2JD/action/citation_signature","submit_replication":"https://pith.science/pith/47CK62P6YL2XBABLRLJFIKO2JD/action/replication_record"}},"created_at":"2026-05-18T01:34:50.824873+00:00","updated_at":"2026-05-18T01:34:50.824873+00:00"}