{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FCHWGBSCTBSSMJHVBWT7EEFCBR","short_pith_number":"pith:FCHWGBSC","canonical_record":{"source":{"id":"1504.07132","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2015-04-23T10:20:08Z","cross_cats_sorted":[],"title_canon_sha256":"c58c53714f3811178ba710a8689cf5166da71abe503181980136e8c97ab12997","abstract_canon_sha256":"dead6c23033413f4c959d8be928a9063a16dbc240e351406584857727f721729"},"schema_version":"1.0"},"canonical_sha256":"288f63064298652624f50da7f210a20c4241c429e72c6e3023d5fcafa5220a37","source":{"kind":"arxiv","id":"1504.07132","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.07132","created_at":"2026-05-18T02:17:43Z"},{"alias_kind":"arxiv_version","alias_value":"1504.07132v1","created_at":"2026-05-18T02:17:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07132","created_at":"2026-05-18T02:17:43Z"},{"alias_kind":"pith_short_12","alias_value":"FCHWGBSCTBSS","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FCHWGBSCTBSSMJHV","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FCHWGBSC","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FCHWGBSCTBSSMJHVBWT7EEFCBR","target":"record","payload":{"canonical_record":{"source":{"id":"1504.07132","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2015-04-23T10:20:08Z","cross_cats_sorted":[],"title_canon_sha256":"c58c53714f3811178ba710a8689cf5166da71abe503181980136e8c97ab12997","abstract_canon_sha256":"dead6c23033413f4c959d8be928a9063a16dbc240e351406584857727f721729"},"schema_version":"1.0"},"canonical_sha256":"288f63064298652624f50da7f210a20c4241c429e72c6e3023d5fcafa5220a37","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:43.626734Z","signature_b64":"sVxOBd672dkbEK4PkUEnkDM3RkkefGi7ECndnOhnQVatDwdnUuHW3bvCS0Ce8yeKWycd41FAmTeyFJjAebQ2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"288f63064298652624f50da7f210a20c4241c429e72c6e3023d5fcafa5220a37","last_reissued_at":"2026-05-18T02:17:43.626358Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:43.626358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.07132","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:17:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7cWFM3UDUUop8WCRs7cthCHlcyBkvNR4YY20ZiH7SpFxG5CSloXR84rvAEjAb3Oy2sWlF3fFXmYFoOLA3qj0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:22:58.735764Z"},"content_sha256":"a17dcbade943b3fc41d1a2d57877ed22cf44676d6902629bbcb76a978ae603bd","schema_version":"1.0","event_id":"sha256:a17dcbade943b3fc41d1a2d57877ed22cf44676d6902629bbcb76a978ae603bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FCHWGBSCTBSSMJHVBWT7EEFCBR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strong Integer Additive Set-valued Graphs: A Creative Review","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"K. A. Germina, K. P. Chithra, N. K. Sudev","submitted_at":"2015-04-23T10:20:08Z","abstract_excerpt":"For a non-empty ground set $X$, finite or infinite, the {\\em set-valuation} or {\\em set-labeling} of a given graph $G$ is an injective function $f:V(G) \\to \\mathcal{P}(X)$, where $\\mathcal{P}(X)$ is the power set of the set $X$. A set-indexer of a graph $G$ is an injective set-valued function $f:V(G) \\to \\mathcal{P}(X)$ such that the function $f^{\\ast}:E(G)\\to \\mathcal{P}(X)-\\{\\emptyset\\}$ defined by $f^{\\ast}(uv) = f(u){\\ast} f(v)$ for every $uv{\\in} E(G)$ is also injective., where $\\ast$ is a binary operation on sets. An integer additive set-indexer is defined as an injective function $f:V(G"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07132","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:17:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n0wUU0hC9lAfoe4FRA71gkgmlDjNwzqVlyTxx8ZsskCzQ0YeZFsNX0QEPM5iipgeFrASE8Xsws5R9Y1WzRJ3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:22:58.736445Z"},"content_sha256":"ac0ea8c4d9e0442faf257ad9f385cb1baa43a3e2cb9994adb5f3339de3a1f3f1","schema_version":"1.0","event_id":"sha256:ac0ea8c4d9e0442faf257ad9f385cb1baa43a3e2cb9994adb5f3339de3a1f3f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FCHWGBSCTBSSMJHVBWT7EEFCBR/bundle.json","state_url":"https://pith.science/pith/FCHWGBSCTBSSMJHVBWT7EEFCBR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FCHWGBSCTBSSMJHVBWT7EEFCBR/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-11T21:22:58Z","links":{"resolver":"https://pith.science/pith/FCHWGBSCTBSSMJHVBWT7EEFCBR","bundle":"https://pith.science/pith/FCHWGBSCTBSSMJHVBWT7EEFCBR/bundle.json","state":"https://pith.science/pith/FCHWGBSCTBSSMJHVBWT7EEFCBR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FCHWGBSCTBSSMJHVBWT7EEFCBR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FCHWGBSCTBSSMJHVBWT7EEFCBR","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":"dead6c23033413f4c959d8be928a9063a16dbc240e351406584857727f721729","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2015-04-23T10:20:08Z","title_canon_sha256":"c58c53714f3811178ba710a8689cf5166da71abe503181980136e8c97ab12997"},"schema_version":"1.0","source":{"id":"1504.07132","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.07132","created_at":"2026-05-18T02:17:43Z"},{"alias_kind":"arxiv_version","alias_value":"1504.07132v1","created_at":"2026-05-18T02:17:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07132","created_at":"2026-05-18T02:17:43Z"},{"alias_kind":"pith_short_12","alias_value":"FCHWGBSCTBSS","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FCHWGBSCTBSSMJHV","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FCHWGBSC","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:ac0ea8c4d9e0442faf257ad9f385cb1baa43a3e2cb9994adb5f3339de3a1f3f1","target":"graph","created_at":"2026-05-18T02:17:43Z","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":"For a non-empty ground set $X$, finite or infinite, the {\\em set-valuation} or {\\em set-labeling} of a given graph $G$ is an injective function $f:V(G) \\to \\mathcal{P}(X)$, where $\\mathcal{P}(X)$ is the power set of the set $X$. A set-indexer of a graph $G$ is an injective set-valued function $f:V(G) \\to \\mathcal{P}(X)$ such that the function $f^{\\ast}:E(G)\\to \\mathcal{P}(X)-\\{\\emptyset\\}$ defined by $f^{\\ast}(uv) = f(u){\\ast} f(v)$ for every $uv{\\in} E(G)$ is also injective., where $\\ast$ is a binary operation on sets. An integer additive set-indexer is defined as an injective function $f:V(G","authors_text":"K. A. Germina, 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-23T10:20:08Z","title":"Strong Integer Additive Set-valued Graphs: A Creative Review"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07132","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:a17dcbade943b3fc41d1a2d57877ed22cf44676d6902629bbcb76a978ae603bd","target":"record","created_at":"2026-05-18T02:17:43Z","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":"dead6c23033413f4c959d8be928a9063a16dbc240e351406584857727f721729","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2015-04-23T10:20:08Z","title_canon_sha256":"c58c53714f3811178ba710a8689cf5166da71abe503181980136e8c97ab12997"},"schema_version":"1.0","source":{"id":"1504.07132","kind":"arxiv","version":1}},"canonical_sha256":"288f63064298652624f50da7f210a20c4241c429e72c6e3023d5fcafa5220a37","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"288f63064298652624f50da7f210a20c4241c429e72c6e3023d5fcafa5220a37","first_computed_at":"2026-05-18T02:17:43.626358Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:43.626358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sVxOBd672dkbEK4PkUEnkDM3RkkefGi7ECndnOhnQVatDwdnUuHW3bvCS0Ce8yeKWycd41FAmTeyFJjAebQ2BA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:43.626734Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.07132","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a17dcbade943b3fc41d1a2d57877ed22cf44676d6902629bbcb76a978ae603bd","sha256:ac0ea8c4d9e0442faf257ad9f385cb1baa43a3e2cb9994adb5f3339de3a1f3f1"],"state_sha256":"427df20df44fae17ecec632671a75dd5b91dec99a38662039c7cd739208f8ba9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YkNJ3N8kaKEfbz+bceh2xgnX/FdZvceP8pqwS5MmOptww32y0bxI6WATl81FEn+dQNPAOon3ATf0JvVi3qtPCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T21:22:58.740022Z","bundle_sha256":"7ee8f7851a0d02ec53cadcb3ac32eb6122a24ad0f262aea1c4efdcb700eda908"}}