{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RRRJ57SUZZZAFA4X355PQMT7QS","short_pith_number":"pith:RRRJ57SU","canonical_record":{"source":{"id":"1504.02703","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2015-04-09T10:50:53Z","cross_cats_sorted":[],"title_canon_sha256":"1ddfcb670b4f456b656364d1e22d9f01fa2c80ae24bf62d01ab63f262d82789b","abstract_canon_sha256":"6e92d82ef5e77532da50fcf73ec5ed810b8f21f95ddec8b614a1b037348131b9"},"schema_version":"1.0"},"canonical_sha256":"8c629efe54ce72028397df7af8327f84bdf609ebbc0c90e23d6102072ee74bdb","source":{"kind":"arxiv","id":"1504.02703","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02703","created_at":"2026-05-18T02:03:59Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02703v1","created_at":"2026-05-18T02:03:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02703","created_at":"2026-05-18T02:03:59Z"},{"alias_kind":"pith_short_12","alias_value":"RRRJ57SUZZZA","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RRRJ57SUZZZAFA4X","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RRRJ57SU","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RRRJ57SUZZZAFA4X355PQMT7QS","target":"record","payload":{"canonical_record":{"source":{"id":"1504.02703","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2015-04-09T10:50:53Z","cross_cats_sorted":[],"title_canon_sha256":"1ddfcb670b4f456b656364d1e22d9f01fa2c80ae24bf62d01ab63f262d82789b","abstract_canon_sha256":"6e92d82ef5e77532da50fcf73ec5ed810b8f21f95ddec8b614a1b037348131b9"},"schema_version":"1.0"},"canonical_sha256":"8c629efe54ce72028397df7af8327f84bdf609ebbc0c90e23d6102072ee74bdb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:59.619206Z","signature_b64":"ec5nehSvLQPpEN0JO1b1mSZbETan+7OxhQYjKOd3BN7cYT9JCT9RFxp8fw0cP4rt3a0Jk+PLry7mY+lEFk/+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c629efe54ce72028397df7af8327f84bdf609ebbc0c90e23d6102072ee74bdb","last_reissued_at":"2026-05-18T02:03:59.618403Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:59.618403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.02703","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:03:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0puR/JbyKIbOUptDYclKKc4fwh/8tKnnN3HQTd2KUaSOyQ69QZhVozzTgjB8W8WcamzG2LptUhFSMGo2to7aDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T23:54:06.799540Z"},"content_sha256":"1fbde432cc9d8021e6d77a8ae1906d178c49ca0e98c636119fa35abffeecb084","schema_version":"1.0","event_id":"sha256:1fbde432cc9d8021e6d77a8ae1906d178c49ca0e98c636119fa35abffeecb084"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RRRJ57SUZZZAFA4X355PQMT7QS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Study on Set-Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"C. Susanth, Johan Kok, K. P. Chithra, N. K. Sudev","submitted_at":"2015-04-09T10:50:53Z","abstract_excerpt":"A \\textit{primitive hole} of a graph $G$ is a cycle of length $3$ in $G$. The number of primitive holes in a given graph $G$ is called the primitive hole number of that graph $G$. The primitive degree of a vertex $v$ of a given graph $G$ is the number of primitive holes incident on the vertex $v$. In this paper, we introduce the notion of set-graphs and study the properties and characteristics of set-graphs. We also check the primitive hole number and primitive degree of set-graphs. Interesting introductory results on the nature of order of set-graphs, degree of the vertices corresponding to s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02703","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:03:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ShOrjO7rhNu8ztTjyYHaHVdKxkC0eSY9Im3+HDy53lmOE4QoZhbU+apX+XHAS5i0CQ3a3EUaOWlGFN+6JCdNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T23:54:06.799886Z"},"content_sha256":"8a285e948808af49a578bc5131c2ec8edc3fc8a1b1d844d931b576db168e26c9","schema_version":"1.0","event_id":"sha256:8a285e948808af49a578bc5131c2ec8edc3fc8a1b1d844d931b576db168e26c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RRRJ57SUZZZAFA4X355PQMT7QS/bundle.json","state_url":"https://pith.science/pith/RRRJ57SUZZZAFA4X355PQMT7QS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RRRJ57SUZZZAFA4X355PQMT7QS/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-03T23:54:06Z","links":{"resolver":"https://pith.science/pith/RRRJ57SUZZZAFA4X355PQMT7QS","bundle":"https://pith.science/pith/RRRJ57SUZZZAFA4X355PQMT7QS/bundle.json","state":"https://pith.science/pith/RRRJ57SUZZZAFA4X355PQMT7QS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RRRJ57SUZZZAFA4X355PQMT7QS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RRRJ57SUZZZAFA4X355PQMT7QS","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":"6e92d82ef5e77532da50fcf73ec5ed810b8f21f95ddec8b614a1b037348131b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2015-04-09T10:50:53Z","title_canon_sha256":"1ddfcb670b4f456b656364d1e22d9f01fa2c80ae24bf62d01ab63f262d82789b"},"schema_version":"1.0","source":{"id":"1504.02703","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02703","created_at":"2026-05-18T02:03:59Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02703v1","created_at":"2026-05-18T02:03:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02703","created_at":"2026-05-18T02:03:59Z"},{"alias_kind":"pith_short_12","alias_value":"RRRJ57SUZZZA","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RRRJ57SUZZZAFA4X","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RRRJ57SU","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:8a285e948808af49a578bc5131c2ec8edc3fc8a1b1d844d931b576db168e26c9","target":"graph","created_at":"2026-05-18T02:03:59Z","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 \\textit{primitive hole} of a graph $G$ is a cycle of length $3$ in $G$. The number of primitive holes in a given graph $G$ is called the primitive hole number of that graph $G$. The primitive degree of a vertex $v$ of a given graph $G$ is the number of primitive holes incident on the vertex $v$. In this paper, we introduce the notion of set-graphs and study the properties and characteristics of set-graphs. We also check the primitive hole number and primitive degree of set-graphs. Interesting introductory results on the nature of order of set-graphs, degree of the vertices corresponding to s","authors_text":"C. Susanth, Johan Kok, K. P. Chithra, N. K. Sudev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2015-04-09T10:50:53Z","title":"A Study on Set-Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02703","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:1fbde432cc9d8021e6d77a8ae1906d178c49ca0e98c636119fa35abffeecb084","target":"record","created_at":"2026-05-18T02:03:59Z","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":"6e92d82ef5e77532da50fcf73ec5ed810b8f21f95ddec8b614a1b037348131b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2015-04-09T10:50:53Z","title_canon_sha256":"1ddfcb670b4f456b656364d1e22d9f01fa2c80ae24bf62d01ab63f262d82789b"},"schema_version":"1.0","source":{"id":"1504.02703","kind":"arxiv","version":1}},"canonical_sha256":"8c629efe54ce72028397df7af8327f84bdf609ebbc0c90e23d6102072ee74bdb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c629efe54ce72028397df7af8327f84bdf609ebbc0c90e23d6102072ee74bdb","first_computed_at":"2026-05-18T02:03:59.618403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:59.618403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ec5nehSvLQPpEN0JO1b1mSZbETan+7OxhQYjKOd3BN7cYT9JCT9RFxp8fw0cP4rt3a0Jk+PLry7mY+lEFk/+Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:59.619206Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.02703","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1fbde432cc9d8021e6d77a8ae1906d178c49ca0e98c636119fa35abffeecb084","sha256:8a285e948808af49a578bc5131c2ec8edc3fc8a1b1d844d931b576db168e26c9"],"state_sha256":"f76e5e2b31c0d52d8c360d3ec72d680c197cd7958d06edd108ce9599aaa26ce9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Jk8rk/s98Wrbt1w5Wnba0zz11qjgUvYVdYlae32eP25diSHCmMAdJ7boF5z1so9431FMSp4DGYYLTa1cWs/BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T23:54:06.802078Z","bundle_sha256":"ee153c803305492dba0fb4e186d67afd5d01326233b75361401f18117290668a"}}