{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SA5UMADIBSV5JQYSEXDMNHK45B","short_pith_number":"pith:SA5UMADI","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"},"canonical_sha256":"903b4600680cabd4c31225c6c69d5ce861270e1d5ddfb8a952bba80882509dd3","source":{"kind":"arxiv","id":"1703.03500","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.03500","created_at":"2026-05-18T00:48:58Z"},{"alias_kind":"arxiv_version","alias_value":"1703.03500v1","created_at":"2026-05-18T00:48:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03500","created_at":"2026-05-18T00:48:58Z"},{"alias_kind":"pith_short_12","alias_value":"SA5UMADIBSV5","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SA5UMADIBSV5JQYS","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SA5UMADI","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SA5UMADIBSV5JQYSEXDMNHK45B","target":"record","payload":{"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"},"canonical_sha256":"903b4600680cabd4c31225c6c69d5ce861270e1d5ddfb8a952bba80882509dd3","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"},"source_kind":"arxiv","source_id":"1703.03500","source_version":1,"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-05-18T00:48:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gNw8Kf36s6z+zUOZbuncQIBlxa84HV2zX7Trw71LdU2k13fbfcBqBF+Q4gEjuDyi7zS0CDCA9kMoU9Bh6lKsCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:40:46.048550Z"},"content_sha256":"b26558afc77cc413b1776de8f867dface1a4ca0bb56c7ab6a105bb72c000775e","schema_version":"1.0","event_id":"sha256:b26558afc77cc413b1776de8f867dface1a4ca0bb56c7ab6a105bb72c000775e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SA5UMADIBSV5JQYSEXDMNHK45B","target":"graph","payload":{"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"},"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-05-18T00:48:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wk+z/yYNwrWd58ukT6dw6yF4saoS74LrRwBKD8ncyOo/IV6akK3Y5We/sBgOTebpE6x5DXBrz7WbyQyoo15wAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:40:46.049196Z"},"content_sha256":"644d1a14ff278b9cfe4f8bdaee9e95ddefe70f45a7489558ed5cb6e4c95cf7b9","schema_version":"1.0","event_id":"sha256:644d1a14ff278b9cfe4f8bdaee9e95ddefe70f45a7489558ed5cb6e4c95cf7b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SA5UMADIBSV5JQYSEXDMNHK45B/bundle.json","state_url":"https://pith.science/pith/SA5UMADIBSV5JQYSEXDMNHK45B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SA5UMADIBSV5JQYSEXDMNHK45B/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-05-27T12:40:46Z","links":{"resolver":"https://pith.science/pith/SA5UMADIBSV5JQYSEXDMNHK45B","bundle":"https://pith.science/pith/SA5UMADIBSV5JQYSEXDMNHK45B/bundle.json","state":"https://pith.science/pith/SA5UMADIBSV5JQYSEXDMNHK45B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SA5UMADIBSV5JQYSEXDMNHK45B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SA5UMADIBSV5JQYSEXDMNHK45B","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":"412c990790c9d4ad368862b04bfdabb8a38c3a6fd6c37ccb5814c8640e73c041","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-10T01:06:08Z","title_canon_sha256":"a6b439555af9449c48d674b58cd917533662e2efd1af843a81a31a7f79bc87c0"},"schema_version":"1.0","source":{"id":"1703.03500","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.03500","created_at":"2026-05-18T00:48:58Z"},{"alias_kind":"arxiv_version","alias_value":"1703.03500v1","created_at":"2026-05-18T00:48:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03500","created_at":"2026-05-18T00:48:58Z"},{"alias_kind":"pith_short_12","alias_value":"SA5UMADIBSV5","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SA5UMADIBSV5JQYS","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SA5UMADI","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:644d1a14ff278b9cfe4f8bdaee9e95ddefe70f45a7489558ed5cb6e4c95cf7b9","target":"graph","created_at":"2026-05-18T00:48:58Z","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"},"paper":{"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","authors_text":"C\\'esar Hern\\'andez-Cruz, Cl\\'audia Linhares Sales, Pavol Hell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-10T01:06:08Z","title":"Minimal obstructions to $2$-polar cographs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03500","kind":"arxiv","version":1},"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:b26558afc77cc413b1776de8f867dface1a4ca0bb56c7ab6a105bb72c000775e","target":"record","created_at":"2026-05-18T00:48:58Z","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":"412c990790c9d4ad368862b04bfdabb8a38c3a6fd6c37ccb5814c8640e73c041","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-10T01:06:08Z","title_canon_sha256":"a6b439555af9449c48d674b58cd917533662e2efd1af843a81a31a7f79bc87c0"},"schema_version":"1.0","source":{"id":"1703.03500","kind":"arxiv","version":1}},"canonical_sha256":"903b4600680cabd4c31225c6c69d5ce861270e1d5ddfb8a952bba80882509dd3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"903b4600680cabd4c31225c6c69d5ce861270e1d5ddfb8a952bba80882509dd3","first_computed_at":"2026-05-18T00:48:58.942073Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:58.942073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9xxgzKbrOiIeFBknyRwVv5cnur3l/93EEocjUBf9oFtfeJ/+VrCk+uIDKRIEfnUyAXpTFfmBXV0OA+rk2lCMBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:58.942743Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.03500","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b26558afc77cc413b1776de8f867dface1a4ca0bb56c7ab6a105bb72c000775e","sha256:644d1a14ff278b9cfe4f8bdaee9e95ddefe70f45a7489558ed5cb6e4c95cf7b9"],"state_sha256":"68046863e2d66d0696faa0b74236c4d3fff2ebc249bd3d428041a1bdce93fcda"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EJbXN4tg6qzMiVoGXMNO75DdG/+BPyANkzQ504F8cmB9WPs/B4Ztowmm1HTgHhFL/6HVV68nFA0+DH+oKZ93DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:40:46.052623Z","bundle_sha256":"4d89aa774469d874de2df4e689a69af570d23244c28a5077968c40e6a1cafa7e"}}