{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JCW7CZRSTMF2E44V2U3E755KF6","short_pith_number":"pith:JCW7CZRS","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"},"canonical_sha256":"48adf166329b0ba27395d5364ff7aa2f9a670035ea7074496c074609803ee63e","source":{"kind":"arxiv","id":"1905.10966","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10966","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10966v1","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10966","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"pith_short_12","alias_value":"JCW7CZRSTMF2","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"JCW7CZRSTMF2E44V","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"JCW7CZRS","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JCW7CZRSTMF2E44V2U3E755KF6","target":"record","payload":{"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"},"canonical_sha256":"48adf166329b0ba27395d5364ff7aa2f9a670035ea7074496c074609803ee63e","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"},"source_kind":"arxiv","source_id":"1905.10966","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5uCleOXsTT8E2O44uxkzrsJd7ec4qiLH9mxBvbm3AUImr92zQ2nB8baA001xYW05YUAhKtBdZRZq1b0iBblmAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:19:07.049947Z"},"content_sha256":"462330a1a6797219df043784dc22ca71fd9308eadeab9ea5890fb0046c3b0b9e","schema_version":"1.0","event_id":"sha256:462330a1a6797219df043784dc22ca71fd9308eadeab9ea5890fb0046c3b0b9e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JCW7CZRSTMF2E44V2U3E755KF6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QSXOmNAo9W9MtEZXiOWhRBfeQKvv2tddd3VchYycgHcHJ6KFJejw2P5qZw3jJ2gB3/pxn41vUD3HDZOFsvHNCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:19:07.050288Z"},"content_sha256":"2aec6c9d4ffc230ba1709b57b339ebfabf57d4d2d611d901fe448e00072f78c4","schema_version":"1.0","event_id":"sha256:2aec6c9d4ffc230ba1709b57b339ebfabf57d4d2d611d901fe448e00072f78c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JCW7CZRSTMF2E44V2U3E755KF6/bundle.json","state_url":"https://pith.science/pith/JCW7CZRSTMF2E44V2U3E755KF6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JCW7CZRSTMF2E44V2U3E755KF6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T07:19:07Z","links":{"resolver":"https://pith.science/pith/JCW7CZRSTMF2E44V2U3E755KF6","bundle":"https://pith.science/pith/JCW7CZRSTMF2E44V2U3E755KF6/bundle.json","state":"https://pith.science/pith/JCW7CZRSTMF2E44V2U3E755KF6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JCW7CZRSTMF2E44V2U3E755KF6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JCW7CZRSTMF2E44V2U3E755KF6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8606bffed43b59ab5971c288a07d1f633b2ff367a3c2b651043157b3228304c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-27T04:06:46Z","title_canon_sha256":"a53b0bf7d4aab41d0593fd5746c72c38ed4ab7e5a536c5709318eb2022846e4b"},"schema_version":"1.0","source":{"id":"1905.10966","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10966","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10966v1","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10966","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"pith_short_12","alias_value":"JCW7CZRSTMF2","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"JCW7CZRSTMF2E44V","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"JCW7CZRS","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:2aec6c9d4ffc230ba1709b57b339ebfabf57d4d2d611d901fe448e00072f78c4","target":"graph","created_at":"2026-05-17T23:45:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Seung Chul Lee, Soogang Eoh, Suh-Ryung Kim, Taehee Hong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-27T04:06:46Z","title":"Using $p$-row graphs to study $p$-competition graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10966","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:462330a1a6797219df043784dc22ca71fd9308eadeab9ea5890fb0046c3b0b9e","target":"record","created_at":"2026-05-17T23:45:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8606bffed43b59ab5971c288a07d1f633b2ff367a3c2b651043157b3228304c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-27T04:06:46Z","title_canon_sha256":"a53b0bf7d4aab41d0593fd5746c72c38ed4ab7e5a536c5709318eb2022846e4b"},"schema_version":"1.0","source":{"id":"1905.10966","kind":"arxiv","version":1}},"canonical_sha256":"48adf166329b0ba27395d5364ff7aa2f9a670035ea7074496c074609803ee63e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48adf166329b0ba27395d5364ff7aa2f9a670035ea7074496c074609803ee63e","first_computed_at":"2026-05-17T23:45:03.272459Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:03.272459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"50IBtFjdESwcZIkBp99l74U45ttPI3oqHrp8kxGd3Z+xZeJUhFPMizr9qSPYOhbPqTqO7QuwTVTtxEs2PaCJDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:03.272886Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.10966","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:462330a1a6797219df043784dc22ca71fd9308eadeab9ea5890fb0046c3b0b9e","sha256:2aec6c9d4ffc230ba1709b57b339ebfabf57d4d2d611d901fe448e00072f78c4"],"state_sha256":"541db39410702d6d259ed3548f62891dd9f908c56bd078e21578804d030391e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ImbXe2Qh+FUiLLct7QkrpCScwbNiCXoEoEF412WdVltmrk/xkHReWGHOOhaLuY0fCJSNTdMGKYL1FPO/HsN3DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T07:19:07.052580Z","bundle_sha256":"58998fb8ecc7ea67f110cbfe361b0a308821c175a123ff8c728398107b3a1a91"}}