{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7YZOVFLB2M4YFVZT6ZJOLUITVA","short_pith_number":"pith:7YZOVFLB","schema_version":"1.0","canonical_sha256":"fe32ea9561d33982d733f652e5d113a8395298df7ee9dcca3e6f9a9860daad25","source":{"kind":"arxiv","id":"1502.01824","version":2},"attestation_state":"computed","paper":{"title":"Competition Graphs of Jaco Graphs and the Introduction of the Grog Number of a Simple Connected Graph","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johan Kok, Sunny Joseph Kalayathankal, Susanth C","submitted_at":"2015-02-06T08:29:19Z","abstract_excerpt":"Let $G^\\rightarrow$ be a simple connected directed graph on $n \\geq 2$ vertices and let $V^*$ be a non-empty subset of $V(G^\\rightarrow)$ and denote the undirected subgraph induced by $V^*$ by, $\\langle V^* \\rangle.$ We show that the \\emph{competition graph} of the Jaco graph $J_n(1), n \\in \\Bbb N, n \\geq 5,$ denoted by $C(J_n(1))$ is given by:\\\\ \\\\ $C(J_n(1)) = \\langle V^* \\rangle_{V^* = \\{v_i|3 \\leq i \\leq n-1\\}} - \\{v_iv_{m_i}| m_i = i + d^+_{J_n(1)}(v_i), 3 \\leq i \\leq n-2\\} \\cup \\{v_1, v_2, v_n\\}.$\\\\ \\\\ Further to the above, the concept of the \\emph{grog number} $g(G^\\rightarrow)$ of a si"},"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":"1502.01824","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2015-02-06T08:29:19Z","cross_cats_sorted":[],"title_canon_sha256":"517c03abda843df0bdc8927243faf693b70f814e88c394fce2d8601e1be444be","abstract_canon_sha256":"dc35e65cff0db878d3674fd10ba12fdea0ddb8755cf97dc7d4defda8e5438509"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:26.067873Z","signature_b64":"D6Mq66bjYdp8qi1XBv3iywQ8nD22V69EGMpRjQ61Y3GK56N5Si6aFD49i46Kkw+jdSov9eopG0KBnU39g9A1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe32ea9561d33982d733f652e5d113a8395298df7ee9dcca3e6f9a9860daad25","last_reissued_at":"2026-05-18T02:23:26.067307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:26.067307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Competition Graphs of Jaco Graphs and the Introduction of the Grog Number of a Simple Connected Graph","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johan Kok, Sunny Joseph Kalayathankal, Susanth C","submitted_at":"2015-02-06T08:29:19Z","abstract_excerpt":"Let $G^\\rightarrow$ be a simple connected directed graph on $n \\geq 2$ vertices and let $V^*$ be a non-empty subset of $V(G^\\rightarrow)$ and denote the undirected subgraph induced by $V^*$ by, $\\langle V^* \\rangle.$ We show that the \\emph{competition graph} of the Jaco graph $J_n(1), n \\in \\Bbb N, n \\geq 5,$ denoted by $C(J_n(1))$ is given by:\\\\ \\\\ $C(J_n(1)) = \\langle V^* \\rangle_{V^* = \\{v_i|3 \\leq i \\leq n-1\\}} - \\{v_iv_{m_i}| m_i = i + d^+_{J_n(1)}(v_i), 3 \\leq i \\leq n-2\\} \\cup \\{v_1, v_2, v_n\\}.$\\\\ \\\\ Further to the above, the concept of the \\emph{grog number} $g(G^\\rightarrow)$ of a si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01824","kind":"arxiv","version":2},"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":"1502.01824","created_at":"2026-05-18T02:23:26.067396+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.01824v2","created_at":"2026-05-18T02:23:26.067396+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01824","created_at":"2026-05-18T02:23:26.067396+00:00"},{"alias_kind":"pith_short_12","alias_value":"7YZOVFLB2M4Y","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7YZOVFLB2M4YFVZT","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7YZOVFLB","created_at":"2026-05-18T12:29:10.953037+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/7YZOVFLB2M4YFVZT6ZJOLUITVA","json":"https://pith.science/pith/7YZOVFLB2M4YFVZT6ZJOLUITVA.json","graph_json":"https://pith.science/api/pith-number/7YZOVFLB2M4YFVZT6ZJOLUITVA/graph.json","events_json":"https://pith.science/api/pith-number/7YZOVFLB2M4YFVZT6ZJOLUITVA/events.json","paper":"https://pith.science/paper/7YZOVFLB"},"agent_actions":{"view_html":"https://pith.science/pith/7YZOVFLB2M4YFVZT6ZJOLUITVA","download_json":"https://pith.science/pith/7YZOVFLB2M4YFVZT6ZJOLUITVA.json","view_paper":"https://pith.science/paper/7YZOVFLB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.01824&json=true","fetch_graph":"https://pith.science/api/pith-number/7YZOVFLB2M4YFVZT6ZJOLUITVA/graph.json","fetch_events":"https://pith.science/api/pith-number/7YZOVFLB2M4YFVZT6ZJOLUITVA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7YZOVFLB2M4YFVZT6ZJOLUITVA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7YZOVFLB2M4YFVZT6ZJOLUITVA/action/storage_attestation","attest_author":"https://pith.science/pith/7YZOVFLB2M4YFVZT6ZJOLUITVA/action/author_attestation","sign_citation":"https://pith.science/pith/7YZOVFLB2M4YFVZT6ZJOLUITVA/action/citation_signature","submit_replication":"https://pith.science/pith/7YZOVFLB2M4YFVZT6ZJOLUITVA/action/replication_record"}},"created_at":"2026-05-18T02:23:26.067396+00:00","updated_at":"2026-05-18T02:23:26.067396+00:00"}