{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7A7PONQWIIGFQAPOLASNTISAEG","short_pith_number":"pith:7A7PONQW","schema_version":"1.0","canonical_sha256":"f83ef73616420c5801ee5824d9a24021aa5c7ee140494f502f76a3b237b1c0ba","source":{"kind":"arxiv","id":"1312.7674","version":5},"attestation_state":"computed","paper":{"title":"A Study on 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":"2013-12-30T10:50:12Z","abstract_excerpt":"A set-indexer of a graph $G$ is an injective set-valued function $f:V(G) \\rightarrow2^{X}$ such that the function $f^{\\oplus}:E(G)\\rightarrow2^{X}-\\{\\emptyset\\}$ defined by $f^{\\oplus}(uv) = f(u){\\oplus} f(v)$ for every $uv{\\in} E(G)$ is also injective, where $2^{X}$ is the set of all subsets of $X$ and $\\oplus$ is the symmetric difference of sets. An integer additive set-indexer is defined as an injective function $f:V(G)\\rightarrow 2^{\\mathbb{N}_0}$ such that the induced function $f^+:E(G) \\rightarrow 2^{\\mathbb{N}_0}$ defined by $f^+ (uv) = f(u)+ f(v)$ is also injective. A graph $G$ which 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":"1312.7674","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-30T10:50:12Z","cross_cats_sorted":[],"title_canon_sha256":"fc1f02514dac53611133967e110a396ad39417cd39057dab39d48383d1847d54","abstract_canon_sha256":"99da558b0be96ea22a699b224eeb728efc84327739c54bd776ebc7e03249850e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:48.041979Z","signature_b64":"+AcE8W87qjFpZ0Quf1ZfB98h4c2JuQNI+ClAnq+KjFbtN5aX+yFJPFxvjbb7RUu4beESf7zk7KBDjOc3Q9MwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f83ef73616420c5801ee5824d9a24021aa5c7ee140494f502f76a3b237b1c0ba","last_reissued_at":"2026-05-18T02:55:48.041280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:48.041280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Study on 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":"2013-12-30T10:50:12Z","abstract_excerpt":"A set-indexer of a graph $G$ is an injective set-valued function $f:V(G) \\rightarrow2^{X}$ such that the function $f^{\\oplus}:E(G)\\rightarrow2^{X}-\\{\\emptyset\\}$ defined by $f^{\\oplus}(uv) = f(u){\\oplus} f(v)$ for every $uv{\\in} E(G)$ is also injective, where $2^{X}$ is the set of all subsets of $X$ and $\\oplus$ is the symmetric difference of sets. An integer additive set-indexer is defined as an injective function $f:V(G)\\rightarrow 2^{\\mathbb{N}_0}$ such that the induced function $f^+:E(G) \\rightarrow 2^{\\mathbb{N}_0}$ defined by $f^+ (uv) = f(u)+ f(v)$ is also injective. A graph $G$ which a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7674","kind":"arxiv","version":5},"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":"1312.7674","created_at":"2026-05-18T02:55:48.041389+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.7674v5","created_at":"2026-05-18T02:55:48.041389+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7674","created_at":"2026-05-18T02:55:48.041389+00:00"},{"alias_kind":"pith_short_12","alias_value":"7A7PONQWIIGF","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7A7PONQWIIGFQAPO","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7A7PONQW","created_at":"2026-05-18T12:27:36.564083+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/7A7PONQWIIGFQAPOLASNTISAEG","json":"https://pith.science/pith/7A7PONQWIIGFQAPOLASNTISAEG.json","graph_json":"https://pith.science/api/pith-number/7A7PONQWIIGFQAPOLASNTISAEG/graph.json","events_json":"https://pith.science/api/pith-number/7A7PONQWIIGFQAPOLASNTISAEG/events.json","paper":"https://pith.science/paper/7A7PONQW"},"agent_actions":{"view_html":"https://pith.science/pith/7A7PONQWIIGFQAPOLASNTISAEG","download_json":"https://pith.science/pith/7A7PONQWIIGFQAPOLASNTISAEG.json","view_paper":"https://pith.science/paper/7A7PONQW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.7674&json=true","fetch_graph":"https://pith.science/api/pith-number/7A7PONQWIIGFQAPOLASNTISAEG/graph.json","fetch_events":"https://pith.science/api/pith-number/7A7PONQWIIGFQAPOLASNTISAEG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7A7PONQWIIGFQAPOLASNTISAEG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7A7PONQWIIGFQAPOLASNTISAEG/action/storage_attestation","attest_author":"https://pith.science/pith/7A7PONQWIIGFQAPOLASNTISAEG/action/author_attestation","sign_citation":"https://pith.science/pith/7A7PONQWIIGFQAPOLASNTISAEG/action/citation_signature","submit_replication":"https://pith.science/pith/7A7PONQWIIGFQAPOLASNTISAEG/action/replication_record"}},"created_at":"2026-05-18T02:55:48.041389+00:00","updated_at":"2026-05-18T02:55:48.041389+00:00"}