{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WW6S5WXGP6OTOUDX6BRLFJHYY3","short_pith_number":"pith:WW6S5WXG","schema_version":"1.0","canonical_sha256":"b5bd2edae67f9d375077f062b2a4f8c6e556ceb8187f8a729c2ee6eb17877244","source":{"kind":"arxiv","id":"1405.6617","version":3},"attestation_state":"computed","paper":{"title":"On Certain 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-05-20T19:26:59Z","abstract_excerpt":"Let $\\mathbb{N}_0$ denote the set of all non-negative integers and $\\mathcal{P}(\\mathbb{N}_0)$ be its power set. An integer additive set-indexer (IASI) of a graph $G$ is 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$ a"},"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":"1405.6617","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-20T19:26:59Z","cross_cats_sorted":[],"title_canon_sha256":"b9f2ebd800ef17449d4c1662e72a9773e5379c5a9166decd7c7fa37082ac1978","abstract_canon_sha256":"9ab42804d7117c57a7f94e029402791c11da78e69e5c715f14b71a6be4e3390d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:46:14.178883Z","signature_b64":"pcx7fVueJOJ97MaMb2tKDHxzubzekE5LtcGgRIqA9WshLDoxX+P3oN4jv45rpsNwVIYiAgQY+qOIyk1eHtZlBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5bd2edae67f9d375077f062b2a4f8c6e556ceb8187f8a729c2ee6eb17877244","last_reissued_at":"2026-05-18T01:46:14.178157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:46:14.178157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Certain 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-05-20T19:26:59Z","abstract_excerpt":"Let $\\mathbb{N}_0$ denote the set of all non-negative integers and $\\mathcal{P}(\\mathbb{N}_0)$ be its power set. An integer additive set-indexer (IASI) of a graph $G$ is 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$ a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6617","kind":"arxiv","version":3},"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":"1405.6617","created_at":"2026-05-18T01:46:14.178288+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.6617v3","created_at":"2026-05-18T01:46:14.178288+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6617","created_at":"2026-05-18T01:46:14.178288+00:00"},{"alias_kind":"pith_short_12","alias_value":"WW6S5WXGP6OT","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WW6S5WXGP6OTOUDX","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WW6S5WXG","created_at":"2026-05-18T12:28:54.890064+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/WW6S5WXGP6OTOUDX6BRLFJHYY3","json":"https://pith.science/pith/WW6S5WXGP6OTOUDX6BRLFJHYY3.json","graph_json":"https://pith.science/api/pith-number/WW6S5WXGP6OTOUDX6BRLFJHYY3/graph.json","events_json":"https://pith.science/api/pith-number/WW6S5WXGP6OTOUDX6BRLFJHYY3/events.json","paper":"https://pith.science/paper/WW6S5WXG"},"agent_actions":{"view_html":"https://pith.science/pith/WW6S5WXGP6OTOUDX6BRLFJHYY3","download_json":"https://pith.science/pith/WW6S5WXGP6OTOUDX6BRLFJHYY3.json","view_paper":"https://pith.science/paper/WW6S5WXG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.6617&json=true","fetch_graph":"https://pith.science/api/pith-number/WW6S5WXGP6OTOUDX6BRLFJHYY3/graph.json","fetch_events":"https://pith.science/api/pith-number/WW6S5WXGP6OTOUDX6BRLFJHYY3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WW6S5WXGP6OTOUDX6BRLFJHYY3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WW6S5WXGP6OTOUDX6BRLFJHYY3/action/storage_attestation","attest_author":"https://pith.science/pith/WW6S5WXGP6OTOUDX6BRLFJHYY3/action/author_attestation","sign_citation":"https://pith.science/pith/WW6S5WXGP6OTOUDX6BRLFJHYY3/action/citation_signature","submit_replication":"https://pith.science/pith/WW6S5WXGP6OTOUDX6BRLFJHYY3/action/replication_record"}},"created_at":"2026-05-18T01:46:14.178288+00:00","updated_at":"2026-05-18T01:46:14.178288+00:00"}