{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FCHWGBSCTBSSMJHVBWT7EEFCBR","short_pith_number":"pith:FCHWGBSC","schema_version":"1.0","canonical_sha256":"288f63064298652624f50da7f210a20c4241c429e72c6e3023d5fcafa5220a37","source":{"kind":"arxiv","id":"1504.07132","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.07132","created_at":"2026-05-18T02:17:43.626419+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.07132v1","created_at":"2026-05-18T02:17:43.626419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07132","created_at":"2026-05-18T02:17:43.626419+00:00"},{"alias_kind":"pith_short_12","alias_value":"FCHWGBSCTBSS","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FCHWGBSCTBSSMJHV","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FCHWGBSC","created_at":"2026-05-18T12:29:19.899920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FCHWGBSCTBSSMJHVBWT7EEFCBR","json":"https://pith.science/pith/FCHWGBSCTBSSMJHVBWT7EEFCBR.json","graph_json":"https://pith.science/api/pith-number/FCHWGBSCTBSSMJHVBWT7EEFCBR/graph.json","events_json":"https://pith.science/api/pith-number/FCHWGBSCTBSSMJHVBWT7EEFCBR/events.json","paper":"https://pith.science/paper/FCHWGBSC"},"agent_actions":{"view_html":"https://pith.science/pith/FCHWGBSCTBSSMJHVBWT7EEFCBR","download_json":"https://pith.science/pith/FCHWGBSCTBSSMJHVBWT7EEFCBR.json","view_paper":"https://pith.science/paper/FCHWGBSC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.07132&json=true","fetch_graph":"https://pith.science/api/pith-number/FCHWGBSCTBSSMJHVBWT7EEFCBR/graph.json","fetch_events":"https://pith.science/api/pith-number/FCHWGBSCTBSSMJHVBWT7EEFCBR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FCHWGBSCTBSSMJHVBWT7EEFCBR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FCHWGBSCTBSSMJHVBWT7EEFCBR/action/storage_attestation","attest_author":"https://pith.science/pith/FCHWGBSCTBSSMJHVBWT7EEFCBR/action/author_attestation","sign_citation":"https://pith.science/pith/FCHWGBSCTBSSMJHVBWT7EEFCBR/action/citation_signature","submit_replication":"https://pith.science/pith/FCHWGBSCTBSSMJHVBWT7EEFCBR/action/replication_record"}},"created_at":"2026-05-18T02:17:43.626419+00:00","updated_at":"2026-05-18T02:17:43.626419+00:00"}