{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:62CWSLXNSZSAAIXJEU6OU2WFVY","short_pith_number":"pith:62CWSLXN","canonical_record":{"source":{"id":"1601.02662","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2016-01-01T01:06:58Z","cross_cats_sorted":[],"title_canon_sha256":"60b33e39df331c1a1a31e91dc036f7494b8156baa39e204a504019cd6b724473","abstract_canon_sha256":"407e2703c84e35261228a7afe043ee6ac82121732957441e90f040a2d6b1a5db"},"schema_version":"1.0"},"canonical_sha256":"f685692eed96640022e9253cea6ac5ae2110b7cfc227ed265be38ce354245128","source":{"kind":"arxiv","id":"1601.02662","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.02662","created_at":"2026-05-18T01:23:01Z"},{"alias_kind":"arxiv_version","alias_value":"1601.02662v1","created_at":"2026-05-18T01:23:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02662","created_at":"2026-05-18T01:23:01Z"},{"alias_kind":"pith_short_12","alias_value":"62CWSLXNSZSA","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"62CWSLXNSZSAAIXJ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"62CWSLXN","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:62CWSLXNSZSAAIXJEU6OU2WFVY","target":"record","payload":{"canonical_record":{"source":{"id":"1601.02662","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2016-01-01T01:06:58Z","cross_cats_sorted":[],"title_canon_sha256":"60b33e39df331c1a1a31e91dc036f7494b8156baa39e204a504019cd6b724473","abstract_canon_sha256":"407e2703c84e35261228a7afe043ee6ac82121732957441e90f040a2d6b1a5db"},"schema_version":"1.0"},"canonical_sha256":"f685692eed96640022e9253cea6ac5ae2110b7cfc227ed265be38ce354245128","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:01.812688Z","signature_b64":"y/37VlD/RLMDzh1sds9q4UBws5s4L+LtgzvjbNr2wo+ev8cbFNtopSJsqT/Y7CHCApPTwZG7s0+TOowj6r7FCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f685692eed96640022e9253cea6ac5ae2110b7cfc227ed265be38ce354245128","last_reissued_at":"2026-05-18T01:23:01.811920Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:01.811920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.02662","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-18T01:23:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G6X8KqezQsM32w0Oj0vvOetFd9W8QH6QWxr98icn/LS71s0ftzmGBLRXCrxLq1aaXsv5vqDW/nAmGNnf+9RpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T15:19:07.932156Z"},"content_sha256":"918fb4b9d9e78fc1f9d167abb282fe94ef0af54e2b2c80a12a51fe0b58926b02","schema_version":"1.0","event_id":"sha256:918fb4b9d9e78fc1f9d167abb282fe94ef0af54e2b2c80a12a51fe0b58926b02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:62CWSLXNSZSAAIXJEU6OU2WFVY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Disjunctive and Conjunctive Set-Labelings of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Naduvath Sudev","submitted_at":"2016-01-01T01:06:58Z","abstract_excerpt":"Let $X$ be a non-empty set and $\\sP(X)$ be its power set. A set-valuation or a set-labeling of a given graph $G$ is an injective function $f:V(G) \\to \\sP(X)$ such that the induced function $f^{\\ast}:E(G) \\to \\sP(X)$ defined by $f^{\\ast} (uv) = f(u)\\ast f(v)$, where $\\ast$ is a binary operation on sets. A set-indexer of a graph $G$ is an injective set-valued function $f:V(G) \\to \\sP(X)$ such that the induced function $f^{\\ast}:E(G) \\to \\sP(X)$ is also injective. In this paper, two types of set-labelings, called conjunctive set-labeling and disjunctive set-labeling, of graphs are introduced and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02662","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-18T01:23:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lkogFxrpwREFDrvHh4sYEz1eRxEGzvkKE39bSk7UMVD9IYM4wnjR57zlC304MYaH6UtmUMSCJfmqs8tItwd6Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T15:19:07.932518Z"},"content_sha256":"b532569042de7ac9bb5001eb33efeee793bd352170d4ef5f1ca55a1cf6d2d5ea","schema_version":"1.0","event_id":"sha256:b532569042de7ac9bb5001eb33efeee793bd352170d4ef5f1ca55a1cf6d2d5ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/62CWSLXNSZSAAIXJEU6OU2WFVY/bundle.json","state_url":"https://pith.science/pith/62CWSLXNSZSAAIXJEU6OU2WFVY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/62CWSLXNSZSAAIXJEU6OU2WFVY/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-29T15:19:07Z","links":{"resolver":"https://pith.science/pith/62CWSLXNSZSAAIXJEU6OU2WFVY","bundle":"https://pith.science/pith/62CWSLXNSZSAAIXJEU6OU2WFVY/bundle.json","state":"https://pith.science/pith/62CWSLXNSZSAAIXJEU6OU2WFVY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/62CWSLXNSZSAAIXJEU6OU2WFVY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:62CWSLXNSZSAAIXJEU6OU2WFVY","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":"407e2703c84e35261228a7afe043ee6ac82121732957441e90f040a2d6b1a5db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2016-01-01T01:06:58Z","title_canon_sha256":"60b33e39df331c1a1a31e91dc036f7494b8156baa39e204a504019cd6b724473"},"schema_version":"1.0","source":{"id":"1601.02662","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.02662","created_at":"2026-05-18T01:23:01Z"},{"alias_kind":"arxiv_version","alias_value":"1601.02662v1","created_at":"2026-05-18T01:23:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02662","created_at":"2026-05-18T01:23:01Z"},{"alias_kind":"pith_short_12","alias_value":"62CWSLXNSZSA","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"62CWSLXNSZSAAIXJ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"62CWSLXN","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:b532569042de7ac9bb5001eb33efeee793bd352170d4ef5f1ca55a1cf6d2d5ea","target":"graph","created_at":"2026-05-18T01:23:01Z","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":"Let $X$ be a non-empty set and $\\sP(X)$ be its power set. A set-valuation or a set-labeling of a given graph $G$ is an injective function $f:V(G) \\to \\sP(X)$ such that the induced function $f^{\\ast}:E(G) \\to \\sP(X)$ defined by $f^{\\ast} (uv) = f(u)\\ast f(v)$, where $\\ast$ is a binary operation on sets. A set-indexer of a graph $G$ is an injective set-valued function $f:V(G) \\to \\sP(X)$ such that the induced function $f^{\\ast}:E(G) \\to \\sP(X)$ is also injective. In this paper, two types of set-labelings, called conjunctive set-labeling and disjunctive set-labeling, of graphs are introduced and ","authors_text":"Naduvath Sudev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2016-01-01T01:06:58Z","title":"On Disjunctive and Conjunctive Set-Labelings of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02662","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:918fb4b9d9e78fc1f9d167abb282fe94ef0af54e2b2c80a12a51fe0b58926b02","target":"record","created_at":"2026-05-18T01:23:01Z","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":"407e2703c84e35261228a7afe043ee6ac82121732957441e90f040a2d6b1a5db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2016-01-01T01:06:58Z","title_canon_sha256":"60b33e39df331c1a1a31e91dc036f7494b8156baa39e204a504019cd6b724473"},"schema_version":"1.0","source":{"id":"1601.02662","kind":"arxiv","version":1}},"canonical_sha256":"f685692eed96640022e9253cea6ac5ae2110b7cfc227ed265be38ce354245128","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f685692eed96640022e9253cea6ac5ae2110b7cfc227ed265be38ce354245128","first_computed_at":"2026-05-18T01:23:01.811920Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:01.811920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y/37VlD/RLMDzh1sds9q4UBws5s4L+LtgzvjbNr2wo+ev8cbFNtopSJsqT/Y7CHCApPTwZG7s0+TOowj6r7FCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:01.812688Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.02662","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:918fb4b9d9e78fc1f9d167abb282fe94ef0af54e2b2c80a12a51fe0b58926b02","sha256:b532569042de7ac9bb5001eb33efeee793bd352170d4ef5f1ca55a1cf6d2d5ea"],"state_sha256":"bc558a25363046f90f99a1ed3def08f9c0b52adc2863d0b5066b82d0c0497e6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aDxosu7WIaACvNy7pYNdnIVdse04APqhRYudIXun+WjbzdKZh3f7nh+W/xtjlALmAFf6blvm7kBRJ7Mp5PpKCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T15:19:07.934545Z","bundle_sha256":"838b9ebb36d5f58ec77f49ae79994370113f3c71ed8aa16b30ce1748e21b826e"}}