{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:R3K2LMVKRLZG7CI6YAVAX53B34","short_pith_number":"pith:R3K2LMVK","canonical_record":{"source":{"id":"1903.09403","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-22T08:48:09Z","cross_cats_sorted":[],"title_canon_sha256":"15bdac8bfe981659562570a3cab336ea94de27552af6a83ce93e8b0b1249d7a1","abstract_canon_sha256":"4563aa6cd1c746a844741c08c249e440d1255651ec03be9cc30cfaf173180086"},"schema_version":"1.0"},"canonical_sha256":"8ed5a5b2aa8af26f891ec02a0bf761df21d6639f74b38307058fa15efa17cdf9","source":{"kind":"arxiv","id":"1903.09403","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:R3K2LMVKRLZG7CI6YAVAX53B34","target":"record","payload":{"canonical_record":{"source":{"id":"1903.09403","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-22T08:48:09Z","cross_cats_sorted":[],"title_canon_sha256":"15bdac8bfe981659562570a3cab336ea94de27552af6a83ce93e8b0b1249d7a1","abstract_canon_sha256":"4563aa6cd1c746a844741c08c249e440d1255651ec03be9cc30cfaf173180086"},"schema_version":"1.0"},"canonical_sha256":"8ed5a5b2aa8af26f891ec02a0bf761df21d6639f74b38307058fa15efa17cdf9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:39.754005Z","signature_b64":"4bK3Bb1zCz/+WBvFdQSD5+Gbvgrqoo+/u1cC0eQ2+NxIScue+a5JB4daxPGlpLQbqgyu62UsJNCvryvTHoAtDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ed5a5b2aa8af26f891ec02a0bf761df21d6639f74b38307058fa15efa17cdf9","last_reissued_at":"2026-05-17T23:50:39.753618Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:39.753618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.09403","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-17T23:50:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2UNV/OxkX9yLS6WagveDFP26RWVm6UALqkOH2NQo7JPFe6gWA2bVNIcS9D2VVnkM7HcMZH8XNoVIG1aLpw9aCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:00:44.150266Z"},"content_sha256":"e9f3948ed87b10c180398a4db09c0ebbcc149b14a60bc4ef6eed09dfc5c4da94","schema_version":"1.0","event_id":"sha256:e9f3948ed87b10c180398a4db09c0ebbcc149b14a60bc4ef6eed09dfc5c4da94"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:R3K2LMVKRLZG7CI6YAVAX53B34","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On forbidden induced subgraphs for K_{1,3}-free perfect graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","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","submitted_at":"2019-03-22T08:48:09Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09403","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-17T23:50:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Pu4401J+IC3ObVr53NDQ5JyyE7ge4Ppep7lqnUqFMdzh6lNaxi9Mx4LGfl7sbgWHD7bS4oKt8uXniqGFo78Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:00:44.150950Z"},"content_sha256":"14f0ed1c0c191205592c11b9ef8b6d942a918091a0670324a6c708f8e8984033","schema_version":"1.0","event_id":"sha256:14f0ed1c0c191205592c11b9ef8b6d942a918091a0670324a6c708f8e8984033"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R3K2LMVKRLZG7CI6YAVAX53B34/bundle.json","state_url":"https://pith.science/pith/R3K2LMVKRLZG7CI6YAVAX53B34/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R3K2LMVKRLZG7CI6YAVAX53B34/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-26T15:00:44Z","links":{"resolver":"https://pith.science/pith/R3K2LMVKRLZG7CI6YAVAX53B34","bundle":"https://pith.science/pith/R3K2LMVKRLZG7CI6YAVAX53B34/bundle.json","state":"https://pith.science/pith/R3K2LMVKRLZG7CI6YAVAX53B34/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R3K2LMVKRLZG7CI6YAVAX53B34/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gu0SM7pYic6US1x4HLQ7dFLy6S02XTJs3//qTFtkR1/QBlqzpoizS0UQ5v2GJhgOvWp1ZM5RP0EFDBBtUFovCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:00:44.154367Z","bundle_sha256":"55254f146afced26a1635c8e8d8883177c12507298564146513746e8cb0ee87d"}}