{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GYBE6MBDEIF2A5YTKBGM7UAMPJ","short_pith_number":"pith:GYBE6MBD","schema_version":"1.0","canonical_sha256":"36024f3023220ba07713504ccfd00c7a51efdcf3da1438ce0aa293e0b07eb806","source":{"kind":"arxiv","id":"2508.13424","version":2},"attestation_state":"computed","paper":{"title":"Maya-Tupi graphs: a generalization of split graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C\\'esar Hern\\'andez-Cruz, Cl\\'audia Linhares Sales, J\\'ulio Ara\\'ujo","submitted_at":"2025-08-19T00:54:03Z","abstract_excerpt":"We define the family of Maya-Tupi graphs as those graphs that admit a partition $(A,B)$ of their vertex sets such that $A$ induces a complete multipartite graph where each part has size at most two, and $B$ induces a graph where every connected component is $K_1$ or $K_2$. The family of Maya-Tupi graphs is self complementary, generalizes split graphs, falls into the sparse-dense partitioning schema and is characterized by finitely many forbidden induced subgraphs. Unfortunately, our computational experiments show that the number of minimal forbidden induced subgraphs to characterize Maya-Tupi "},"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":"2508.13424","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-19T00:54:03Z","cross_cats_sorted":[],"title_canon_sha256":"998a078d4edaa35f23b0f3092b23b74dc07eb6cdf512e8e0da172ade075d36f7","abstract_canon_sha256":"1eabce2c6a3dd314bb36fb1aad4296fd8794eb2d7a8feb086383b0c6eea42eb8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:04:50.087828Z","signature_b64":"Qxi9g23ClsZfrFXEf20EweTd2Vw9cTammH1CYYDegSJaI7PKK4FX2w1N3rEBbPMc42XARowZ2aE+GSqGxTUIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36024f3023220ba07713504ccfd00c7a51efdcf3da1438ce0aa293e0b07eb806","last_reissued_at":"2026-05-27T01:04:50.087150Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:04:50.087150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maya-Tupi graphs: a generalization of split graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C\\'esar Hern\\'andez-Cruz, Cl\\'audia Linhares Sales, J\\'ulio Ara\\'ujo","submitted_at":"2025-08-19T00:54:03Z","abstract_excerpt":"We define the family of Maya-Tupi graphs as those graphs that admit a partition $(A,B)$ of their vertex sets such that $A$ induces a complete multipartite graph where each part has size at most two, and $B$ induces a graph where every connected component is $K_1$ or $K_2$. The family of Maya-Tupi graphs is self complementary, generalizes split graphs, falls into the sparse-dense partitioning schema and is characterized by finitely many forbidden induced subgraphs. Unfortunately, our computational experiments show that the number of minimal forbidden induced subgraphs to characterize Maya-Tupi "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.13424","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/2508.13424/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":"2508.13424","created_at":"2026-05-27T01:04:50.087231+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.13424v2","created_at":"2026-05-27T01:04:50.087231+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.13424","created_at":"2026-05-27T01:04:50.087231+00:00"},{"alias_kind":"pith_short_12","alias_value":"GYBE6MBDEIF2","created_at":"2026-05-27T01:04:50.087231+00:00"},{"alias_kind":"pith_short_16","alias_value":"GYBE6MBDEIF2A5YT","created_at":"2026-05-27T01:04:50.087231+00:00"},{"alias_kind":"pith_short_8","alias_value":"GYBE6MBD","created_at":"2026-05-27T01:04:50.087231+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/GYBE6MBDEIF2A5YTKBGM7UAMPJ","json":"https://pith.science/pith/GYBE6MBDEIF2A5YTKBGM7UAMPJ.json","graph_json":"https://pith.science/api/pith-number/GYBE6MBDEIF2A5YTKBGM7UAMPJ/graph.json","events_json":"https://pith.science/api/pith-number/GYBE6MBDEIF2A5YTKBGM7UAMPJ/events.json","paper":"https://pith.science/paper/GYBE6MBD"},"agent_actions":{"view_html":"https://pith.science/pith/GYBE6MBDEIF2A5YTKBGM7UAMPJ","download_json":"https://pith.science/pith/GYBE6MBDEIF2A5YTKBGM7UAMPJ.json","view_paper":"https://pith.science/paper/GYBE6MBD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.13424&json=true","fetch_graph":"https://pith.science/api/pith-number/GYBE6MBDEIF2A5YTKBGM7UAMPJ/graph.json","fetch_events":"https://pith.science/api/pith-number/GYBE6MBDEIF2A5YTKBGM7UAMPJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GYBE6MBDEIF2A5YTKBGM7UAMPJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GYBE6MBDEIF2A5YTKBGM7UAMPJ/action/storage_attestation","attest_author":"https://pith.science/pith/GYBE6MBDEIF2A5YTKBGM7UAMPJ/action/author_attestation","sign_citation":"https://pith.science/pith/GYBE6MBDEIF2A5YTKBGM7UAMPJ/action/citation_signature","submit_replication":"https://pith.science/pith/GYBE6MBDEIF2A5YTKBGM7UAMPJ/action/replication_record"}},"created_at":"2026-05-27T01:04:50.087231+00:00","updated_at":"2026-05-27T01:04:50.087231+00:00"}