{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LSX6U53AIXMON3BYJ53M7PMFE7","short_pith_number":"pith:LSX6U53A","canonical_record":{"source":{"id":"1701.00190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-01-01T03:46:41Z","cross_cats_sorted":[],"title_canon_sha256":"0297cfc04affd639e90b99b0044637e27684e88dc3ba1da09e669d011902e0b9","abstract_canon_sha256":"92bf39f9bb9f93d8d3ed54cca2901c4bb9e3cea69df3e4bd815f6f217fb82b98"},"schema_version":"1.0"},"canonical_sha256":"5cafea776045d8e6ec384f76cfbd8527fdb3625b1930661ae873b34efd2c3230","source":{"kind":"arxiv","id":"1701.00190","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.00190","created_at":"2026-05-18T00:53:36Z"},{"alias_kind":"arxiv_version","alias_value":"1701.00190v1","created_at":"2026-05-18T00:53:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00190","created_at":"2026-05-18T00:53:36Z"},{"alias_kind":"pith_short_12","alias_value":"LSX6U53AIXMO","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LSX6U53AIXMON3BY","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LSX6U53A","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LSX6U53AIXMON3BYJ53M7PMFE7","target":"record","payload":{"canonical_record":{"source":{"id":"1701.00190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-01-01T03:46:41Z","cross_cats_sorted":[],"title_canon_sha256":"0297cfc04affd639e90b99b0044637e27684e88dc3ba1da09e669d011902e0b9","abstract_canon_sha256":"92bf39f9bb9f93d8d3ed54cca2901c4bb9e3cea69df3e4bd815f6f217fb82b98"},"schema_version":"1.0"},"canonical_sha256":"5cafea776045d8e6ec384f76cfbd8527fdb3625b1930661ae873b34efd2c3230","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:36.130802Z","signature_b64":"zWLL0eOU6osWsVBwHGnn9VjVfNws76M6YvuWXUdlUiq2v0yC0wh5kb0cduMTTohy+GXgzYf1/xrVEGL+ElbaDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cafea776045d8e6ec384f76cfbd8527fdb3625b1930661ae873b34efd2c3230","last_reissued_at":"2026-05-18T00:53:36.130233Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:36.130233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.00190","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-18T00:53:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Upnso0qsRIk47uF0rw/CH6rCvJ823TS9+KafpCbDu5awp/Uykn7Ge/eOMh2S9FJ2QlRq7/zy6E5IbNGHE5TjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T09:26:41.206676Z"},"content_sha256":"a3ce5780570b0906a806ea7af2cb8888d0e6fd92e24e2ae36d18b0340f3fd086","schema_version":"1.0","event_id":"sha256:a3ce5780570b0906a806ea7af2cb8888d0e6fd92e24e2ae36d18b0340f3fd086"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LSX6U53AIXMON3BYJ53M7PMFE7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Study on the Product Set-Labeling of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"N. K. Sudev","submitted_at":"2017-01-01T03:46:41Z","abstract_excerpt":"Let $X$ be a non-empty ground set and $\\mathscr{P}(X)$ be its power set. A set-labeling (or a set-valuation) of a graph $G$ is an injective set-valued function $f:V(G)\\to \\mathscr{P}(X)$ such that the induced function $f^*:E(G) \\to \\mathscr{P}(X)$ is defined by $f^*(uv)=f(u)\\ast f(v)$, where $f(u)\\ast f(v)$ is a binary operation of the sets $f(u)$ and $f(v)$. A graph which admits a set-labeling is known to be a set-labeled graph. A set-labeling $f$ of a graph $G$ is said to be a set-indexer of $G$ if the associated function $f^*$ is also injective. In this paper, we introduce a new notion name"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00190","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-18T00:53:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9EB9fm7CvG2WDc0s4YnmLdevNbSZRAZVY/YxsEq28ldgVLf9e8QxA1kn/0Ds/vexviX7oWPOlgqp3UwuAMFrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T09:26:41.207014Z"},"content_sha256":"152c7d67fefb5316ef41f0b801d8cabfbf753c0efee1dd46272c0bccb59b4337","schema_version":"1.0","event_id":"sha256:152c7d67fefb5316ef41f0b801d8cabfbf753c0efee1dd46272c0bccb59b4337"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LSX6U53AIXMON3BYJ53M7PMFE7/bundle.json","state_url":"https://pith.science/pith/LSX6U53AIXMON3BYJ53M7PMFE7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LSX6U53AIXMON3BYJ53M7PMFE7/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-29T09:26:41Z","links":{"resolver":"https://pith.science/pith/LSX6U53AIXMON3BYJ53M7PMFE7","bundle":"https://pith.science/pith/LSX6U53AIXMON3BYJ53M7PMFE7/bundle.json","state":"https://pith.science/pith/LSX6U53AIXMON3BYJ53M7PMFE7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LSX6U53AIXMON3BYJ53M7PMFE7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LSX6U53AIXMON3BYJ53M7PMFE7","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":"92bf39f9bb9f93d8d3ed54cca2901c4bb9e3cea69df3e4bd815f6f217fb82b98","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-01-01T03:46:41Z","title_canon_sha256":"0297cfc04affd639e90b99b0044637e27684e88dc3ba1da09e669d011902e0b9"},"schema_version":"1.0","source":{"id":"1701.00190","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.00190","created_at":"2026-05-18T00:53:36Z"},{"alias_kind":"arxiv_version","alias_value":"1701.00190v1","created_at":"2026-05-18T00:53:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00190","created_at":"2026-05-18T00:53:36Z"},{"alias_kind":"pith_short_12","alias_value":"LSX6U53AIXMO","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LSX6U53AIXMON3BY","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LSX6U53A","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:152c7d67fefb5316ef41f0b801d8cabfbf753c0efee1dd46272c0bccb59b4337","target":"graph","created_at":"2026-05-18T00:53:36Z","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 ground set and $\\mathscr{P}(X)$ be its power set. A set-labeling (or a set-valuation) of a graph $G$ is an injective set-valued function $f:V(G)\\to \\mathscr{P}(X)$ such that the induced function $f^*:E(G) \\to \\mathscr{P}(X)$ is defined by $f^*(uv)=f(u)\\ast f(v)$, where $f(u)\\ast f(v)$ is a binary operation of the sets $f(u)$ and $f(v)$. A graph which admits a set-labeling is known to be a set-labeled graph. A set-labeling $f$ of a graph $G$ is said to be a set-indexer of $G$ if the associated function $f^*$ is also injective. In this paper, we introduce a new notion name","authors_text":"N. K. Sudev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-01-01T03:46:41Z","title":"A Study on the Product Set-Labeling of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00190","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:a3ce5780570b0906a806ea7af2cb8888d0e6fd92e24e2ae36d18b0340f3fd086","target":"record","created_at":"2026-05-18T00:53:36Z","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":"92bf39f9bb9f93d8d3ed54cca2901c4bb9e3cea69df3e4bd815f6f217fb82b98","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-01-01T03:46:41Z","title_canon_sha256":"0297cfc04affd639e90b99b0044637e27684e88dc3ba1da09e669d011902e0b9"},"schema_version":"1.0","source":{"id":"1701.00190","kind":"arxiv","version":1}},"canonical_sha256":"5cafea776045d8e6ec384f76cfbd8527fdb3625b1930661ae873b34efd2c3230","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5cafea776045d8e6ec384f76cfbd8527fdb3625b1930661ae873b34efd2c3230","first_computed_at":"2026-05-18T00:53:36.130233Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:36.130233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zWLL0eOU6osWsVBwHGnn9VjVfNws76M6YvuWXUdlUiq2v0yC0wh5kb0cduMTTohy+GXgzYf1/xrVEGL+ElbaDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:36.130802Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.00190","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3ce5780570b0906a806ea7af2cb8888d0e6fd92e24e2ae36d18b0340f3fd086","sha256:152c7d67fefb5316ef41f0b801d8cabfbf753c0efee1dd46272c0bccb59b4337"],"state_sha256":"06231382cd69be02af82bc34a87a34b9dc0a2ff2793434d4bcb38f197b3f818f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N6+7bq2BoJcZO0bCiPUri8CMh6wyAojxxf6K21rUjxE1NKikboqENxdp9zkI8+HYA+Krs/4t4MqweSVV87PJCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T09:26:41.208906Z","bundle_sha256":"52fd71ea0b9d80b7faec0926fcb1c2ca47b983a3c790940b719b4e926cdae5b7"}}