{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SA5UMADIBSV5JQYSEXDMNHK45B","short_pith_number":"pith:SA5UMADI","schema_version":"1.0","canonical_sha256":"903b4600680cabd4c31225c6c69d5ce861270e1d5ddfb8a952bba80882509dd3","source":{"kind":"arxiv","id":"1703.03500","version":1},"attestation_state":"computed","paper":{"title":"Minimal obstructions to $2$-polar cographs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C\\'esar Hern\\'andez-Cruz, Cl\\'audia Linhares Sales, Pavol Hell","submitted_at":"2017-03-10T01:06:08Z","abstract_excerpt":"A graph is a cograph if it is $P_4$-free. A $k$-polar partition of a graph $G$ is a partition of the set of vertices of $G$ into parts $A$ and $B$ such that the subgraph induced by $A$ is a complete multipartite graph with at most $k$ parts, and the subgraph induced by $B$ is a disjoint union of at most $k$ cliques with no other edges.\n  It is known that $k$-polar cographs can be characterized by a finite family of forbidden induced subgraphs, for any fixed $k$. A concrete family of such forbidden induced subgraphs is known for $k=1$, since $1$-polar graphs are precisely split graphs. For larg"},"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":"1703.03500","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-10T01:06:08Z","cross_cats_sorted":[],"title_canon_sha256":"a6b439555af9449c48d674b58cd917533662e2efd1af843a81a31a7f79bc87c0","abstract_canon_sha256":"412c990790c9d4ad368862b04bfdabb8a38c3a6fd6c37ccb5814c8640e73c041"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:58.942743Z","signature_b64":"9xxgzKbrOiIeFBknyRwVv5cnur3l/93EEocjUBf9oFtfeJ/+VrCk+uIDKRIEfnUyAXpTFfmBXV0OA+rk2lCMBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"903b4600680cabd4c31225c6c69d5ce861270e1d5ddfb8a952bba80882509dd3","last_reissued_at":"2026-05-18T00:48:58.942073Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:58.942073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimal obstructions to $2$-polar cographs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C\\'esar Hern\\'andez-Cruz, Cl\\'audia Linhares Sales, Pavol Hell","submitted_at":"2017-03-10T01:06:08Z","abstract_excerpt":"A graph is a cograph if it is $P_4$-free. A $k$-polar partition of a graph $G$ is a partition of the set of vertices of $G$ into parts $A$ and $B$ such that the subgraph induced by $A$ is a complete multipartite graph with at most $k$ parts, and the subgraph induced by $B$ is a disjoint union of at most $k$ cliques with no other edges.\n  It is known that $k$-polar cographs can be characterized by a finite family of forbidden induced subgraphs, for any fixed $k$. A concrete family of such forbidden induced subgraphs is known for $k=1$, since $1$-polar graphs are precisely split graphs. For larg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03500","kind":"arxiv","version":1},"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":"1703.03500","created_at":"2026-05-18T00:48:58.942166+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.03500v1","created_at":"2026-05-18T00:48:58.942166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03500","created_at":"2026-05-18T00:48:58.942166+00:00"},{"alias_kind":"pith_short_12","alias_value":"SA5UMADIBSV5","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SA5UMADIBSV5JQYS","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SA5UMADI","created_at":"2026-05-18T12:31:43.269735+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/SA5UMADIBSV5JQYSEXDMNHK45B","json":"https://pith.science/pith/SA5UMADIBSV5JQYSEXDMNHK45B.json","graph_json":"https://pith.science/api/pith-number/SA5UMADIBSV5JQYSEXDMNHK45B/graph.json","events_json":"https://pith.science/api/pith-number/SA5UMADIBSV5JQYSEXDMNHK45B/events.json","paper":"https://pith.science/paper/SA5UMADI"},"agent_actions":{"view_html":"https://pith.science/pith/SA5UMADIBSV5JQYSEXDMNHK45B","download_json":"https://pith.science/pith/SA5UMADIBSV5JQYSEXDMNHK45B.json","view_paper":"https://pith.science/paper/SA5UMADI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.03500&json=true","fetch_graph":"https://pith.science/api/pith-number/SA5UMADIBSV5JQYSEXDMNHK45B/graph.json","fetch_events":"https://pith.science/api/pith-number/SA5UMADIBSV5JQYSEXDMNHK45B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SA5UMADIBSV5JQYSEXDMNHK45B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SA5UMADIBSV5JQYSEXDMNHK45B/action/storage_attestation","attest_author":"https://pith.science/pith/SA5UMADIBSV5JQYSEXDMNHK45B/action/author_attestation","sign_citation":"https://pith.science/pith/SA5UMADIBSV5JQYSEXDMNHK45B/action/citation_signature","submit_replication":"https://pith.science/pith/SA5UMADIBSV5JQYSEXDMNHK45B/action/replication_record"}},"created_at":"2026-05-18T00:48:58.942166+00:00","updated_at":"2026-05-18T00:48:58.942166+00:00"}