{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YSJJ66OHW7ANC6FPIAMGU6X234","short_pith_number":"pith:YSJJ66OH","schema_version":"1.0","canonical_sha256":"c4929f79c7b7c0d178af40186a7afadf2fbe90bea1eb24a76a589092f6b6bbcd","source":{"kind":"arxiv","id":"1507.02173","version":1},"attestation_state":"computed","paper":{"title":"On Integer Additive Set-Filtered Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"K. A. Germina, K. P. Chithra, N. K. Sudev","submitted_at":"2015-07-07T16:37:14Z","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-labeling (IASL) 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)$ is defined by $f^+ (uv) = f(u)+ f(v)$, where $f(u)+f(v)$ is the sumset of $f(u)$ and $f(v)$. In this paper, we introduce the notion of a particular type of integer additive set-indexers called integer additive set-filtered labeling of given graphs and study their characteristics."},"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":"1507.02173","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2015-07-07T16:37:14Z","cross_cats_sorted":[],"title_canon_sha256":"aec244b3194a8a6daeebb493cd74857813e288a298f2ed879b1baad5f4efdcef","abstract_canon_sha256":"3d6f92c55f101bf3e746aa3596e8e60495d87bb1a9efae52912f6d57b22db889"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:08.474882Z","signature_b64":"N0qf+wYcyOr1c6XBGqUaPBFlWkIonkvI4NADfQ7xVgZM6SNmvaJTXZiEVNuQW7X4st14Yp+EoyOlTdSOHNL7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4929f79c7b7c0d178af40186a7afadf2fbe90bea1eb24a76a589092f6b6bbcd","last_reissued_at":"2026-05-18T01:37:08.474171Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:08.474171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Integer Additive Set-Filtered Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"K. A. Germina, K. P. Chithra, N. K. Sudev","submitted_at":"2015-07-07T16:37:14Z","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-labeling (IASL) 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)$ is defined by $f^+ (uv) = f(u)+ f(v)$, where $f(u)+f(v)$ is the sumset of $f(u)$ and $f(v)$. In this paper, we introduce the notion of a particular type of integer additive set-indexers called integer additive set-filtered labeling of given graphs and study their characteristics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02173","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":"1507.02173","created_at":"2026-05-18T01:37:08.474275+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.02173v1","created_at":"2026-05-18T01:37:08.474275+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02173","created_at":"2026-05-18T01:37:08.474275+00:00"},{"alias_kind":"pith_short_12","alias_value":"YSJJ66OHW7AN","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"YSJJ66OHW7ANC6FP","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"YSJJ66OH","created_at":"2026-05-18T12:29:52.810259+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/YSJJ66OHW7ANC6FPIAMGU6X234","json":"https://pith.science/pith/YSJJ66OHW7ANC6FPIAMGU6X234.json","graph_json":"https://pith.science/api/pith-number/YSJJ66OHW7ANC6FPIAMGU6X234/graph.json","events_json":"https://pith.science/api/pith-number/YSJJ66OHW7ANC6FPIAMGU6X234/events.json","paper":"https://pith.science/paper/YSJJ66OH"},"agent_actions":{"view_html":"https://pith.science/pith/YSJJ66OHW7ANC6FPIAMGU6X234","download_json":"https://pith.science/pith/YSJJ66OHW7ANC6FPIAMGU6X234.json","view_paper":"https://pith.science/paper/YSJJ66OH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.02173&json=true","fetch_graph":"https://pith.science/api/pith-number/YSJJ66OHW7ANC6FPIAMGU6X234/graph.json","fetch_events":"https://pith.science/api/pith-number/YSJJ66OHW7ANC6FPIAMGU6X234/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YSJJ66OHW7ANC6FPIAMGU6X234/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YSJJ66OHW7ANC6FPIAMGU6X234/action/storage_attestation","attest_author":"https://pith.science/pith/YSJJ66OHW7ANC6FPIAMGU6X234/action/author_attestation","sign_citation":"https://pith.science/pith/YSJJ66OHW7ANC6FPIAMGU6X234/action/citation_signature","submit_replication":"https://pith.science/pith/YSJJ66OHW7ANC6FPIAMGU6X234/action/replication_record"}},"created_at":"2026-05-18T01:37:08.474275+00:00","updated_at":"2026-05-18T01:37:08.474275+00:00"}