{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GVR2CTZ32IXFGBLBWZNRTVWZBN","short_pith_number":"pith:GVR2CTZ3","schema_version":"1.0","canonical_sha256":"3563a14f3bd22e530561b65b19d6d90b6b394092525d8d89a5778f9dff05d19c","source":{"kind":"arxiv","id":"1407.4676","version":1},"attestation_state":"computed","paper":{"title":"A Study on Prime Arithmetic Integer Additive Set-Indexers of 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-07-09T01:57:10Z","abstract_excerpt":"Let $\\mathbb{N}_0$ be the set of all non-negative integers and $\\mathcal{P}(\\mathbb{N}_0)$ be its power set. An integer additive set-indexer (IASI) is defined as an injective function $f:V(G)\\to \\mathcal{P}(\\mathbb{N}_0)$ such that the induced function $f^+:E(G) \\to \\mathcal{P}(\\mathbb{N}_0)$ defined by $f^+(uv) = f(u)+ f(v)$ is also injective, where $\\mathbb{N}_0$ is the set of all non-negative integers. A graph $G$ which admits an IASI is called an IASI graph. An IASI of a graph $G$ is said to be an arithmetic IASI if the elements of the set-labels of all vertices and edges of $G$ are in ari"},"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":"1407.4676","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-09T01:57:10Z","cross_cats_sorted":[],"title_canon_sha256":"448d3e09734a0c5b3610c88f9b34f1d062f07a7d5be1d92d0c913b40403d8810","abstract_canon_sha256":"e78c451bb600fb08fc51cfc5ed32ed49afebfc9efadc518f6422ca381691f6ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:14.994568Z","signature_b64":"mS+6B9Ol4GqM5YNEmlmUJPcBIbAZuw2D3w9nbQvICeqP0HyiGqaffqPpmrrfpOSLSEWoxWaR/GmSaL/JkHgFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3563a14f3bd22e530561b65b19d6d90b6b394092525d8d89a5778f9dff05d19c","last_reissued_at":"2026-05-18T02:47:14.993908Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:14.993908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Study on Prime Arithmetic Integer Additive Set-Indexers of 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-07-09T01:57:10Z","abstract_excerpt":"Let $\\mathbb{N}_0$ be the set of all non-negative integers and $\\mathcal{P}(\\mathbb{N}_0)$ be its power set. An integer additive set-indexer (IASI) is defined as an injective function $f:V(G)\\to \\mathcal{P}(\\mathbb{N}_0)$ such that the induced function $f^+:E(G) \\to \\mathcal{P}(\\mathbb{N}_0)$ defined by $f^+(uv) = f(u)+ f(v)$ is also injective, where $\\mathbb{N}_0$ is the set of all non-negative integers. A graph $G$ which admits an IASI is called an IASI graph. An IASI of a graph $G$ is said to be an arithmetic IASI if the elements of the set-labels of all vertices and edges of $G$ are in ari"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4676","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":"1407.4676","created_at":"2026-05-18T02:47:14.994022+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.4676v1","created_at":"2026-05-18T02:47:14.994022+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4676","created_at":"2026-05-18T02:47:14.994022+00:00"},{"alias_kind":"pith_short_12","alias_value":"GVR2CTZ32IXF","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GVR2CTZ32IXFGBLB","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GVR2CTZ3","created_at":"2026-05-18T12:28:30.664211+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/GVR2CTZ32IXFGBLBWZNRTVWZBN","json":"https://pith.science/pith/GVR2CTZ32IXFGBLBWZNRTVWZBN.json","graph_json":"https://pith.science/api/pith-number/GVR2CTZ32IXFGBLBWZNRTVWZBN/graph.json","events_json":"https://pith.science/api/pith-number/GVR2CTZ32IXFGBLBWZNRTVWZBN/events.json","paper":"https://pith.science/paper/GVR2CTZ3"},"agent_actions":{"view_html":"https://pith.science/pith/GVR2CTZ32IXFGBLBWZNRTVWZBN","download_json":"https://pith.science/pith/GVR2CTZ32IXFGBLBWZNRTVWZBN.json","view_paper":"https://pith.science/paper/GVR2CTZ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.4676&json=true","fetch_graph":"https://pith.science/api/pith-number/GVR2CTZ32IXFGBLBWZNRTVWZBN/graph.json","fetch_events":"https://pith.science/api/pith-number/GVR2CTZ32IXFGBLBWZNRTVWZBN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GVR2CTZ32IXFGBLBWZNRTVWZBN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GVR2CTZ32IXFGBLBWZNRTVWZBN/action/storage_attestation","attest_author":"https://pith.science/pith/GVR2CTZ32IXFGBLBWZNRTVWZBN/action/author_attestation","sign_citation":"https://pith.science/pith/GVR2CTZ32IXFGBLBWZNRTVWZBN/action/citation_signature","submit_replication":"https://pith.science/pith/GVR2CTZ32IXFGBLBWZNRTVWZBN/action/replication_record"}},"created_at":"2026-05-18T02:47:14.994022+00:00","updated_at":"2026-05-18T02:47:14.994022+00:00"}