{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:7ITW5BF5RQ4FLCA4PXSUTNHRLV","short_pith_number":"pith:7ITW5BF5","schema_version":"1.0","canonical_sha256":"fa276e84bd8c3855881c7de549b4f15d644e5301a35c39ccb933e1cbbc540e28","source":{"kind":"arxiv","id":"0909.5311","version":3},"attestation_state":"computed","paper":{"title":"Graphs having many holes but with small competition numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jung Yeun Lee, Seog-Jin Kim, Suh-Ryung Kim, Yoshio Sano","submitted_at":"2009-09-29T11:31:53Z","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"0909.5311","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-09-29T11:31:53Z","cross_cats_sorted":[],"title_canon_sha256":"5b1be09a55b34b48e29d31978628278e6129ce6ca093b62cd7e8503bd3a8962f","abstract_canon_sha256":"bc2a514e361889385a28156cd880f31f972047713b5ee379cf2b90015718d73f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:09.343498Z","signature_b64":"jSuX5fx03GBMz6g4muxCY6OWPGxrl46I0l96Yu/1pBDRkAm2sLcp4J7yimReauFBtJR5wKE+RcKqh15Q8eJpDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa276e84bd8c3855881c7de549b4f15d644e5301a35c39ccb933e1cbbc540e28","last_reissued_at":"2026-05-18T04:22:09.342847Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:09.342847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs having many holes but with small competition numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jung Yeun Lee, Seog-Jin Kim, Suh-Ryung Kim, Yoshio Sano","submitted_at":"2009-09-29T11:31:53Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.5311","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0909.5311","created_at":"2026-05-18T04:22:09.342952+00:00"},{"alias_kind":"arxiv_version","alias_value":"0909.5311v3","created_at":"2026-05-18T04:22:09.342952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.5311","created_at":"2026-05-18T04:22:09.342952+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ITW5BF5RQ4F","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ITW5BF5RQ4FLCA4","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ITW5BF5","created_at":"2026-05-18T12:25:58.837520+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7ITW5BF5RQ4FLCA4PXSUTNHRLV","json":"https://pith.science/pith/7ITW5BF5RQ4FLCA4PXSUTNHRLV.json","graph_json":"https://pith.science/api/pith-number/7ITW5BF5RQ4FLCA4PXSUTNHRLV/graph.json","events_json":"https://pith.science/api/pith-number/7ITW5BF5RQ4FLCA4PXSUTNHRLV/events.json","paper":"https://pith.science/paper/7ITW5BF5"},"agent_actions":{"view_html":"https://pith.science/pith/7ITW5BF5RQ4FLCA4PXSUTNHRLV","download_json":"https://pith.science/pith/7ITW5BF5RQ4FLCA4PXSUTNHRLV.json","view_paper":"https://pith.science/paper/7ITW5BF5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0909.5311&json=true","fetch_graph":"https://pith.science/api/pith-number/7ITW5BF5RQ4FLCA4PXSUTNHRLV/graph.json","fetch_events":"https://pith.science/api/pith-number/7ITW5BF5RQ4FLCA4PXSUTNHRLV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ITW5BF5RQ4FLCA4PXSUTNHRLV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ITW5BF5RQ4FLCA4PXSUTNHRLV/action/storage_attestation","attest_author":"https://pith.science/pith/7ITW5BF5RQ4FLCA4PXSUTNHRLV/action/author_attestation","sign_citation":"https://pith.science/pith/7ITW5BF5RQ4FLCA4PXSUTNHRLV/action/citation_signature","submit_replication":"https://pith.science/pith/7ITW5BF5RQ4FLCA4PXSUTNHRLV/action/replication_record"}},"created_at":"2026-05-18T04:22:09.342952+00:00","updated_at":"2026-05-18T04:22:09.342952+00:00"}