{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WW6S5WXGP6OTOUDX6BRLFJHYY3","short_pith_number":"pith:WW6S5WXG","canonical_record":{"source":{"id":"1405.6617","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-20T19:26:59Z","cross_cats_sorted":[],"title_canon_sha256":"b9f2ebd800ef17449d4c1662e72a9773e5379c5a9166decd7c7fa37082ac1978","abstract_canon_sha256":"9ab42804d7117c57a7f94e029402791c11da78e69e5c715f14b71a6be4e3390d"},"schema_version":"1.0"},"canonical_sha256":"b5bd2edae67f9d375077f062b2a4f8c6e556ceb8187f8a729c2ee6eb17877244","source":{"kind":"arxiv","id":"1405.6617","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6617","created_at":"2026-05-18T01:46:14Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6617v3","created_at":"2026-05-18T01:46:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6617","created_at":"2026-05-18T01:46:14Z"},{"alias_kind":"pith_short_12","alias_value":"WW6S5WXGP6OT","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WW6S5WXGP6OTOUDX","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WW6S5WXG","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WW6S5WXGP6OTOUDX6BRLFJHYY3","target":"record","payload":{"canonical_record":{"source":{"id":"1405.6617","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-20T19:26:59Z","cross_cats_sorted":[],"title_canon_sha256":"b9f2ebd800ef17449d4c1662e72a9773e5379c5a9166decd7c7fa37082ac1978","abstract_canon_sha256":"9ab42804d7117c57a7f94e029402791c11da78e69e5c715f14b71a6be4e3390d"},"schema_version":"1.0"},"canonical_sha256":"b5bd2edae67f9d375077f062b2a4f8c6e556ceb8187f8a729c2ee6eb17877244","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:46:14.178883Z","signature_b64":"pcx7fVueJOJ97MaMb2tKDHxzubzekE5LtcGgRIqA9WshLDoxX+P3oN4jv45rpsNwVIYiAgQY+qOIyk1eHtZlBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5bd2edae67f9d375077f062b2a4f8c6e556ceb8187f8a729c2ee6eb17877244","last_reissued_at":"2026-05-18T01:46:14.178157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:46:14.178157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.6617","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-18T01:46:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kPpTvR2LHdygNn71j63t7DsCgpeEc8cOVopwc4DUDXB10lOAE1rE/yCOqyKZHkefS0ZKGEoKbqwK2ikd4KmaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T01:38:47.555896Z"},"content_sha256":"08972bd7e7e3e8bb174c30fcdc58ee49a3d084a5c21ac235558c5bb52a509a88","schema_version":"1.0","event_id":"sha256:08972bd7e7e3e8bb174c30fcdc58ee49a3d084a5c21ac235558c5bb52a509a88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WW6S5WXGP6OTOUDX6BRLFJHYY3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Certain Arithmetic Integer Additive set-indexers 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-05-20T19:26:59Z","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 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, where $\\mathbb{N}_0$ is the set of all non-negative integers. A graph $G$ which admits an IASI is called an IASI graph. An IASI of a graph $G$ is said to be an arithmetic IASI if the elements of the set-labels of all vertices and edges of $G$ a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6617","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-18T01:46:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8vWSUIo6bx88QevMt18pUWomlJhDAXfwXEDzrC5X4BBdB2XV6gooSSP3iyXEX0wbExj+NqcQ8kLefKsFMBP5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T01:38:47.556511Z"},"content_sha256":"63fb4bafc32302da6379e678b9ec096cd8969e0bf843c3b2946a629b1497bd7d","schema_version":"1.0","event_id":"sha256:63fb4bafc32302da6379e678b9ec096cd8969e0bf843c3b2946a629b1497bd7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WW6S5WXGP6OTOUDX6BRLFJHYY3/bundle.json","state_url":"https://pith.science/pith/WW6S5WXGP6OTOUDX6BRLFJHYY3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WW6S5WXGP6OTOUDX6BRLFJHYY3/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-12T01:38:47Z","links":{"resolver":"https://pith.science/pith/WW6S5WXGP6OTOUDX6BRLFJHYY3","bundle":"https://pith.science/pith/WW6S5WXGP6OTOUDX6BRLFJHYY3/bundle.json","state":"https://pith.science/pith/WW6S5WXGP6OTOUDX6BRLFJHYY3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WW6S5WXGP6OTOUDX6BRLFJHYY3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WW6S5WXGP6OTOUDX6BRLFJHYY3","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":"9ab42804d7117c57a7f94e029402791c11da78e69e5c715f14b71a6be4e3390d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-20T19:26:59Z","title_canon_sha256":"b9f2ebd800ef17449d4c1662e72a9773e5379c5a9166decd7c7fa37082ac1978"},"schema_version":"1.0","source":{"id":"1405.6617","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6617","created_at":"2026-05-18T01:46:14Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6617v3","created_at":"2026-05-18T01:46:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6617","created_at":"2026-05-18T01:46:14Z"},{"alias_kind":"pith_short_12","alias_value":"WW6S5WXGP6OT","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WW6S5WXGP6OTOUDX","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WW6S5WXG","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:63fb4bafc32302da6379e678b9ec096cd8969e0bf843c3b2946a629b1497bd7d","target":"graph","created_at":"2026-05-18T01:46:14Z","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 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, where $\\mathbb{N}_0$ is the set of all non-negative integers. A graph $G$ which admits an IASI is called an IASI graph. An IASI of a graph $G$ is said to be an arithmetic IASI if the elements of the set-labels of all vertices and edges of $G$ a","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-05-20T19:26:59Z","title":"On Certain Arithmetic Integer Additive set-indexers of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6617","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:08972bd7e7e3e8bb174c30fcdc58ee49a3d084a5c21ac235558c5bb52a509a88","target":"record","created_at":"2026-05-18T01:46:14Z","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":"9ab42804d7117c57a7f94e029402791c11da78e69e5c715f14b71a6be4e3390d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-20T19:26:59Z","title_canon_sha256":"b9f2ebd800ef17449d4c1662e72a9773e5379c5a9166decd7c7fa37082ac1978"},"schema_version":"1.0","source":{"id":"1405.6617","kind":"arxiv","version":3}},"canonical_sha256":"b5bd2edae67f9d375077f062b2a4f8c6e556ceb8187f8a729c2ee6eb17877244","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5bd2edae67f9d375077f062b2a4f8c6e556ceb8187f8a729c2ee6eb17877244","first_computed_at":"2026-05-18T01:46:14.178157Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:46:14.178157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pcx7fVueJOJ97MaMb2tKDHxzubzekE5LtcGgRIqA9WshLDoxX+P3oN4jv45rpsNwVIYiAgQY+qOIyk1eHtZlBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:46:14.178883Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.6617","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08972bd7e7e3e8bb174c30fcdc58ee49a3d084a5c21ac235558c5bb52a509a88","sha256:63fb4bafc32302da6379e678b9ec096cd8969e0bf843c3b2946a629b1497bd7d"],"state_sha256":"98b1aefda27596c59b65fda73cc39099f825103e8e43e49d9b7dc4b1ce4f0648"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O+JRdZYoM4w99SvA50SaqEa+61SMUjMjHqjmtZog1gH93MMgcKn8IXSjyuD/TgGM4p2Hp0T+laihCAUulMdWBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T01:38:47.559721Z","bundle_sha256":"12878e1c9511f80b9bcd655c5843d492fc016bd7284689ed0c07d47f4d02547b"}}