{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UKT7NUISCW46NTYLXKJTDFK5W2","short_pith_number":"pith:UKT7NUIS","schema_version":"1.0","canonical_sha256":"a2a7f6d11215b9e6cf0bba9331955db6ace6ab24062e66e30eb42ccee530f0c5","source":{"kind":"arxiv","id":"1812.01796","version":1},"attestation_state":"computed","paper":{"title":"The (1,2)-step competition graph of a hypertournament","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ruijuan Li, Xiaoting An, Xinhong Zhang","submitted_at":"2018-12-05T03:12:18Z","abstract_excerpt":"Competition graphs were created in connected to a biological model as a means of reflecting the competition relations among the predators in the food webs and determining the smallest dimension of ecological phase space. In 2011, Factor and Merz introduced the (1,2)-step competition graph of a digraph. Given a digraph $D=(V,A)$, the (1,2)-step competition graph of $D$, denoted $C_{1,2}(D)$, is a graph on $V(D)$ where $xy\\in E(C_{1,2}(D))$ if and only if there exists a vertex $z\\neq x,y$ such that either $d_{D-y}(x,z)=1$ and $d_{D-x}(y,z)\\leq 2$ or $d_{D-x}(y,z)=1$ and $d_{D-y}(x,z)\\leq 2$. 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":"1812.01796","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-05T03:12:18Z","cross_cats_sorted":[],"title_canon_sha256":"01372446bc0d2d0e8b135f741d8cde06cf87f52a35cb95d8b7c019b5baf8dae5","abstract_canon_sha256":"0fca9c8cd06d83436d6d0f1ce3a201857e235c9e8b3695c28c07bd9545873b3c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:00.610888Z","signature_b64":"S/06yCXwJc2lOlYguz7/89WWi5cHbd3mcXhXEGEZbhNy65tX4KE++vOXk5R293Bm/iWBWasc5qinr9URFXJhAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2a7f6d11215b9e6cf0bba9331955db6ace6ab24062e66e30eb42ccee530f0c5","last_reissued_at":"2026-05-17T23:59:00.610250Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:00.610250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The (1,2)-step competition graph of a hypertournament","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ruijuan Li, Xiaoting An, Xinhong Zhang","submitted_at":"2018-12-05T03:12:18Z","abstract_excerpt":"Competition graphs were created in connected to a biological model as a means of reflecting the competition relations among the predators in the food webs and determining the smallest dimension of ecological phase space. In 2011, Factor and Merz introduced the (1,2)-step competition graph of a digraph. Given a digraph $D=(V,A)$, the (1,2)-step competition graph of $D$, denoted $C_{1,2}(D)$, is a graph on $V(D)$ where $xy\\in E(C_{1,2}(D))$ if and only if there exists a vertex $z\\neq x,y$ such that either $d_{D-y}(x,z)=1$ and $d_{D-x}(y,z)\\leq 2$ or $d_{D-x}(y,z)=1$ and $d_{D-y}(x,z)\\leq 2$. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01796","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":"1812.01796","created_at":"2026-05-17T23:59:00.610363+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.01796v1","created_at":"2026-05-17T23:59:00.610363+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01796","created_at":"2026-05-17T23:59:00.610363+00:00"},{"alias_kind":"pith_short_12","alias_value":"UKT7NUISCW46","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UKT7NUISCW46NTYL","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UKT7NUIS","created_at":"2026-05-18T12:32:56.356000+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/UKT7NUISCW46NTYLXKJTDFK5W2","json":"https://pith.science/pith/UKT7NUISCW46NTYLXKJTDFK5W2.json","graph_json":"https://pith.science/api/pith-number/UKT7NUISCW46NTYLXKJTDFK5W2/graph.json","events_json":"https://pith.science/api/pith-number/UKT7NUISCW46NTYLXKJTDFK5W2/events.json","paper":"https://pith.science/paper/UKT7NUIS"},"agent_actions":{"view_html":"https://pith.science/pith/UKT7NUISCW46NTYLXKJTDFK5W2","download_json":"https://pith.science/pith/UKT7NUISCW46NTYLXKJTDFK5W2.json","view_paper":"https://pith.science/paper/UKT7NUIS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.01796&json=true","fetch_graph":"https://pith.science/api/pith-number/UKT7NUISCW46NTYLXKJTDFK5W2/graph.json","fetch_events":"https://pith.science/api/pith-number/UKT7NUISCW46NTYLXKJTDFK5W2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UKT7NUISCW46NTYLXKJTDFK5W2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UKT7NUISCW46NTYLXKJTDFK5W2/action/storage_attestation","attest_author":"https://pith.science/pith/UKT7NUISCW46NTYLXKJTDFK5W2/action/author_attestation","sign_citation":"https://pith.science/pith/UKT7NUISCW46NTYLXKJTDFK5W2/action/citation_signature","submit_replication":"https://pith.science/pith/UKT7NUISCW46NTYLXKJTDFK5W2/action/replication_record"}},"created_at":"2026-05-17T23:59:00.610363+00:00","updated_at":"2026-05-17T23:59:00.610363+00:00"}