{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2KOMUQQPZHM55LDYR3VLKEHCTY","short_pith_number":"pith:2KOMUQQP","schema_version":"1.0","canonical_sha256":"d29cca420fc9d9deac788eeab510e29e0c0476f3e2d4d26b1466814ddf59c31f","source":{"kind":"arxiv","id":"1602.04623","version":3},"attestation_state":"computed","paper":{"title":"Competition numbers of planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jihoon Choi, Soogang Eoh, Suh-Ryung Kim","submitted_at":"2016-02-15T10:54:57Z","abstract_excerpt":"In this paper, we relate the competition number of a graph to its edge clique cover number by presenting a tight inequality $k(G) \\ge \\theta_e(G)-|V(G)|+\\widetilde{k}(G)$ where $\\theta_e(G)$, $k(G)$, and $\\widetilde{k}(G)$ are the edge clique cover number, the competition number, and the co-competition number of a graph $G$, respectively. By utilizing this inequality and a notion of competition-effective edge clique cover, we obtain some meaningful results on competition numbers of planar graphs."},"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":"1602.04623","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-15T10:54:57Z","cross_cats_sorted":[],"title_canon_sha256":"bbf4d9e771f7410dd774b9983bafdca819bdb27698e25af6564570b9ef7d91cd","abstract_canon_sha256":"3385b8e7d974793280f6b9745b59d031e12d9f2157c150fc71673047e9309e72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:37.538549Z","signature_b64":"EHU8dWiiZ6aDIuhQvxZHxBDIKztYvRRjbZrOTvY2FjRSTP5cZkoDWGH/obS0QLvKumki5ToVdIxi+QUJ+nM1Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d29cca420fc9d9deac788eeab510e29e0c0476f3e2d4d26b1466814ddf59c31f","last_reissued_at":"2026-05-18T00:03:37.538042Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:37.538042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Competition numbers of planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jihoon Choi, Soogang Eoh, Suh-Ryung Kim","submitted_at":"2016-02-15T10:54:57Z","abstract_excerpt":"In this paper, we relate the competition number of a graph to its edge clique cover number by presenting a tight inequality $k(G) \\ge \\theta_e(G)-|V(G)|+\\widetilde{k}(G)$ where $\\theta_e(G)$, $k(G)$, and $\\widetilde{k}(G)$ are the edge clique cover number, the competition number, and the co-competition number of a graph $G$, respectively. By utilizing this inequality and a notion of competition-effective edge clique cover, we obtain some meaningful results on competition numbers of planar graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04623","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":"1602.04623","created_at":"2026-05-18T00:03:37.538114+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.04623v3","created_at":"2026-05-18T00:03:37.538114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04623","created_at":"2026-05-18T00:03:37.538114+00:00"},{"alias_kind":"pith_short_12","alias_value":"2KOMUQQPZHM5","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2KOMUQQPZHM55LDY","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2KOMUQQP","created_at":"2026-05-18T12:29:55.572404+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/2KOMUQQPZHM55LDYR3VLKEHCTY","json":"https://pith.science/pith/2KOMUQQPZHM55LDYR3VLKEHCTY.json","graph_json":"https://pith.science/api/pith-number/2KOMUQQPZHM55LDYR3VLKEHCTY/graph.json","events_json":"https://pith.science/api/pith-number/2KOMUQQPZHM55LDYR3VLKEHCTY/events.json","paper":"https://pith.science/paper/2KOMUQQP"},"agent_actions":{"view_html":"https://pith.science/pith/2KOMUQQPZHM55LDYR3VLKEHCTY","download_json":"https://pith.science/pith/2KOMUQQPZHM55LDYR3VLKEHCTY.json","view_paper":"https://pith.science/paper/2KOMUQQP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.04623&json=true","fetch_graph":"https://pith.science/api/pith-number/2KOMUQQPZHM55LDYR3VLKEHCTY/graph.json","fetch_events":"https://pith.science/api/pith-number/2KOMUQQPZHM55LDYR3VLKEHCTY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2KOMUQQPZHM55LDYR3VLKEHCTY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2KOMUQQPZHM55LDYR3VLKEHCTY/action/storage_attestation","attest_author":"https://pith.science/pith/2KOMUQQPZHM55LDYR3VLKEHCTY/action/author_attestation","sign_citation":"https://pith.science/pith/2KOMUQQPZHM55LDYR3VLKEHCTY/action/citation_signature","submit_replication":"https://pith.science/pith/2KOMUQQPZHM55LDYR3VLKEHCTY/action/replication_record"}},"created_at":"2026-05-18T00:03:37.538114+00:00","updated_at":"2026-05-18T00:03:37.538114+00:00"}