{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:J7DJ2EGOFD2ZCDGWF77JTDEGUB","short_pith_number":"pith:J7DJ2EGO","canonical_record":{"source":{"id":"1407.5028","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-06T16:28:47Z","cross_cats_sorted":[],"title_canon_sha256":"b9bfad009ca937ec1c67d438b2e50774d24834c9b6bd2688095b796464e82ef2","abstract_canon_sha256":"fbb3d6b5c242680788b4c9f035facfe4975a92c3e28a4a56c231c0f9705eebd1"},"schema_version":"1.0"},"canonical_sha256":"4fc69d10ce28f5910cd62ffe998c86a051c78fb15b26370d562abb2a75d1169b","source":{"kind":"arxiv","id":"1407.5028","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5028","created_at":"2026-05-18T02:35:47Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5028v2","created_at":"2026-05-18T02:35:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5028","created_at":"2026-05-18T02:35:47Z"},{"alias_kind":"pith_short_12","alias_value":"J7DJ2EGOFD2Z","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"J7DJ2EGOFD2ZCDGW","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"J7DJ2EGO","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:J7DJ2EGOFD2ZCDGWF77JTDEGUB","target":"record","payload":{"canonical_record":{"source":{"id":"1407.5028","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-06T16:28:47Z","cross_cats_sorted":[],"title_canon_sha256":"b9bfad009ca937ec1c67d438b2e50774d24834c9b6bd2688095b796464e82ef2","abstract_canon_sha256":"fbb3d6b5c242680788b4c9f035facfe4975a92c3e28a4a56c231c0f9705eebd1"},"schema_version":"1.0"},"canonical_sha256":"4fc69d10ce28f5910cd62ffe998c86a051c78fb15b26370d562abb2a75d1169b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:35:47.123586Z","signature_b64":"o3MG92S1TsxxXxKy91SvOsg33DtRPamfj+AYLavKzCFrtYqBBc1kX9Md4aLi0pB2SC6zYOxuWYHPQgEFHirKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fc69d10ce28f5910cd62ffe998c86a051c78fb15b26370d562abb2a75d1169b","last_reissued_at":"2026-05-18T02:35:47.123169Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:35:47.123169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.5028","source_version":2,"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:35:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ta80Q7zTCEJkqFZUoRWw6FgyFu6eblJhAJOi7gr9uiEyFGomLc6i/XORB4C5H/f50d/C91v8fBHfbSbFOidmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T11:40:45.564540Z"},"content_sha256":"88dbffeb30c6ea3a3983c74a812102194e4a2bfa8eb51986ff6a952ee9c9a4a7","schema_version":"1.0","event_id":"sha256:88dbffeb30c6ea3a3983c74a812102194e4a2bfa8eb51986ff6a952ee9c9a4a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:J7DJ2EGOFD2ZCDGWF77JTDEGUB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Integer Additive set-Sequential Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"K. A. Germina, N. K. Sudev","submitted_at":"2014-06-06T16:28:47Z","abstract_excerpt":"A set-labeling of a graph $G$ is an injective function $f:V(G)\\to \\mathcal{P}(X)$, where $X$ is a finite set of non-negative integers and a set-indexer of $G$ is a set-labeling such that the induced function $f^{\\oplus}:E(G)\\rightarrow \\mathcal{P}(X)-\\{\\emptyset\\}$ defined by $f^{\\oplus}(uv) = f(u){\\oplus}f(v)$ for every $uv{\\in} E(G)$ is also injective. A set-indexer $f:V(G)\\to \\mathcal{P}(X)$ is called a set-sequential labeling of $G$ if $f^{\\oplus}(V(G)\\cup E(G))=\\mathcal{P}(X)-\\{\\emptyset\\}$. A graph $G$ which admits a set-sequential labeling is called a set-sequential graph. An integer ad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5028","kind":"arxiv","version":2},"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:35:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GKfrZbbwnaD8g9rEjC4Q+J5maGepBaWvsmdqtt2CgPqxJK7WSB9BsVJ/uoAHJ0/x/+SixIGv3+ZcBGp86xA0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T11:40:45.564884Z"},"content_sha256":"4a81372228f0602bdec3b19e6dd8321a4374ddf54f113a76e0c17421a00d0936","schema_version":"1.0","event_id":"sha256:4a81372228f0602bdec3b19e6dd8321a4374ddf54f113a76e0c17421a00d0936"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J7DJ2EGOFD2ZCDGWF77JTDEGUB/bundle.json","state_url":"https://pith.science/pith/J7DJ2EGOFD2ZCDGWF77JTDEGUB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J7DJ2EGOFD2ZCDGWF77JTDEGUB/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-29T11:40:45Z","links":{"resolver":"https://pith.science/pith/J7DJ2EGOFD2ZCDGWF77JTDEGUB","bundle":"https://pith.science/pith/J7DJ2EGOFD2ZCDGWF77JTDEGUB/bundle.json","state":"https://pith.science/pith/J7DJ2EGOFD2ZCDGWF77JTDEGUB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J7DJ2EGOFD2ZCDGWF77JTDEGUB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:J7DJ2EGOFD2ZCDGWF77JTDEGUB","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":"fbb3d6b5c242680788b4c9f035facfe4975a92c3e28a4a56c231c0f9705eebd1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-06T16:28:47Z","title_canon_sha256":"b9bfad009ca937ec1c67d438b2e50774d24834c9b6bd2688095b796464e82ef2"},"schema_version":"1.0","source":{"id":"1407.5028","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5028","created_at":"2026-05-18T02:35:47Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5028v2","created_at":"2026-05-18T02:35:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5028","created_at":"2026-05-18T02:35:47Z"},{"alias_kind":"pith_short_12","alias_value":"J7DJ2EGOFD2Z","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"J7DJ2EGOFD2ZCDGW","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"J7DJ2EGO","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:4a81372228f0602bdec3b19e6dd8321a4374ddf54f113a76e0c17421a00d0936","target":"graph","created_at":"2026-05-18T02:35:47Z","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 set-labeling of a graph $G$ is an injective function $f:V(G)\\to \\mathcal{P}(X)$, where $X$ is a finite set of non-negative integers and a set-indexer of $G$ is a set-labeling such that the induced function $f^{\\oplus}:E(G)\\rightarrow \\mathcal{P}(X)-\\{\\emptyset\\}$ defined by $f^{\\oplus}(uv) = f(u){\\oplus}f(v)$ for every $uv{\\in} E(G)$ is also injective. A set-indexer $f:V(G)\\to \\mathcal{P}(X)$ is called a set-sequential labeling of $G$ if $f^{\\oplus}(V(G)\\cup E(G))=\\mathcal{P}(X)-\\{\\emptyset\\}$. A graph $G$ which admits a set-sequential labeling is called a set-sequential graph. An integer ad","authors_text":"K. A. Germina, N. K. Sudev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-06T16:28:47Z","title":"On Integer Additive set-Sequential Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5028","kind":"arxiv","version":2},"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:88dbffeb30c6ea3a3983c74a812102194e4a2bfa8eb51986ff6a952ee9c9a4a7","target":"record","created_at":"2026-05-18T02:35:47Z","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":"fbb3d6b5c242680788b4c9f035facfe4975a92c3e28a4a56c231c0f9705eebd1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-06T16:28:47Z","title_canon_sha256":"b9bfad009ca937ec1c67d438b2e50774d24834c9b6bd2688095b796464e82ef2"},"schema_version":"1.0","source":{"id":"1407.5028","kind":"arxiv","version":2}},"canonical_sha256":"4fc69d10ce28f5910cd62ffe998c86a051c78fb15b26370d562abb2a75d1169b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4fc69d10ce28f5910cd62ffe998c86a051c78fb15b26370d562abb2a75d1169b","first_computed_at":"2026-05-18T02:35:47.123169Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:35:47.123169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o3MG92S1TsxxXxKy91SvOsg33DtRPamfj+AYLavKzCFrtYqBBc1kX9Md4aLi0pB2SC6zYOxuWYHPQgEFHirKDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:35:47.123586Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.5028","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88dbffeb30c6ea3a3983c74a812102194e4a2bfa8eb51986ff6a952ee9c9a4a7","sha256:4a81372228f0602bdec3b19e6dd8321a4374ddf54f113a76e0c17421a00d0936"],"state_sha256":"f8a6e07478c59b3cc797a087d5d971ee2a804c3d175b3fa046470a839970c14e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mD8Vq7lnAnnY5ot3e/Qa7ICh0SK8HLCJQO/00r4dWpbJQV8C8XIrRUt2Qy2FtqnWtlCMPN30rqthygl4gx2YCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T11:40:45.566828Z","bundle_sha256":"852b5dcc9d1491fee275985b8e487586f1d803dfef64c59219b93b0445f919fb"}}