{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QOTA66ATIGMEADXR2XEF3TIPWO","short_pith_number":"pith:QOTA66AT","canonical_record":{"source":{"id":"1402.4871","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-20T02:35:15Z","cross_cats_sorted":[],"title_canon_sha256":"2fd2975269b145b72b65bbb0f337179043e661e10cab3d64c83b4da8358fcc43","abstract_canon_sha256":"f5ea92387eb8b93abfbd01322be4b1db74a290c0a4bfef042f8aad6f8b3aea88"},"schema_version":"1.0"},"canonical_sha256":"83a60f78134198400ef1d5c85dcd0fb3bfb772fe999045b421c3108320b3146b","source":{"kind":"arxiv","id":"1402.4871","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4871","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4871v3","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4871","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"pith_short_12","alias_value":"QOTA66ATIGME","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QOTA66ATIGMEADXR","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QOTA66AT","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QOTA66ATIGMEADXR2XEF3TIPWO","target":"record","payload":{"canonical_record":{"source":{"id":"1402.4871","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-20T02:35:15Z","cross_cats_sorted":[],"title_canon_sha256":"2fd2975269b145b72b65bbb0f337179043e661e10cab3d64c83b4da8358fcc43","abstract_canon_sha256":"f5ea92387eb8b93abfbd01322be4b1db74a290c0a4bfef042f8aad6f8b3aea88"},"schema_version":"1.0"},"canonical_sha256":"83a60f78134198400ef1d5c85dcd0fb3bfb772fe999045b421c3108320b3146b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:31.338769Z","signature_b64":"hDsJFERzucOvXndyPROSdvRFABaro5hOlYNjR0cgERcp/c++Qzhl3sIDfafG8lVyXPXcgS/H0meePiNA55WIDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83a60f78134198400ef1d5c85dcd0fb3bfb772fe999045b421c3108320b3146b","last_reissued_at":"2026-05-18T02:44:31.338136Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:31.338136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.4871","source_version":3,"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-18T02:44:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Qp/7ajped2z+NXs4G6Ut57Jhf/7X3M5mmrvDbYAl/cnbX9nJQ+adm8xRPf9w1haPYGyUi8nAnwdtL6NxFdSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:06:47.172104Z"},"content_sha256":"6cd3ef10edd32f15471939c1bb8e0b783a140eaeaa534292a4738562dac8f2b5","schema_version":"1.0","event_id":"sha256:6cd3ef10edd32f15471939c1bb8e0b783a140eaeaa534292a4738562dac8f2b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QOTA66ATIGMEADXR2XEF3TIPWO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Note on the Sparing Number 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-02-20T02:35:15Z","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":"1402.4871","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"},"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-18T02:44:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YhVL2mb22eeJcTYkO2zbwLF91plfVllohyXfoovmzOHBkyj4WVD9HGuo0rwgtBYD/yAmL+kc4bdiMP5hHusdDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:06:47.172946Z"},"content_sha256":"27e6ae1094a03d04c99fe48b8800332bce2e72be80df9eea486acf082183489d","schema_version":"1.0","event_id":"sha256:27e6ae1094a03d04c99fe48b8800332bce2e72be80df9eea486acf082183489d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QOTA66ATIGMEADXR2XEF3TIPWO/bundle.json","state_url":"https://pith.science/pith/QOTA66ATIGMEADXR2XEF3TIPWO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QOTA66ATIGMEADXR2XEF3TIPWO/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:06:47Z","links":{"resolver":"https://pith.science/pith/QOTA66ATIGMEADXR2XEF3TIPWO","bundle":"https://pith.science/pith/QOTA66ATIGMEADXR2XEF3TIPWO/bundle.json","state":"https://pith.science/pith/QOTA66ATIGMEADXR2XEF3TIPWO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QOTA66ATIGMEADXR2XEF3TIPWO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QOTA66ATIGMEADXR2XEF3TIPWO","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":"f5ea92387eb8b93abfbd01322be4b1db74a290c0a4bfef042f8aad6f8b3aea88","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-20T02:35:15Z","title_canon_sha256":"2fd2975269b145b72b65bbb0f337179043e661e10cab3d64c83b4da8358fcc43"},"schema_version":"1.0","source":{"id":"1402.4871","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4871","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4871v3","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4871","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"pith_short_12","alias_value":"QOTA66ATIGME","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QOTA66ATIGMEADXR","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QOTA66AT","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:27e6ae1094a03d04c99fe48b8800332bce2e72be80df9eea486acf082183489d","target":"graph","created_at":"2026-05-18T02:44:31Z","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, N. K. Sudev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-20T02:35:15Z","title":"A Note on the Sparing Number of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4871","kind":"arxiv","version":3},"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:6cd3ef10edd32f15471939c1bb8e0b783a140eaeaa534292a4738562dac8f2b5","target":"record","created_at":"2026-05-18T02:44:31Z","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":"f5ea92387eb8b93abfbd01322be4b1db74a290c0a4bfef042f8aad6f8b3aea88","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-20T02:35:15Z","title_canon_sha256":"2fd2975269b145b72b65bbb0f337179043e661e10cab3d64c83b4da8358fcc43"},"schema_version":"1.0","source":{"id":"1402.4871","kind":"arxiv","version":3}},"canonical_sha256":"83a60f78134198400ef1d5c85dcd0fb3bfb772fe999045b421c3108320b3146b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83a60f78134198400ef1d5c85dcd0fb3bfb772fe999045b421c3108320b3146b","first_computed_at":"2026-05-18T02:44:31.338136Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:31.338136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hDsJFERzucOvXndyPROSdvRFABaro5hOlYNjR0cgERcp/c++Qzhl3sIDfafG8lVyXPXcgS/H0meePiNA55WIDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:31.338769Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.4871","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6cd3ef10edd32f15471939c1bb8e0b783a140eaeaa534292a4738562dac8f2b5","sha256:27e6ae1094a03d04c99fe48b8800332bce2e72be80df9eea486acf082183489d"],"state_sha256":"e2f4b20bd314405ff2fb8fae91aee1280c9e454fbd548d9304900cd3d424f8e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mRUx+KtIwazK0KEkLdsPx4tDXy3urMwljZbT2TJVb9sY8Bbmoa2VKqCknP/FJzMAGhLcmbpKwPQbVedObTB5Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T00:06:47.176844Z","bundle_sha256":"a346460fe875f4de1c55554280ee0351d688a2dc2000898d005fbc6226cf342b"}}