{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:Y2YIITCLJTX47QESHJNGRLDUGK","short_pith_number":"pith:Y2YIITCL","schema_version":"1.0","canonical_sha256":"c6b0844c4b4cefcfc0923a5a68ac743286abb228d868a8b65000f4c1eb1f62af","source":{"kind":"arxiv","id":"1205.4322","version":1},"attestation_state":"computed","paper":{"title":"A generalization of Opsut's lower bounds for the competition number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yoshio Sano","submitted_at":"2012-05-19T12:22:27Z","abstract_excerpt":"The notion of a competition graph was introduced by J. E. Cohen in 1968. The competition graph C(D) 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. In 1978, F. S. Roberts defined the competition number k(G) of a graph G as the minimum number of such isolated vertices. In general, it is hard to compute the "},"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":"1205.4322","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-19T12:22:27Z","cross_cats_sorted":[],"title_canon_sha256":"f0b02577bdd2244bd4df93c632d7af4d5a7e781b2f7f66aa71fcec07f4e0a08b","abstract_canon_sha256":"46f63ddf475a1bf8d6d073022270199db46cb426811d9a7f3acb1551efcdb06f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:22.903147Z","signature_b64":"9z4KBM+//EGNnXaRKc/DT3OutVF4rcQZZ0hLtWh4FrhiXo5AmSCjgAi7skEm0jCuyt2wzavOBu8wtxU/F0J3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6b0844c4b4cefcfc0923a5a68ac743286abb228d868a8b65000f4c1eb1f62af","last_reissued_at":"2026-05-18T03:09:22.902270Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:22.902270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A generalization of Opsut's lower bounds for the competition number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yoshio Sano","submitted_at":"2012-05-19T12:22:27Z","abstract_excerpt":"The notion of a competition graph was introduced by J. E. Cohen in 1968. The competition graph C(D) 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. In 1978, F. S. Roberts defined the competition number k(G) of a graph G as the minimum number of such isolated vertices. In general, it is hard to compute the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4322","kind":"arxiv","version":1},"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":"1205.4322","created_at":"2026-05-18T03:09:22.902423+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.4322v1","created_at":"2026-05-18T03:09:22.902423+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4322","created_at":"2026-05-18T03:09:22.902423+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y2YIITCLJTX4","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y2YIITCLJTX47QES","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y2YIITCL","created_at":"2026-05-18T12:27:27.928770+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/Y2YIITCLJTX47QESHJNGRLDUGK","json":"https://pith.science/pith/Y2YIITCLJTX47QESHJNGRLDUGK.json","graph_json":"https://pith.science/api/pith-number/Y2YIITCLJTX47QESHJNGRLDUGK/graph.json","events_json":"https://pith.science/api/pith-number/Y2YIITCLJTX47QESHJNGRLDUGK/events.json","paper":"https://pith.science/paper/Y2YIITCL"},"agent_actions":{"view_html":"https://pith.science/pith/Y2YIITCLJTX47QESHJNGRLDUGK","download_json":"https://pith.science/pith/Y2YIITCLJTX47QESHJNGRLDUGK.json","view_paper":"https://pith.science/paper/Y2YIITCL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.4322&json=true","fetch_graph":"https://pith.science/api/pith-number/Y2YIITCLJTX47QESHJNGRLDUGK/graph.json","fetch_events":"https://pith.science/api/pith-number/Y2YIITCLJTX47QESHJNGRLDUGK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y2YIITCLJTX47QESHJNGRLDUGK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y2YIITCLJTX47QESHJNGRLDUGK/action/storage_attestation","attest_author":"https://pith.science/pith/Y2YIITCLJTX47QESHJNGRLDUGK/action/author_attestation","sign_citation":"https://pith.science/pith/Y2YIITCLJTX47QESHJNGRLDUGK/action/citation_signature","submit_replication":"https://pith.science/pith/Y2YIITCLJTX47QESHJNGRLDUGK/action/replication_record"}},"created_at":"2026-05-18T03:09:22.902423+00:00","updated_at":"2026-05-18T03:09:22.902423+00:00"}