{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5BG5PH7ZCHYDHLICH42AY4O4AE","short_pith_number":"pith:5BG5PH7Z","canonical_record":{"source":{"id":"1505.03841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2015-05-11T10:44:04Z","cross_cats_sorted":[],"title_canon_sha256":"7dbba6c90219fd86e347de91793f99f9b908583117b970826f76cb7c3b3adb4b","abstract_canon_sha256":"2b0e37a49c5f2bcd285979ddf7a81ebe08cb23b6f72a131f4792cbb0b45504fc"},"schema_version":"1.0"},"canonical_sha256":"e84dd79ff911f033ad023f340c71dc012ecca03683b8a2bb9b7a8aa5890b8588","source":{"kind":"arxiv","id":"1505.03841","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.03841","created_at":"2026-05-18T02:09:52Z"},{"alias_kind":"arxiv_version","alias_value":"1505.03841v1","created_at":"2026-05-18T02:09:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03841","created_at":"2026-05-18T02:09:52Z"},{"alias_kind":"pith_short_12","alias_value":"5BG5PH7ZCHYD","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5BG5PH7ZCHYDHLIC","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5BG5PH7Z","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5BG5PH7ZCHYDHLICH42AY4O4AE","target":"record","payload":{"canonical_record":{"source":{"id":"1505.03841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2015-05-11T10:44:04Z","cross_cats_sorted":[],"title_canon_sha256":"7dbba6c90219fd86e347de91793f99f9b908583117b970826f76cb7c3b3adb4b","abstract_canon_sha256":"2b0e37a49c5f2bcd285979ddf7a81ebe08cb23b6f72a131f4792cbb0b45504fc"},"schema_version":"1.0"},"canonical_sha256":"e84dd79ff911f033ad023f340c71dc012ecca03683b8a2bb9b7a8aa5890b8588","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:09:52.874606Z","signature_b64":"6O/ae0Y6+JIHzde+G/vNK1cizd2E0gpQu0H5WAPnkpn01gFVJPUKbWtbMhpbKhfBjWN7xtmbh8yMQUpje4hODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e84dd79ff911f033ad023f340c71dc012ecca03683b8a2bb9b7a8aa5890b8588","last_reissued_at":"2026-05-18T02:09:52.873840Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:09:52.873840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.03841","source_version":1,"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:09:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EflLwyCIEOu0UL4rPvRf0Hc9swfOGyYcYaFOr9Y70Lipyft5MND17N4Isjx/+ZkLjBErHz1P7Ff/7gPcwEcxBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T15:25:09.424478Z"},"content_sha256":"65b1a0e5aefc2eec975fa385ead4278ad0fd8bfcc3a6571dec934ed09155c1fe","schema_version":"1.0","event_id":"sha256:65b1a0e5aefc2eec975fa385ead4278ad0fd8bfcc3a6571dec934ed09155c1fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5BG5PH7ZCHYDHLICH42AY4O4AE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Note on the Sparing Number of the Sieve Graphs of Certain Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Augustine Germina, Naduvath Sudev","submitted_at":"2015-05-11T10:44:04Z","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-indexer (IASI) of a given 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)$ defined by $f^+ (uv) = f(u)+ f(v)$ is also injective. An IASI $f$ of a graph $G$ is said to be a weak IASI of $G$ if $|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 sparing number of a graph $G$ is the minimum numbe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03841","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"},"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:09:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FG/PcyBW+2SjGEGmBlbJYPgu3+MSl7R7yphr1qaHX/2QZjbipEIpQzlCvpevlh46B1Vl/PJOS3f2HxKyinQHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T15:25:09.424818Z"},"content_sha256":"1f6bca9862cc79bdbac558209421f26b9a50b5fd5f1c222c4ed65fe9bbdf33f8","schema_version":"1.0","event_id":"sha256:1f6bca9862cc79bdbac558209421f26b9a50b5fd5f1c222c4ed65fe9bbdf33f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5BG5PH7ZCHYDHLICH42AY4O4AE/bundle.json","state_url":"https://pith.science/pith/5BG5PH7ZCHYDHLICH42AY4O4AE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5BG5PH7ZCHYDHLICH42AY4O4AE/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-29T15:25:09Z","links":{"resolver":"https://pith.science/pith/5BG5PH7ZCHYDHLICH42AY4O4AE","bundle":"https://pith.science/pith/5BG5PH7ZCHYDHLICH42AY4O4AE/bundle.json","state":"https://pith.science/pith/5BG5PH7ZCHYDHLICH42AY4O4AE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5BG5PH7ZCHYDHLICH42AY4O4AE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5BG5PH7ZCHYDHLICH42AY4O4AE","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":"2b0e37a49c5f2bcd285979ddf7a81ebe08cb23b6f72a131f4792cbb0b45504fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2015-05-11T10:44:04Z","title_canon_sha256":"7dbba6c90219fd86e347de91793f99f9b908583117b970826f76cb7c3b3adb4b"},"schema_version":"1.0","source":{"id":"1505.03841","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.03841","created_at":"2026-05-18T02:09:52Z"},{"alias_kind":"arxiv_version","alias_value":"1505.03841v1","created_at":"2026-05-18T02:09:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03841","created_at":"2026-05-18T02:09:52Z"},{"alias_kind":"pith_short_12","alias_value":"5BG5PH7ZCHYD","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5BG5PH7ZCHYDHLIC","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5BG5PH7Z","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:1f6bca9862cc79bdbac558209421f26b9a50b5fd5f1c222c4ed65fe9bbdf33f8","target":"graph","created_at":"2026-05-18T02:09:52Z","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":"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-indexer (IASI) of a given 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)$ defined by $f^+ (uv) = f(u)+ f(v)$ is also injective. An IASI $f$ of a graph $G$ is said to be a weak IASI of $G$ if $|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 sparing number of a graph $G$ is the minimum numbe","authors_text":"Augustine Germina, Naduvath Sudev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2015-05-11T10:44:04Z","title":"A Note on the Sparing Number of the Sieve Graphs of Certain Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03841","kind":"arxiv","version":1},"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:65b1a0e5aefc2eec975fa385ead4278ad0fd8bfcc3a6571dec934ed09155c1fe","target":"record","created_at":"2026-05-18T02:09:52Z","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":"2b0e37a49c5f2bcd285979ddf7a81ebe08cb23b6f72a131f4792cbb0b45504fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2015-05-11T10:44:04Z","title_canon_sha256":"7dbba6c90219fd86e347de91793f99f9b908583117b970826f76cb7c3b3adb4b"},"schema_version":"1.0","source":{"id":"1505.03841","kind":"arxiv","version":1}},"canonical_sha256":"e84dd79ff911f033ad023f340c71dc012ecca03683b8a2bb9b7a8aa5890b8588","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e84dd79ff911f033ad023f340c71dc012ecca03683b8a2bb9b7a8aa5890b8588","first_computed_at":"2026-05-18T02:09:52.873840Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:09:52.873840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6O/ae0Y6+JIHzde+G/vNK1cizd2E0gpQu0H5WAPnkpn01gFVJPUKbWtbMhpbKhfBjWN7xtmbh8yMQUpje4hODw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:09:52.874606Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.03841","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65b1a0e5aefc2eec975fa385ead4278ad0fd8bfcc3a6571dec934ed09155c1fe","sha256:1f6bca9862cc79bdbac558209421f26b9a50b5fd5f1c222c4ed65fe9bbdf33f8"],"state_sha256":"d853d3b4c4a622b10e17cd2167fa2f79c9441d74584b48183636316d4d17c92c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1uqtQrIvW16I0xLMeGnpgi3W5hrVR9yD+sWDuotfiiiqnKGXlPSwEZLGaHhuJqLDRxXmsNkJNXSsPdNKbE4zDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T15:25:09.426688Z","bundle_sha256":"16dd5ab647b8f5cfd8051e7cef40377b009e05ce9d70ab40320feec1e0005321"}}