{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PRH6XYMKPATKUP4GJP5MFBWXSM","short_pith_number":"pith:PRH6XYMK","canonical_record":{"source":{"id":"1405.4787","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-14T17:12:23Z","cross_cats_sorted":[],"title_canon_sha256":"f2bad3a157d388e00754610074e3ad4e2c46091fd30d042ca505752a24baeb75","abstract_canon_sha256":"f790ead7021943eeeeb32996419cb9d8f156e1dfa8570ceaa21ba5625ca6ffa7"},"schema_version":"1.0"},"canonical_sha256":"7c4febe18a7826aa3f864bfac286d7933aeadcb54c517b0f9cab5b245de3436a","source":{"kind":"arxiv","id":"1405.4787","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4787","created_at":"2026-05-18T01:37:23Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4787v2","created_at":"2026-05-18T01:37:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4787","created_at":"2026-05-18T01:37:23Z"},{"alias_kind":"pith_short_12","alias_value":"PRH6XYMKPATK","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PRH6XYMKPATKUP4G","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PRH6XYMK","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PRH6XYMKPATKUP4GJP5MFBWXSM","target":"record","payload":{"canonical_record":{"source":{"id":"1405.4787","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-14T17:12:23Z","cross_cats_sorted":[],"title_canon_sha256":"f2bad3a157d388e00754610074e3ad4e2c46091fd30d042ca505752a24baeb75","abstract_canon_sha256":"f790ead7021943eeeeb32996419cb9d8f156e1dfa8570ceaa21ba5625ca6ffa7"},"schema_version":"1.0"},"canonical_sha256":"7c4febe18a7826aa3f864bfac286d7933aeadcb54c517b0f9cab5b245de3436a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:23.494880Z","signature_b64":"ANx1n4JJniBNRLoi4acBSZPCpB/UJIddQRILkQMe3HE2RdR+vZk2SUgf4Zc/9dWpwZYI34rrLryAZOyZRnmWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c4febe18a7826aa3f864bfac286d7933aeadcb54c517b0f9cab5b245de3436a","last_reissued_at":"2026-05-18T01:37:23.494212Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:23.494212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.4787","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:37:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DIqAPjH2jrpW/5PBWLx3Fd99aeZ4YGo1c9IJBf8o5IoS+Tw84yPNVckzZMiq3VVoIYD6GspFIj9YGmCd+46hCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:24:42.303504Z"},"content_sha256":"bc8a5ac705eea4cafbc26fb9fba343d047c6998f9d57d49fb31e850aa72d6fa6","schema_version":"1.0","event_id":"sha256:bc8a5ac705eea4cafbc26fb9fba343d047c6998f9d57d49fb31e850aa72d6fa6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PRH6XYMKPATKUP4GJP5MFBWXSM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Sparing Number of Certain Graph Powers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"K. A. Germina, K. P. Chithra, N. K. Sudev","submitted_at":"2014-05-14T17:12:23Z","abstract_excerpt":"An integer additive set-indexer is defined as an injective function $f:V(G)\\rightarrow 2^{\\mathbb{N}_0}$ such that the induced function $g_f:E(G) \\rightarrow 2^{\\mathbb{N}_0}$ defined by $g_f (uv) = f(u)+ f(v)$ is also injective. An IASI $f$ is said to be a weak IASI if $|g_f(uv)|=max(|f(u)|,|f(v)|)$ for all $u,v\\in V(G)$. A graph which admits a weak IASI may be called a weak IASI graph. The set-indexing number of an element of a graph $G$, a vertex or an edge, is the cardinality of its set-labels. The sparing number of a graph $G$ is the minimum number of edges with singleton set-labels, requ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4787","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:37:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"thvSHbrV4N2iVr/OORZ9SXhkA7nxD/iHkM1CG+Zf7O3Hi1ZadoSo7d4IIXQI/T3oaf/fwVGYPHj83IXzfpMnCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:24:42.303851Z"},"content_sha256":"4e12605c98cb2c7ccee40e3da8c74aa41f4dd831aa988df160b799c46fac3ab3","schema_version":"1.0","event_id":"sha256:4e12605c98cb2c7ccee40e3da8c74aa41f4dd831aa988df160b799c46fac3ab3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PRH6XYMKPATKUP4GJP5MFBWXSM/bundle.json","state_url":"https://pith.science/pith/PRH6XYMKPATKUP4GJP5MFBWXSM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PRH6XYMKPATKUP4GJP5MFBWXSM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-12T00:24:42Z","links":{"resolver":"https://pith.science/pith/PRH6XYMKPATKUP4GJP5MFBWXSM","bundle":"https://pith.science/pith/PRH6XYMKPATKUP4GJP5MFBWXSM/bundle.json","state":"https://pith.science/pith/PRH6XYMKPATKUP4GJP5MFBWXSM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PRH6XYMKPATKUP4GJP5MFBWXSM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PRH6XYMKPATKUP4GJP5MFBWXSM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f790ead7021943eeeeb32996419cb9d8f156e1dfa8570ceaa21ba5625ca6ffa7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-14T17:12:23Z","title_canon_sha256":"f2bad3a157d388e00754610074e3ad4e2c46091fd30d042ca505752a24baeb75"},"schema_version":"1.0","source":{"id":"1405.4787","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4787","created_at":"2026-05-18T01:37:23Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4787v2","created_at":"2026-05-18T01:37:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4787","created_at":"2026-05-18T01:37:23Z"},{"alias_kind":"pith_short_12","alias_value":"PRH6XYMKPATK","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PRH6XYMKPATKUP4G","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PRH6XYMK","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:4e12605c98cb2c7ccee40e3da8c74aa41f4dd831aa988df160b799c46fac3ab3","target":"graph","created_at":"2026-05-18T01:37:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"An integer additive set-indexer is defined as an injective function $f:V(G)\\rightarrow 2^{\\mathbb{N}_0}$ such that the induced function $g_f:E(G) \\rightarrow 2^{\\mathbb{N}_0}$ defined by $g_f (uv) = f(u)+ f(v)$ is also injective. An IASI $f$ is said to be a weak IASI if $|g_f(uv)|=max(|f(u)|,|f(v)|)$ for all $u,v\\in V(G)$. A graph which admits a weak IASI may be called a weak IASI graph. The set-indexing number of an element of a graph $G$, a vertex or an edge, is the cardinality of its set-labels. The sparing number of a graph $G$ is the minimum number of edges with singleton set-labels, requ","authors_text":"K. A. Germina, K. P. Chithra, N. K. Sudev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-14T17:12:23Z","title":"The Sparing Number of Certain Graph Powers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4787","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bc8a5ac705eea4cafbc26fb9fba343d047c6998f9d57d49fb31e850aa72d6fa6","target":"record","created_at":"2026-05-18T01:37:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f790ead7021943eeeeb32996419cb9d8f156e1dfa8570ceaa21ba5625ca6ffa7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-14T17:12:23Z","title_canon_sha256":"f2bad3a157d388e00754610074e3ad4e2c46091fd30d042ca505752a24baeb75"},"schema_version":"1.0","source":{"id":"1405.4787","kind":"arxiv","version":2}},"canonical_sha256":"7c4febe18a7826aa3f864bfac286d7933aeadcb54c517b0f9cab5b245de3436a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c4febe18a7826aa3f864bfac286d7933aeadcb54c517b0f9cab5b245de3436a","first_computed_at":"2026-05-18T01:37:23.494212Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:23.494212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ANx1n4JJniBNRLoi4acBSZPCpB/UJIddQRILkQMe3HE2RdR+vZk2SUgf4Zc/9dWpwZYI34rrLryAZOyZRnmWDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:23.494880Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.4787","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc8a5ac705eea4cafbc26fb9fba343d047c6998f9d57d49fb31e850aa72d6fa6","sha256:4e12605c98cb2c7ccee40e3da8c74aa41f4dd831aa988df160b799c46fac3ab3"],"state_sha256":"6e5f79fa75befdd08b1c4873480531e443a3392e313c46e84dde8a7304f31e8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cKThlq+8brwd4g8ktl3xba+M2l0dPa8gfad6pOSQlD9zg3AwVQCAELSjd0X+Wi46/OvVKcHWPcgL1EE3D9hBAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T00:24:42.305827Z","bundle_sha256":"8324dc17b1b65dc73bfaa82932d67578934823f355ba8614eb9210fe602c5ad0"}}