{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:F5RSNR5A57WPHJ5SFLUBQZQPSI","short_pith_number":"pith:F5RSNR5A","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"},"canonical_sha256":"2f6326c7a0efecf3a7b22ae818660f92340cdb4a4496738a6399731c70101985","source":{"kind":"arxiv","id":"1503.04526","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04526","created_at":"2026-05-18T02:23:24Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04526v1","created_at":"2026-05-18T02:23:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04526","created_at":"2026-05-18T02:23:24Z"},{"alias_kind":"pith_short_12","alias_value":"F5RSNR5A57WP","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"F5RSNR5A57WPHJ5S","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"F5RSNR5A","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:F5RSNR5A57WPHJ5SFLUBQZQPSI","target":"record","payload":{"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"},"canonical_sha256":"2f6326c7a0efecf3a7b22ae818660f92340cdb4a4496738a6399731c70101985","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"},"source_kind":"arxiv","source_id":"1503.04526","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-18T02:23:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yrpzX9eWev+zQBTOhbtjMXKiuax6mkS2q/OKdfgmlnjpBQmvgeIni9kd3bP83dJo3Zp04Ul4HOCYcnKxfkJNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:32:51.758289Z"},"content_sha256":"ed90343c25c53dc33ce4cbe665a684ce72cbecaf9befdf0d4571f72719907479","schema_version":"1.0","event_id":"sha256:ed90343c25c53dc33ce4cbe665a684ce72cbecaf9befdf0d4571f72719907479"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:F5RSNR5A57WPHJ5SFLUBQZQPSI","target":"graph","payload":{"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"},"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-18T02:23:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k57QAI1RF9iK0Osa2H3+1XWczE5RXFhJyqLXumR/u2zYouXz8GGFEn3EljcSDlHjhKwJtB55YgPokwKGdI2/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:32:51.758949Z"},"content_sha256":"5b258cc84092898b67b0ec1e10f4b5ca3438fc3e71bfcbb32640ce35961f1ee8","schema_version":"1.0","event_id":"sha256:5b258cc84092898b67b0ec1e10f4b5ca3438fc3e71bfcbb32640ce35961f1ee8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F5RSNR5A57WPHJ5SFLUBQZQPSI/bundle.json","state_url":"https://pith.science/pith/F5RSNR5A57WPHJ5SFLUBQZQPSI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F5RSNR5A57WPHJ5SFLUBQZQPSI/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-04T01:32:51Z","links":{"resolver":"https://pith.science/pith/F5RSNR5A57WPHJ5SFLUBQZQPSI","bundle":"https://pith.science/pith/F5RSNR5A57WPHJ5SFLUBQZQPSI/bundle.json","state":"https://pith.science/pith/F5RSNR5A57WPHJ5SFLUBQZQPSI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F5RSNR5A57WPHJ5SFLUBQZQPSI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:F5RSNR5A57WPHJ5SFLUBQZQPSI","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":"5f2e6fe2f8ac729f9c61827461ebddca2e4c5d4b292125a3694577b95fe19b1f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2015-03-16T05:44:09Z","title_canon_sha256":"36a31b5fe04dfe472e3216cb0f058aa59bc3993a149945d3e23a999b5fd1ddf7"},"schema_version":"1.0","source":{"id":"1503.04526","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04526","created_at":"2026-05-18T02:23:24Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04526v1","created_at":"2026-05-18T02:23:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04526","created_at":"2026-05-18T02:23:24Z"},{"alias_kind":"pith_short_12","alias_value":"F5RSNR5A57WP","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"F5RSNR5A57WPHJ5S","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"F5RSNR5A","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:5b258cc84092898b67b0ec1e10f4b5ca3438fc3e71bfcbb32640ce35961f1ee8","target":"graph","created_at":"2026-05-18T02:23:24Z","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":"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","authors_text":"Johan Kok, N.K. Sudev","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2015-03-16T05:44:09Z","title":"The Primitive Hole Number of Certain Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04526","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:ed90343c25c53dc33ce4cbe665a684ce72cbecaf9befdf0d4571f72719907479","target":"record","created_at":"2026-05-18T02:23:24Z","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":"5f2e6fe2f8ac729f9c61827461ebddca2e4c5d4b292125a3694577b95fe19b1f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2015-03-16T05:44:09Z","title_canon_sha256":"36a31b5fe04dfe472e3216cb0f058aa59bc3993a149945d3e23a999b5fd1ddf7"},"schema_version":"1.0","source":{"id":"1503.04526","kind":"arxiv","version":1}},"canonical_sha256":"2f6326c7a0efecf3a7b22ae818660f92340cdb4a4496738a6399731c70101985","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f6326c7a0efecf3a7b22ae818660f92340cdb4a4496738a6399731c70101985","first_computed_at":"2026-05-18T02:23:24.736519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:24.736519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"utuku791UsyOrh/C7BsEW/xqwRVYQR8X5znm3M2XWwmtevGcW1xWdvQy3cBaPP1aVAiCQ5O35q1spVanL9SlAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:24.737155Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.04526","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed90343c25c53dc33ce4cbe665a684ce72cbecaf9befdf0d4571f72719907479","sha256:5b258cc84092898b67b0ec1e10f4b5ca3438fc3e71bfcbb32640ce35961f1ee8"],"state_sha256":"72ffc21f8b3a0490d5995007e3e07f9d5bfec7e8ed3389c5d97a33bec16f3004"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CTDVJIYoEqXJa9qcdCY2mt4ZVBqi+lR9BOb8jIPmzgoocWlQ9ySvzbqCzYmzt7oMPzliQz09lp6JViQjQumADw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T01:32:51.762217Z","bundle_sha256":"fdb6c15097073fb662f4501507c510aab57a2c597410eadf8ed75a45a6c2ead1"}}