{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:F5RSNR5A57WPHJ5SFLUBQZQPSI","short_pith_number":"pith:F5RSNR5A","schema_version":"1.0","canonical_sha256":"2f6326c7a0efecf3a7b22ae818660f92340cdb4a4496738a6399731c70101985","source":{"kind":"arxiv","id":"1503.04526","version":1},"attestation_state":"computed","paper":{"title":"The Primitive Hole Number of Certain Graphs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johan Kok, N.K. Sudev","submitted_at":"2015-03-16T05:44:09Z","abstract_excerpt":"A hole of a simple connected graph $G$ is a chordless cycle $C_n,$ where $n \\in \\Bbb N, n \\geq 4,$ in the graph $G$. The girth of a simple connected graph $G$ is the smallest cycle in $G$, if any such cycle exists. It can be observed that all such smallest cycles are necessarily chordless. We call the cycle $C_3$ in a given graph $G$ a primitive hole of that graph. We introduce the notion of the primitive hole number of a graph as the number of primitive holes present in that graph. In this paper, we determine the primitive hole number of certain standard graphs. Also, we determine the primiti"},"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":"1503.04526","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2015-03-16T05:44:09Z","cross_cats_sorted":[],"title_canon_sha256":"36a31b5fe04dfe472e3216cb0f058aa59bc3993a149945d3e23a999b5fd1ddf7","abstract_canon_sha256":"5f2e6fe2f8ac729f9c61827461ebddca2e4c5d4b292125a3694577b95fe19b1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:24.737155Z","signature_b64":"utuku791UsyOrh/C7BsEW/xqwRVYQR8X5znm3M2XWwmtevGcW1xWdvQy3cBaPP1aVAiCQ5O35q1spVanL9SlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f6326c7a0efecf3a7b22ae818660f92340cdb4a4496738a6399731c70101985","last_reissued_at":"2026-05-18T02:23:24.736519Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:24.736519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Primitive Hole Number of Certain Graphs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johan Kok, N.K. Sudev","submitted_at":"2015-03-16T05:44:09Z","abstract_excerpt":"A hole of a simple connected graph $G$ is a chordless cycle $C_n,$ where $n \\in \\Bbb N, n \\geq 4,$ in the graph $G$. The girth of a simple connected graph $G$ is the smallest cycle in $G$, if any such cycle exists. It can be observed that all such smallest cycles are necessarily chordless. We call the cycle $C_3$ in a given graph $G$ a primitive hole of that graph. We introduce the notion of the primitive hole number of a graph as the number of primitive holes present in that graph. In this paper, we determine the primitive hole number of certain standard graphs. Also, we determine the primiti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04526","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":"1503.04526","created_at":"2026-05-18T02:23:24.736642+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.04526v1","created_at":"2026-05-18T02:23:24.736642+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04526","created_at":"2026-05-18T02:23:24.736642+00:00"},{"alias_kind":"pith_short_12","alias_value":"F5RSNR5A57WP","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"F5RSNR5A57WPHJ5S","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"F5RSNR5A","created_at":"2026-05-18T12:29:19.899920+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/F5RSNR5A57WPHJ5SFLUBQZQPSI","json":"https://pith.science/pith/F5RSNR5A57WPHJ5SFLUBQZQPSI.json","graph_json":"https://pith.science/api/pith-number/F5RSNR5A57WPHJ5SFLUBQZQPSI/graph.json","events_json":"https://pith.science/api/pith-number/F5RSNR5A57WPHJ5SFLUBQZQPSI/events.json","paper":"https://pith.science/paper/F5RSNR5A"},"agent_actions":{"view_html":"https://pith.science/pith/F5RSNR5A57WPHJ5SFLUBQZQPSI","download_json":"https://pith.science/pith/F5RSNR5A57WPHJ5SFLUBQZQPSI.json","view_paper":"https://pith.science/paper/F5RSNR5A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.04526&json=true","fetch_graph":"https://pith.science/api/pith-number/F5RSNR5A57WPHJ5SFLUBQZQPSI/graph.json","fetch_events":"https://pith.science/api/pith-number/F5RSNR5A57WPHJ5SFLUBQZQPSI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F5RSNR5A57WPHJ5SFLUBQZQPSI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F5RSNR5A57WPHJ5SFLUBQZQPSI/action/storage_attestation","attest_author":"https://pith.science/pith/F5RSNR5A57WPHJ5SFLUBQZQPSI/action/author_attestation","sign_citation":"https://pith.science/pith/F5RSNR5A57WPHJ5SFLUBQZQPSI/action/citation_signature","submit_replication":"https://pith.science/pith/F5RSNR5A57WPHJ5SFLUBQZQPSI/action/replication_record"}},"created_at":"2026-05-18T02:23:24.736642+00:00","updated_at":"2026-05-18T02:23:24.736642+00:00"}