{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:EXORYWNHBYXUNCNHQ535OEV7V2","short_pith_number":"pith:EXORYWNH","schema_version":"1.0","canonical_sha256":"25dd1c59a70e2f4689a78777d712bfaeb9448ce657d21cdae8bdfa20df2ec988","source":{"kind":"arxiv","id":"2510.17665","version":2},"attestation_state":"computed","paper":{"title":"Removing bottlenecks in the recognition of small $(k,\\ell)$-graph classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Flavia Bonomo-Braberman, Ignacio Maqueda, Min Chih Lin","submitted_at":"2025-10-20T15:38:33Z","abstract_excerpt":"A graph is a $(k,\\ell)$-graph if its vertex set can be partitioned into $k$ independent sets and $\\ell$ cliques. This family simultaneously generalizes split, bipartite, and co-bipartite graphs. While the recognition problem is NP-complete whenever $k\\geq 3$ or $\\ell\\geq 3$, the remaining small cases are polynomial-time solvable. In this paper we revisit the known recognition algorithms for the first nontrivial polynomial cases, namely $(2,1)$-, $(1,2)$-, and $(2,2)$-graphs, and show how to remove specific bottlenecks in their existing recognition procedures. For $(2,1)$-graphs, we show that t"},"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":"2510.17665","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2025-10-20T15:38:33Z","cross_cats_sorted":[],"title_canon_sha256":"827165841c614f9128a84efd79c87500475d213fd22e849ac08938ad0de5b2d7","abstract_canon_sha256":"ccb45d32a6a3860310ea922abc12a8da9a2c1685278110da0a90de9fcba69f98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T02:03:28.551881Z","signature_b64":"NgeLrP3g7Hz7vkH0HXjKSGnV9X8ItbW8Keb7YUheXmxZENQegQGEWejVIVIZR2CVNsLSQ/pMCbqG0NsjXvqRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25dd1c59a70e2f4689a78777d712bfaeb9448ce657d21cdae8bdfa20df2ec988","last_reissued_at":"2026-06-01T02:03:28.550670Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T02:03:28.550670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Removing bottlenecks in the recognition of small $(k,\\ell)$-graph classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Flavia Bonomo-Braberman, Ignacio Maqueda, Min Chih Lin","submitted_at":"2025-10-20T15:38:33Z","abstract_excerpt":"A graph is a $(k,\\ell)$-graph if its vertex set can be partitioned into $k$ independent sets and $\\ell$ cliques. This family simultaneously generalizes split, bipartite, and co-bipartite graphs. While the recognition problem is NP-complete whenever $k\\geq 3$ or $\\ell\\geq 3$, the remaining small cases are polynomial-time solvable. In this paper we revisit the known recognition algorithms for the first nontrivial polynomial cases, namely $(2,1)$-, $(1,2)$-, and $(2,2)$-graphs, and show how to remove specific bottlenecks in their existing recognition procedures. For $(2,1)$-graphs, we show that t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.17665","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/2510.17665/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":"2510.17665","created_at":"2026-06-01T02:03:28.550843+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.17665v2","created_at":"2026-06-01T02:03:28.550843+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.17665","created_at":"2026-06-01T02:03:28.550843+00:00"},{"alias_kind":"pith_short_12","alias_value":"EXORYWNHBYXU","created_at":"2026-06-01T02:03:28.550843+00:00"},{"alias_kind":"pith_short_16","alias_value":"EXORYWNHBYXUNCNH","created_at":"2026-06-01T02:03:28.550843+00:00"},{"alias_kind":"pith_short_8","alias_value":"EXORYWNH","created_at":"2026-06-01T02:03:28.550843+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/EXORYWNHBYXUNCNHQ535OEV7V2","json":"https://pith.science/pith/EXORYWNHBYXUNCNHQ535OEV7V2.json","graph_json":"https://pith.science/api/pith-number/EXORYWNHBYXUNCNHQ535OEV7V2/graph.json","events_json":"https://pith.science/api/pith-number/EXORYWNHBYXUNCNHQ535OEV7V2/events.json","paper":"https://pith.science/paper/EXORYWNH"},"agent_actions":{"view_html":"https://pith.science/pith/EXORYWNHBYXUNCNHQ535OEV7V2","download_json":"https://pith.science/pith/EXORYWNHBYXUNCNHQ535OEV7V2.json","view_paper":"https://pith.science/paper/EXORYWNH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.17665&json=true","fetch_graph":"https://pith.science/api/pith-number/EXORYWNHBYXUNCNHQ535OEV7V2/graph.json","fetch_events":"https://pith.science/api/pith-number/EXORYWNHBYXUNCNHQ535OEV7V2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EXORYWNHBYXUNCNHQ535OEV7V2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EXORYWNHBYXUNCNHQ535OEV7V2/action/storage_attestation","attest_author":"https://pith.science/pith/EXORYWNHBYXUNCNHQ535OEV7V2/action/author_attestation","sign_citation":"https://pith.science/pith/EXORYWNHBYXUNCNHQ535OEV7V2/action/citation_signature","submit_replication":"https://pith.science/pith/EXORYWNHBYXUNCNHQ535OEV7V2/action/replication_record"}},"created_at":"2026-06-01T02:03:28.550843+00:00","updated_at":"2026-06-01T02:03:28.550843+00:00"}