{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:OMQYA5BJ6LSRR64WKLMCVFDHIM","short_pith_number":"pith:OMQYA5BJ","schema_version":"1.0","canonical_sha256":"7321807429f2e518fb9652d82a946743346e6a031838b182610407049c6f0c62","source":{"kind":"arxiv","id":"1112.6203","version":2},"attestation_state":"computed","paper":{"title":"Competitively tight graphs","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-12-28T23:29:26Z","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 two distinct vertices $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 a graph $G$ is the smallest number of such isolated vertices. Computing the competition number of a graph is an NP-hard problem in general and has been one of the important research pr"},"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":"1112.6203","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-28T23:29:26Z","cross_cats_sorted":[],"title_canon_sha256":"7a41cb7a390d3cc068f0fcc7fdddd692442d30abce4226e3a2f0c9694c19fe12","abstract_canon_sha256":"efe0ddc65af6f549b18696bb52a474082792797159e5153ae3bfdb6ef9dc0902"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:57.087520Z","signature_b64":"IKYlkJqUcmzZMqDWTmyTQ+HqHgpL0a7f2KtgGqzNXNXOijv9K3/WGMTemoFKdWxdahzUmjq730BXhfPHEL/iCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7321807429f2e518fb9652d82a946743346e6a031838b182610407049c6f0c62","last_reissued_at":"2026-05-18T03:03:57.086632Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:57.086632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Competitively tight graphs","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-12-28T23:29:26Z","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 two distinct vertices $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 a graph $G$ is the smallest number of such isolated vertices. Computing the competition number of a graph is an NP-hard problem in general and has been one of the important research pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.6203","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":"1112.6203","created_at":"2026-05-18T03:03:57.086807+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.6203v2","created_at":"2026-05-18T03:03:57.086807+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.6203","created_at":"2026-05-18T03:03:57.086807+00:00"},{"alias_kind":"pith_short_12","alias_value":"OMQYA5BJ6LSR","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"OMQYA5BJ6LSRR64W","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"OMQYA5BJ","created_at":"2026-05-18T12:26:37.096874+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/OMQYA5BJ6LSRR64WKLMCVFDHIM","json":"https://pith.science/pith/OMQYA5BJ6LSRR64WKLMCVFDHIM.json","graph_json":"https://pith.science/api/pith-number/OMQYA5BJ6LSRR64WKLMCVFDHIM/graph.json","events_json":"https://pith.science/api/pith-number/OMQYA5BJ6LSRR64WKLMCVFDHIM/events.json","paper":"https://pith.science/paper/OMQYA5BJ"},"agent_actions":{"view_html":"https://pith.science/pith/OMQYA5BJ6LSRR64WKLMCVFDHIM","download_json":"https://pith.science/pith/OMQYA5BJ6LSRR64WKLMCVFDHIM.json","view_paper":"https://pith.science/paper/OMQYA5BJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.6203&json=true","fetch_graph":"https://pith.science/api/pith-number/OMQYA5BJ6LSRR64WKLMCVFDHIM/graph.json","fetch_events":"https://pith.science/api/pith-number/OMQYA5BJ6LSRR64WKLMCVFDHIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OMQYA5BJ6LSRR64WKLMCVFDHIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OMQYA5BJ6LSRR64WKLMCVFDHIM/action/storage_attestation","attest_author":"https://pith.science/pith/OMQYA5BJ6LSRR64WKLMCVFDHIM/action/author_attestation","sign_citation":"https://pith.science/pith/OMQYA5BJ6LSRR64WKLMCVFDHIM/action/citation_signature","submit_replication":"https://pith.science/pith/OMQYA5BJ6LSRR64WKLMCVFDHIM/action/replication_record"}},"created_at":"2026-05-18T03:03:57.086807+00:00","updated_at":"2026-05-18T03:03:57.086807+00:00"}