{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:7ITW5BF5RQ4FLCA4PXSUTNHRLV","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":"bc2a514e361889385a28156cd880f31f972047713b5ee379cf2b90015718d73f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-09-29T11:31:53Z","title_canon_sha256":"5b1be09a55b34b48e29d31978628278e6129ce6ca093b62cd7e8503bd3a8962f"},"schema_version":"1.0","source":{"id":"0909.5311","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.5311","created_at":"2026-05-18T04:22:09Z"},{"alias_kind":"arxiv_version","alias_value":"0909.5311v3","created_at":"2026-05-18T04:22:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.5311","created_at":"2026-05-18T04:22:09Z"},{"alias_kind":"pith_short_12","alias_value":"7ITW5BF5RQ4F","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"7ITW5BF5RQ4FLCA4","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"7ITW5BF5","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:a699c931dcffa7b4e97e4df1c10d2e1ce58a1ceb646ef23d259937d9575148c5","target":"graph","created_at":"2026-05-18T04:22:09Z","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 number k(G) of a graph G is the smallest number k such that G together with k isolated vertices added is the competition graph of an acyclic digraph. A chordless cycle of length at least 4 of a graph is called a hole of the graph. The number of holes of a graph is closely related to its competition number as the competition number of a graph which does not contain a hole is at most one and the competition number of a complete bipartite graph $K_{\\lfloor \\frac{n}{2} \\rfloor, \\lceil \\frac{n}{2} \\rceil}$ which has so many holes that no more holes can be added is the largest among ","authors_text":"Jung Yeun Lee, Seog-Jin Kim, Suh-Ryung Kim, Yoshio Sano","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-09-29T11:31:53Z","title":"Graphs having many holes but with small competition numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.5311","kind":"arxiv","version":3},"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:ffdcf0ae5d58ea260c0c70e4bada9d1305d38cbca067317b55cfead368b277b6","target":"record","created_at":"2026-05-18T04:22:09Z","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":"bc2a514e361889385a28156cd880f31f972047713b5ee379cf2b90015718d73f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-09-29T11:31:53Z","title_canon_sha256":"5b1be09a55b34b48e29d31978628278e6129ce6ca093b62cd7e8503bd3a8962f"},"schema_version":"1.0","source":{"id":"0909.5311","kind":"arxiv","version":3}},"canonical_sha256":"fa276e84bd8c3855881c7de549b4f15d644e5301a35c39ccb933e1cbbc540e28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa276e84bd8c3855881c7de549b4f15d644e5301a35c39ccb933e1cbbc540e28","first_computed_at":"2026-05-18T04:22:09.342847Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:22:09.342847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jSuX5fx03GBMz6g4muxCY6OWPGxrl46I0l96Yu/1pBDRkAm2sLcp4J7yimReauFBtJR5wKE+RcKqh15Q8eJpDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:22:09.343498Z","signed_message":"canonical_sha256_bytes"},"source_id":"0909.5311","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ffdcf0ae5d58ea260c0c70e4bada9d1305d38cbca067317b55cfead368b277b6","sha256:a699c931dcffa7b4e97e4df1c10d2e1ce58a1ceb646ef23d259937d9575148c5"],"state_sha256":"f745c5a1d37af542538860a75eaf98a9bea4d2b5ff22ef897141ecd313a19fcb"}