{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:O6N32AGGFIEBDJ5LTKZ22EY2NV","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":"abb2872ecd2b2f5a6472572222e490c1c9fec77558a7f64776e18c028d5e35d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-28T17:38:37Z","title_canon_sha256":"bd1915502561782a49972273968e00ef162ade60ebd38216a0596d1184a7896b"},"schema_version":"1.0","source":{"id":"1102.5718","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5718","created_at":"2026-05-18T04:27:46Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5718v1","created_at":"2026-05-18T04:27:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5718","created_at":"2026-05-18T04:27:46Z"},{"alias_kind":"pith_short_12","alias_value":"O6N32AGGFIEB","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"O6N32AGGFIEBDJ5L","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"O6N32AGG","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:e5c4214d8c6adcf5f52ca36a086c822b6bb49225485c9e910ab1110cd23709b4","target":"graph","created_at":"2026-05-18T04:27:46Z","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":"The competition graph of a digraph D is a (simple undirected) graph which has the same vertex set as D and has an edge between x and y if and only if there exists a vertex v in D such that (x,v) and (y,v) are arcs of D. For any graph G, G together with sufficiently many isolated vertices is the competition graph of some acyclic digraph. The competition number k(G) of G is the smallest number of such isolated vertices. In general, it is hard to compute the competition number k(G) for a graph G and it has been one of important research problems in the study of competition graphs to characterize ","authors_text":"Jung Yeun Lee, Suh-Ryung Kim, Yoshio Sano","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-28T17:38:37Z","title":"The competition number of a graph in which any two holes share at most one edge"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5718","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:2af615d535125c3216206822250424868661a582cebca15e802dc5c2913ceb1a","target":"record","created_at":"2026-05-18T04:27:46Z","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":"abb2872ecd2b2f5a6472572222e490c1c9fec77558a7f64776e18c028d5e35d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-28T17:38:37Z","title_canon_sha256":"bd1915502561782a49972273968e00ef162ade60ebd38216a0596d1184a7896b"},"schema_version":"1.0","source":{"id":"1102.5718","kind":"arxiv","version":1}},"canonical_sha256":"779bbd00c62a0811a7ab9ab3ad131a6d4696c6b9d98df94445d140eea0cba4cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"779bbd00c62a0811a7ab9ab3ad131a6d4696c6b9d98df94445d140eea0cba4cc","first_computed_at":"2026-05-18T04:27:46.161584Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:46.161584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gdMmbZAke4GQ1OGXge2NWdbof1Ls+E1ufqF2sAl7skatzA5mmjjHSSQrP1jvrpAxCVnLFOzW8iQQjmFodPD6BA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:46.162105Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.5718","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2af615d535125c3216206822250424868661a582cebca15e802dc5c2913ceb1a","sha256:e5c4214d8c6adcf5f52ca36a086c822b6bb49225485c9e910ab1110cd23709b4"],"state_sha256":"2b1ed08f5456d4451dae6aa1cb684cf5bb3d4eda6808d957c47858af7b5dfca9"}