{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GVR2CTZ32IXFGBLBWZNRTVWZBN","short_pith_number":"pith:GVR2CTZ3","canonical_record":{"source":{"id":"1407.4676","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-09T01:57:10Z","cross_cats_sorted":[],"title_canon_sha256":"448d3e09734a0c5b3610c88f9b34f1d062f07a7d5be1d92d0c913b40403d8810","abstract_canon_sha256":"e78c451bb600fb08fc51cfc5ed32ed49afebfc9efadc518f6422ca381691f6ec"},"schema_version":"1.0"},"canonical_sha256":"3563a14f3bd22e530561b65b19d6d90b6b394092525d8d89a5778f9dff05d19c","source":{"kind":"arxiv","id":"1407.4676","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4676","created_at":"2026-05-18T02:47:14Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4676v1","created_at":"2026-05-18T02:47:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4676","created_at":"2026-05-18T02:47:14Z"},{"alias_kind":"pith_short_12","alias_value":"GVR2CTZ32IXF","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GVR2CTZ32IXFGBLB","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GVR2CTZ3","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GVR2CTZ32IXFGBLBWZNRTVWZBN","target":"record","payload":{"canonical_record":{"source":{"id":"1407.4676","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-09T01:57:10Z","cross_cats_sorted":[],"title_canon_sha256":"448d3e09734a0c5b3610c88f9b34f1d062f07a7d5be1d92d0c913b40403d8810","abstract_canon_sha256":"e78c451bb600fb08fc51cfc5ed32ed49afebfc9efadc518f6422ca381691f6ec"},"schema_version":"1.0"},"canonical_sha256":"3563a14f3bd22e530561b65b19d6d90b6b394092525d8d89a5778f9dff05d19c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:14.994568Z","signature_b64":"mS+6B9Ol4GqM5YNEmlmUJPcBIbAZuw2D3w9nbQvICeqP0HyiGqaffqPpmrrfpOSLSEWoxWaR/GmSaL/JkHgFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3563a14f3bd22e530561b65b19d6d90b6b394092525d8d89a5778f9dff05d19c","last_reissued_at":"2026-05-18T02:47:14.993908Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:14.993908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.4676","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:47:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MvfDQiLbXhF1kQm0KlnncmgbwuKdkb8VkkRJ2ZXILGpF+MR6RF06wQKNb4ODNvgSePEa1jOi8NcAb0KNpTFXDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T09:27:59.972801Z"},"content_sha256":"0f300890a84d31dbc7e1cfa1d430a6b7ed4d5b0aa68ec1617f772341374f1644","schema_version":"1.0","event_id":"sha256:0f300890a84d31dbc7e1cfa1d430a6b7ed4d5b0aa68ec1617f772341374f1644"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GVR2CTZ32IXFGBLBWZNRTVWZBN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Study on Prime 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-07-09T01:57:10Z","abstract_excerpt":"Let $\\mathbb{N}_0$ be the set of all non-negative integers and $\\mathcal{P}(\\mathbb{N}_0)$ be its power set. An integer additive set-indexer (IASI) is defined as 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$ are in ari"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4676","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:47:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y5eX46TVJWYPs7tXqXCcVuYFKOzom2fZHEz7oTNXaCW7+Eh0MuPfzof1dqhIbKZAD9EH6dfUpjukx55TljCzAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T09:27:59.973141Z"},"content_sha256":"cb64152e1fb92c76096b49c848a4b5183f6bc132bd7680d96d09391be79c68dc","schema_version":"1.0","event_id":"sha256:cb64152e1fb92c76096b49c848a4b5183f6bc132bd7680d96d09391be79c68dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GVR2CTZ32IXFGBLBWZNRTVWZBN/bundle.json","state_url":"https://pith.science/pith/GVR2CTZ32IXFGBLBWZNRTVWZBN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GVR2CTZ32IXFGBLBWZNRTVWZBN/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-29T09:27:59Z","links":{"resolver":"https://pith.science/pith/GVR2CTZ32IXFGBLBWZNRTVWZBN","bundle":"https://pith.science/pith/GVR2CTZ32IXFGBLBWZNRTVWZBN/bundle.json","state":"https://pith.science/pith/GVR2CTZ32IXFGBLBWZNRTVWZBN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GVR2CTZ32IXFGBLBWZNRTVWZBN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GVR2CTZ32IXFGBLBWZNRTVWZBN","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":"e78c451bb600fb08fc51cfc5ed32ed49afebfc9efadc518f6422ca381691f6ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-09T01:57:10Z","title_canon_sha256":"448d3e09734a0c5b3610c88f9b34f1d062f07a7d5be1d92d0c913b40403d8810"},"schema_version":"1.0","source":{"id":"1407.4676","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4676","created_at":"2026-05-18T02:47:14Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4676v1","created_at":"2026-05-18T02:47:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4676","created_at":"2026-05-18T02:47:14Z"},{"alias_kind":"pith_short_12","alias_value":"GVR2CTZ32IXF","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GVR2CTZ32IXFGBLB","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GVR2CTZ3","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:cb64152e1fb92c76096b49c848a4b5183f6bc132bd7680d96d09391be79c68dc","target":"graph","created_at":"2026-05-18T02:47: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$ be the set of all non-negative integers and $\\mathcal{P}(\\mathbb{N}_0)$ be its power set. An integer additive set-indexer (IASI) is defined as 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$ are in ari","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-07-09T01:57:10Z","title":"A Study on Prime Arithmetic Integer Additive Set-Indexers of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4676","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:0f300890a84d31dbc7e1cfa1d430a6b7ed4d5b0aa68ec1617f772341374f1644","target":"record","created_at":"2026-05-18T02:47: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":"e78c451bb600fb08fc51cfc5ed32ed49afebfc9efadc518f6422ca381691f6ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-09T01:57:10Z","title_canon_sha256":"448d3e09734a0c5b3610c88f9b34f1d062f07a7d5be1d92d0c913b40403d8810"},"schema_version":"1.0","source":{"id":"1407.4676","kind":"arxiv","version":1}},"canonical_sha256":"3563a14f3bd22e530561b65b19d6d90b6b394092525d8d89a5778f9dff05d19c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3563a14f3bd22e530561b65b19d6d90b6b394092525d8d89a5778f9dff05d19c","first_computed_at":"2026-05-18T02:47:14.993908Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:14.993908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mS+6B9Ol4GqM5YNEmlmUJPcBIbAZuw2D3w9nbQvICeqP0HyiGqaffqPpmrrfpOSLSEWoxWaR/GmSaL/JkHgFAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:14.994568Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.4676","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f300890a84d31dbc7e1cfa1d430a6b7ed4d5b0aa68ec1617f772341374f1644","sha256:cb64152e1fb92c76096b49c848a4b5183f6bc132bd7680d96d09391be79c68dc"],"state_sha256":"4bda5d93c3bd5a71f728568c12f8f6cf9a9592cbc50ef7c695eab9d001ad9277"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mjutPWDaMBwhF5yGwUNQbCEbXDly55d1QFg4WZtciTdHgNJA2kSmcZjrsMzYXKmHuz8VeeaPEAqOhF+AdxT/BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T09:27:59.974933Z","bundle_sha256":"e33d83cbdee7d9dee29f23e497fb5a0721cd81a1cca505e54683fda88679acf7"}}