{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JCW7CZRSTMF2E44V2U3E755KF6","short_pith_number":"pith:JCW7CZRS","schema_version":"1.0","canonical_sha256":"48adf166329b0ba27395d5364ff7aa2f9a670035ea7074496c074609803ee63e","source":{"kind":"arxiv","id":"1905.10966","version":1},"attestation_state":"computed","paper":{"title":"Using $p$-row graphs to study $p$-competition graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Seung Chul Lee, Soogang Eoh, Suh-Ryung Kim, Taehee Hong","submitted_at":"2019-05-27T04:06:46Z","abstract_excerpt":"For a positive integer $p$, the $p$-competition graph of a digraph $D$ is a graph which has the same vertex set as $D$ and an edge between distinct vertices $x$ and $y$ if and only if $x$ and $y$ have at least $p$ common out-neighbors in $D$. A graph is said to be a $p$-competition graph if it is the $p$-competition graph of a digraph. Given a graph $G$, we call the set of positive integers $p$ such that $G$ is a $p$-competition the competition-realizer of a graph $G$. In this paper, we introduce the notion of $p$-row graph of a matrix which generalizes the existing notion of row graph. We cal"},"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":"1905.10966","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-27T04:06:46Z","cross_cats_sorted":[],"title_canon_sha256":"a53b0bf7d4aab41d0593fd5746c72c38ed4ab7e5a536c5709318eb2022846e4b","abstract_canon_sha256":"8606bffed43b59ab5971c288a07d1f633b2ff367a3c2b651043157b3228304c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:03.272886Z","signature_b64":"50IBtFjdESwcZIkBp99l74U45ttPI3oqHrp8kxGd3Z+xZeJUhFPMizr9qSPYOhbPqTqO7QuwTVTtxEs2PaCJDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48adf166329b0ba27395d5364ff7aa2f9a670035ea7074496c074609803ee63e","last_reissued_at":"2026-05-17T23:45:03.272459Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:03.272459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using $p$-row graphs to study $p$-competition graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Seung Chul Lee, Soogang Eoh, Suh-Ryung Kim, Taehee Hong","submitted_at":"2019-05-27T04:06:46Z","abstract_excerpt":"For a positive integer $p$, the $p$-competition graph of a digraph $D$ is a graph which has the same vertex set as $D$ and an edge between distinct vertices $x$ and $y$ if and only if $x$ and $y$ have at least $p$ common out-neighbors in $D$. A graph is said to be a $p$-competition graph if it is the $p$-competition graph of a digraph. Given a graph $G$, we call the set of positive integers $p$ such that $G$ is a $p$-competition the competition-realizer of a graph $G$. In this paper, we introduce the notion of $p$-row graph of a matrix which generalizes the existing notion of row graph. We cal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10966","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":"1905.10966","created_at":"2026-05-17T23:45:03.272536+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.10966v1","created_at":"2026-05-17T23:45:03.272536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10966","created_at":"2026-05-17T23:45:03.272536+00:00"},{"alias_kind":"pith_short_12","alias_value":"JCW7CZRSTMF2","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"JCW7CZRSTMF2E44V","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"JCW7CZRS","created_at":"2026-05-18T12:33:18.533446+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/JCW7CZRSTMF2E44V2U3E755KF6","json":"https://pith.science/pith/JCW7CZRSTMF2E44V2U3E755KF6.json","graph_json":"https://pith.science/api/pith-number/JCW7CZRSTMF2E44V2U3E755KF6/graph.json","events_json":"https://pith.science/api/pith-number/JCW7CZRSTMF2E44V2U3E755KF6/events.json","paper":"https://pith.science/paper/JCW7CZRS"},"agent_actions":{"view_html":"https://pith.science/pith/JCW7CZRSTMF2E44V2U3E755KF6","download_json":"https://pith.science/pith/JCW7CZRSTMF2E44V2U3E755KF6.json","view_paper":"https://pith.science/paper/JCW7CZRS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.10966&json=true","fetch_graph":"https://pith.science/api/pith-number/JCW7CZRSTMF2E44V2U3E755KF6/graph.json","fetch_events":"https://pith.science/api/pith-number/JCW7CZRSTMF2E44V2U3E755KF6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JCW7CZRSTMF2E44V2U3E755KF6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JCW7CZRSTMF2E44V2U3E755KF6/action/storage_attestation","attest_author":"https://pith.science/pith/JCW7CZRSTMF2E44V2U3E755KF6/action/author_attestation","sign_citation":"https://pith.science/pith/JCW7CZRSTMF2E44V2U3E755KF6/action/citation_signature","submit_replication":"https://pith.science/pith/JCW7CZRSTMF2E44V2U3E755KF6/action/replication_record"}},"created_at":"2026-05-17T23:45:03.272536+00:00","updated_at":"2026-05-17T23:45:03.272536+00:00"}