{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:J7DJ2EGOFD2ZCDGWF77JTDEGUB","short_pith_number":"pith:J7DJ2EGO","schema_version":"1.0","canonical_sha256":"4fc69d10ce28f5910cd62ffe998c86a051c78fb15b26370d562abb2a75d1169b","source":{"kind":"arxiv","id":"1407.5028","version":2},"attestation_state":"computed","paper":{"title":"On Integer Additive set-Sequential 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-06-06T16:28:47Z","abstract_excerpt":"A set-labeling of a graph $G$ is an injective function $f:V(G)\\to \\mathcal{P}(X)$, where $X$ is a finite set of non-negative integers and a set-indexer of $G$ is a set-labeling such that the induced function $f^{\\oplus}:E(G)\\rightarrow \\mathcal{P}(X)-\\{\\emptyset\\}$ defined by $f^{\\oplus}(uv) = f(u){\\oplus}f(v)$ for every $uv{\\in} E(G)$ is also injective. A set-indexer $f:V(G)\\to \\mathcal{P}(X)$ is called a set-sequential labeling of $G$ if $f^{\\oplus}(V(G)\\cup E(G))=\\mathcal{P}(X)-\\{\\emptyset\\}$. A graph $G$ which admits a set-sequential labeling is called a set-sequential graph. An integer ad"},"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.5028","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-06T16:28:47Z","cross_cats_sorted":[],"title_canon_sha256":"b9bfad009ca937ec1c67d438b2e50774d24834c9b6bd2688095b796464e82ef2","abstract_canon_sha256":"fbb3d6b5c242680788b4c9f035facfe4975a92c3e28a4a56c231c0f9705eebd1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:35:47.123586Z","signature_b64":"o3MG92S1TsxxXxKy91SvOsg33DtRPamfj+AYLavKzCFrtYqBBc1kX9Md4aLi0pB2SC6zYOxuWYHPQgEFHirKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fc69d10ce28f5910cd62ffe998c86a051c78fb15b26370d562abb2a75d1169b","last_reissued_at":"2026-05-18T02:35:47.123169Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:35:47.123169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Integer Additive set-Sequential 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-06-06T16:28:47Z","abstract_excerpt":"A set-labeling of a graph $G$ is an injective function $f:V(G)\\to \\mathcal{P}(X)$, where $X$ is a finite set of non-negative integers and a set-indexer of $G$ is a set-labeling such that the induced function $f^{\\oplus}:E(G)\\rightarrow \\mathcal{P}(X)-\\{\\emptyset\\}$ defined by $f^{\\oplus}(uv) = f(u){\\oplus}f(v)$ for every $uv{\\in} E(G)$ is also injective. A set-indexer $f:V(G)\\to \\mathcal{P}(X)$ is called a set-sequential labeling of $G$ if $f^{\\oplus}(V(G)\\cup E(G))=\\mathcal{P}(X)-\\{\\emptyset\\}$. A graph $G$ which admits a set-sequential labeling is called a set-sequential graph. An integer ad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5028","kind":"arxiv","version":2},"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.5028","created_at":"2026-05-18T02:35:47.123225+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.5028v2","created_at":"2026-05-18T02:35:47.123225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5028","created_at":"2026-05-18T02:35:47.123225+00:00"},{"alias_kind":"pith_short_12","alias_value":"J7DJ2EGOFD2Z","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"J7DJ2EGOFD2ZCDGW","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"J7DJ2EGO","created_at":"2026-05-18T12:28:33.132498+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/J7DJ2EGOFD2ZCDGWF77JTDEGUB","json":"https://pith.science/pith/J7DJ2EGOFD2ZCDGWF77JTDEGUB.json","graph_json":"https://pith.science/api/pith-number/J7DJ2EGOFD2ZCDGWF77JTDEGUB/graph.json","events_json":"https://pith.science/api/pith-number/J7DJ2EGOFD2ZCDGWF77JTDEGUB/events.json","paper":"https://pith.science/paper/J7DJ2EGO"},"agent_actions":{"view_html":"https://pith.science/pith/J7DJ2EGOFD2ZCDGWF77JTDEGUB","download_json":"https://pith.science/pith/J7DJ2EGOFD2ZCDGWF77JTDEGUB.json","view_paper":"https://pith.science/paper/J7DJ2EGO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.5028&json=true","fetch_graph":"https://pith.science/api/pith-number/J7DJ2EGOFD2ZCDGWF77JTDEGUB/graph.json","fetch_events":"https://pith.science/api/pith-number/J7DJ2EGOFD2ZCDGWF77JTDEGUB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J7DJ2EGOFD2ZCDGWF77JTDEGUB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J7DJ2EGOFD2ZCDGWF77JTDEGUB/action/storage_attestation","attest_author":"https://pith.science/pith/J7DJ2EGOFD2ZCDGWF77JTDEGUB/action/author_attestation","sign_citation":"https://pith.science/pith/J7DJ2EGOFD2ZCDGWF77JTDEGUB/action/citation_signature","submit_replication":"https://pith.science/pith/J7DJ2EGOFD2ZCDGWF77JTDEGUB/action/replication_record"}},"created_at":"2026-05-18T02:35:47.123225+00:00","updated_at":"2026-05-18T02:35:47.123225+00:00"}