{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:R3K2LMVKRLZG7CI6YAVAX53B34","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":"4563aa6cd1c746a844741c08c249e440d1255651ec03be9cc30cfaf173180086","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-22T08:48:09Z","title_canon_sha256":"15bdac8bfe981659562570a3cab336ea94de27552af6a83ce93e8b0b1249d7a1"},"schema_version":"1.0","source":{"id":"1903.09403","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.09403","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"arxiv_version","alias_value":"1903.09403v1","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09403","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"pith_short_12","alias_value":"R3K2LMVKRLZG","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"R3K2LMVKRLZG7CI6","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"R3K2LMVK","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:14f0ed1c0c191205592c11b9ef8b6d942a918091a0670324a6c708f8e8984033","target":"graph","created_at":"2026-05-17T23:50:39Z","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":"Considering connected $K_{1,3}$-free graphs with independence number at least $3$, Chudnovsky and Seymour (2010) showed that every such graph, say $G$, is $2\\omega$-colourable where $\\omega$ denotes the clique number of $G$. We study $(K_{1,3}, Y)$-free graphs, and show that the following three statements are equivalent.\n  (1) Every connected $(K_{1,3}, Y)$-free graph which is distinct from an odd cycle and which has independence number at least $3$ is perfect.\n  (2) Every connected $(K_{1,3}, Y)$-free graph which is distinct from an odd cycle and which has independence number at least $3$ is ","authors_text":"Adam Kabela, Christoph Brause, Ingo Schiermeyer, Petr Vr\\'ana, P\\v{r}emysl Holub, Zden\\v{e}k Ryj\\'a\\v{c}ek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-22T08:48:09Z","title":"On forbidden induced subgraphs for K_{1,3}-free perfect graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09403","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:e9f3948ed87b10c180398a4db09c0ebbcc149b14a60bc4ef6eed09dfc5c4da94","target":"record","created_at":"2026-05-17T23:50:39Z","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":"4563aa6cd1c746a844741c08c249e440d1255651ec03be9cc30cfaf173180086","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-22T08:48:09Z","title_canon_sha256":"15bdac8bfe981659562570a3cab336ea94de27552af6a83ce93e8b0b1249d7a1"},"schema_version":"1.0","source":{"id":"1903.09403","kind":"arxiv","version":1}},"canonical_sha256":"8ed5a5b2aa8af26f891ec02a0bf761df21d6639f74b38307058fa15efa17cdf9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ed5a5b2aa8af26f891ec02a0bf761df21d6639f74b38307058fa15efa17cdf9","first_computed_at":"2026-05-17T23:50:39.753618Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:39.753618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4bK3Bb1zCz/+WBvFdQSD5+Gbvgrqoo+/u1cC0eQ2+NxIScue+a5JB4daxPGlpLQbqgyu62UsJNCvryvTHoAtDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:39.754005Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.09403","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9f3948ed87b10c180398a4db09c0ebbcc149b14a60bc4ef6eed09dfc5c4da94","sha256:14f0ed1c0c191205592c11b9ef8b6d942a918091a0670324a6c708f8e8984033"],"state_sha256":"ac327aeefce8cb33ebfc216a4fc3b9a6eccd6505746aeef3ca1478d3a576d163"}