{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:I5HH2HYLDFGKEBUIQAT3VWCLGA","short_pith_number":"pith:I5HH2HYL","schema_version":"1.0","canonical_sha256":"474e7d1f0b194ca206888027bad84b30061cd65af5a840028b7d462daa2776ac","source":{"kind":"arxiv","id":"1103.1028","version":2},"attestation_state":"computed","paper":{"title":"The competition number of a graph and the dimension of its hole space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boram Park, Jung Yeun Lee, Suh-Ryung Kim, Yoshio Sano","submitted_at":"2011-03-05T09:12:07Z","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 "},"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":"1103.1028","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-05T09:12:07Z","cross_cats_sorted":[],"title_canon_sha256":"c0ade29c4cb2f898f078bda8717e6570e484d77e9c2e6c45435a09eb16525095","abstract_canon_sha256":"1680ea07a0cc7253065cc133a2aa20d41564db8a2f9ea087fbe2d34349f912e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:33.551889Z","signature_b64":"9KGnB77TEuNjWvqFloUmhpMfk2AcpuGHGRzlpD2OZJnN9SAIQAjL9ozwOrivIMNh6P6nDHGIwGFxv69gm0juAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"474e7d1f0b194ca206888027bad84b30061cd65af5a840028b7d462daa2776ac","last_reissued_at":"2026-05-18T04:08:33.551364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:33.551364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The competition number of a graph and the dimension of its hole space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boram Park, Jung Yeun Lee, Suh-Ryung Kim, Yoshio Sano","submitted_at":"2011-03-05T09:12:07Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1028","kind":"arxiv","version":2},"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":"1103.1028","created_at":"2026-05-18T04:08:33.551450+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.1028v2","created_at":"2026-05-18T04:08:33.551450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1028","created_at":"2026-05-18T04:08:33.551450+00:00"},{"alias_kind":"pith_short_12","alias_value":"I5HH2HYLDFGK","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"I5HH2HYLDFGKEBUI","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"I5HH2HYL","created_at":"2026-05-18T12:26:30.835961+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/I5HH2HYLDFGKEBUIQAT3VWCLGA","json":"https://pith.science/pith/I5HH2HYLDFGKEBUIQAT3VWCLGA.json","graph_json":"https://pith.science/api/pith-number/I5HH2HYLDFGKEBUIQAT3VWCLGA/graph.json","events_json":"https://pith.science/api/pith-number/I5HH2HYLDFGKEBUIQAT3VWCLGA/events.json","paper":"https://pith.science/paper/I5HH2HYL"},"agent_actions":{"view_html":"https://pith.science/pith/I5HH2HYLDFGKEBUIQAT3VWCLGA","download_json":"https://pith.science/pith/I5HH2HYLDFGKEBUIQAT3VWCLGA.json","view_paper":"https://pith.science/paper/I5HH2HYL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.1028&json=true","fetch_graph":"https://pith.science/api/pith-number/I5HH2HYLDFGKEBUIQAT3VWCLGA/graph.json","fetch_events":"https://pith.science/api/pith-number/I5HH2HYLDFGKEBUIQAT3VWCLGA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I5HH2HYLDFGKEBUIQAT3VWCLGA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I5HH2HYLDFGKEBUIQAT3VWCLGA/action/storage_attestation","attest_author":"https://pith.science/pith/I5HH2HYLDFGKEBUIQAT3VWCLGA/action/author_attestation","sign_citation":"https://pith.science/pith/I5HH2HYLDFGKEBUIQAT3VWCLGA/action/citation_signature","submit_replication":"https://pith.science/pith/I5HH2HYLDFGKEBUIQAT3VWCLGA/action/replication_record"}},"created_at":"2026-05-18T04:08:33.551450+00:00","updated_at":"2026-05-18T04:08:33.551450+00:00"}