{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:EXORYWNHBYXUNCNHQ535OEV7V2","short_pith_number":"pith:EXORYWNH","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"},"canonical_sha256":"25dd1c59a70e2f4689a78777d712bfaeb9448ce657d21cdae8bdfa20df2ec988","source":{"kind":"arxiv","id":"2510.17665","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.17665","created_at":"2026-06-01T02:03:28Z"},{"alias_kind":"arxiv_version","alias_value":"2510.17665v2","created_at":"2026-06-01T02:03:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.17665","created_at":"2026-06-01T02:03:28Z"},{"alias_kind":"pith_short_12","alias_value":"EXORYWNHBYXU","created_at":"2026-06-01T02:03:28Z"},{"alias_kind":"pith_short_16","alias_value":"EXORYWNHBYXUNCNH","created_at":"2026-06-01T02:03:28Z"},{"alias_kind":"pith_short_8","alias_value":"EXORYWNH","created_at":"2026-06-01T02:03:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:EXORYWNHBYXUNCNHQ535OEV7V2","target":"record","payload":{"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"},"canonical_sha256":"25dd1c59a70e2f4689a78777d712bfaeb9448ce657d21cdae8bdfa20df2ec988","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"},"source_kind":"arxiv","source_id":"2510.17665","source_version":2,"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-06-01T02:03:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mKnBprkCKZB0ilZyB0k8/XYR0LAsNrcqzLdTu3PojmnmAj8FKwrEuFEIdo+BZYstNUk307/etyiJ60IN0OQOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:46:31.474249Z"},"content_sha256":"61df0900318ad6c6d501b49e1fe59950ca1f916f24c55b12d9db1e9c3b8fdd68","schema_version":"1.0","event_id":"sha256:61df0900318ad6c6d501b49e1fe59950ca1f916f24c55b12d9db1e9c3b8fdd68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:EXORYWNHBYXUNCNHQ535OEV7V2","target":"graph","payload":{"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"},"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-06-01T02:03:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"axOmr0ih/WuRZD4yrcdUT0GVS5kfRYKbYkr/U8ApfHuyE6DQJhJLXfMY/fd0GrIGYdyi6gZHrd7rTUx8bwVFAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:46:31.474629Z"},"content_sha256":"a5b4fc8214f3d9bfa8a45974def967ae621bf710c831a58d778cbc1626184a2e","schema_version":"1.0","event_id":"sha256:a5b4fc8214f3d9bfa8a45974def967ae621bf710c831a58d778cbc1626184a2e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EXORYWNHBYXUNCNHQ535OEV7V2/bundle.json","state_url":"https://pith.science/pith/EXORYWNHBYXUNCNHQ535OEV7V2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EXORYWNHBYXUNCNHQ535OEV7V2/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-06-27T03:46:31Z","links":{"resolver":"https://pith.science/pith/EXORYWNHBYXUNCNHQ535OEV7V2","bundle":"https://pith.science/pith/EXORYWNHBYXUNCNHQ535OEV7V2/bundle.json","state":"https://pith.science/pith/EXORYWNHBYXUNCNHQ535OEV7V2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EXORYWNHBYXUNCNHQ535OEV7V2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:EXORYWNHBYXUNCNHQ535OEV7V2","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":"ccb45d32a6a3860310ea922abc12a8da9a2c1685278110da0a90de9fcba69f98","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2025-10-20T15:38:33Z","title_canon_sha256":"827165841c614f9128a84efd79c87500475d213fd22e849ac08938ad0de5b2d7"},"schema_version":"1.0","source":{"id":"2510.17665","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.17665","created_at":"2026-06-01T02:03:28Z"},{"alias_kind":"arxiv_version","alias_value":"2510.17665v2","created_at":"2026-06-01T02:03:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.17665","created_at":"2026-06-01T02:03:28Z"},{"alias_kind":"pith_short_12","alias_value":"EXORYWNHBYXU","created_at":"2026-06-01T02:03:28Z"},{"alias_kind":"pith_short_16","alias_value":"EXORYWNHBYXUNCNH","created_at":"2026-06-01T02:03:28Z"},{"alias_kind":"pith_short_8","alias_value":"EXORYWNH","created_at":"2026-06-01T02:03:28Z"}],"graph_snapshots":[{"event_id":"sha256:a5b4fc8214f3d9bfa8a45974def967ae621bf710c831a58d778cbc1626184a2e","target":"graph","created_at":"2026-06-01T02:03:28Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2510.17665/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Flavia Bonomo-Braberman, Ignacio Maqueda, Min Chih Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2025-10-20T15:38:33Z","title":"Removing bottlenecks in the recognition of small $(k,\\ell)$-graph classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.17665","kind":"arxiv","version":2},"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:61df0900318ad6c6d501b49e1fe59950ca1f916f24c55b12d9db1e9c3b8fdd68","target":"record","created_at":"2026-06-01T02:03:28Z","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":"ccb45d32a6a3860310ea922abc12a8da9a2c1685278110da0a90de9fcba69f98","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2025-10-20T15:38:33Z","title_canon_sha256":"827165841c614f9128a84efd79c87500475d213fd22e849ac08938ad0de5b2d7"},"schema_version":"1.0","source":{"id":"2510.17665","kind":"arxiv","version":2}},"canonical_sha256":"25dd1c59a70e2f4689a78777d712bfaeb9448ce657d21cdae8bdfa20df2ec988","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25dd1c59a70e2f4689a78777d712bfaeb9448ce657d21cdae8bdfa20df2ec988","first_computed_at":"2026-06-01T02:03:28.550670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-01T02:03:28.550670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NgeLrP3g7Hz7vkH0HXjKSGnV9X8ItbW8Keb7YUheXmxZENQegQGEWejVIVIZR2CVNsLSQ/pMCbqG0NsjXvqRAg==","signature_status":"signed_v1","signed_at":"2026-06-01T02:03:28.551881Z","signed_message":"canonical_sha256_bytes"},"source_id":"2510.17665","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61df0900318ad6c6d501b49e1fe59950ca1f916f24c55b12d9db1e9c3b8fdd68","sha256:a5b4fc8214f3d9bfa8a45974def967ae621bf710c831a58d778cbc1626184a2e"],"state_sha256":"a025fcf93a1113478ebbc9ef56a167d130a3a79da02609b474fb6bd7a544964e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NWJWQzv+tt/fb3a6WTL6bBlL7LgI/c3r47LDjWjVuTsVSSkfcbdJN0OxHdQair9JkaZ3vkBLtCpvu26YETojCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T03:46:31.476686Z","bundle_sha256":"3fd23ca5d3c9602f06b72bf54e2e666104d2ff21e29789f393b007f795e3ae35"}}