{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2X6VEIFFP22BIH32L3ETR5LXCK","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":"52b175f30bc7ec25b940e5148d4aa95e93de68a0fa6f9f6f748333d6416805cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-23T15:57:41Z","title_canon_sha256":"a58ec4a45f1cee198a4edc350a4fae6ec6eedad9bb85e679e9b6955535ffa46b"},"schema_version":"1.0","source":{"id":"1310.6266","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6266","created_at":"2026-05-18T02:39:25Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6266v3","created_at":"2026-05-18T02:39:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6266","created_at":"2026-05-18T02:39:25Z"},{"alias_kind":"pith_short_12","alias_value":"2X6VEIFFP22B","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2X6VEIFFP22BIH32","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2X6VEIFF","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:acf011066d623469709d7eae6a6bdc54e7e1dbaf8c41bed4d4674941b26cd014","target":"graph","created_at":"2026-05-18T02:39:25Z","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 $\\mathbb{N}_0$ be the set of all non-negative integers. An integer additive set-indexer of a graph $G$ is an injective function $f:V(G)\\to 2^{\\mathbb{N}_0}$ such that the induced function $g_f:E(G) \\rightarrow 2^{\\mathbb{N}_0}$ defined by $f^+(uv) = f(u)+ f(v)$ is also injective. An IASI is said to be {\\em $k$-uniform} if $|f^+(e)| = k$ for all $e\\in E(G)$. In this paper, we introduce the notions of strong integer additive set-indexers and initiate a study of the graphs which admit strong integer additive set-indexers.","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":"2013-10-23T15:57:41Z","title":"Some New Results on Strong Integer Additive Set-Indexers of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6266","kind":"arxiv","version":3},"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:1a57506c35b554bdaa3d72ebecd393b86e1639d26c35f0bc23696a8ccb884b76","target":"record","created_at":"2026-05-18T02:39:25Z","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":"52b175f30bc7ec25b940e5148d4aa95e93de68a0fa6f9f6f748333d6416805cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-23T15:57:41Z","title_canon_sha256":"a58ec4a45f1cee198a4edc350a4fae6ec6eedad9bb85e679e9b6955535ffa46b"},"schema_version":"1.0","source":{"id":"1310.6266","kind":"arxiv","version":3}},"canonical_sha256":"d5fd5220a57eb4141f7a5ec938f577128e90d29cd4829df68000ea97e93a621c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5fd5220a57eb4141f7a5ec938f577128e90d29cd4829df68000ea97e93a621c","first_computed_at":"2026-05-18T02:39:25.652551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:25.652551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J8SLQKfoaoI+i5L7fGgbe2jWc7UjecrXhZrMPgEMBu3szQ/5o/OADaMfGvsKdlzgXz5UYaJYJxaCqsvhA2wJCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:25.653090Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.6266","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a57506c35b554bdaa3d72ebecd393b86e1639d26c35f0bc23696a8ccb884b76","sha256:acf011066d623469709d7eae6a6bdc54e7e1dbaf8c41bed4d4674941b26cd014"],"state_sha256":"2505bae4fb0dbc2ac1535de2ffbab32fb14fe423b72c69aa9095a380e53028f5"}