{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NEMJTXAKCLKQVUJULHVHJX3WSA","short_pith_number":"pith:NEMJTXAK","canonical_record":{"source":{"id":"1611.08270","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-24T17:45:01Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"e6e906200c6496d80655f629875b49ddf395936f1c0638754735d79ac2071a72","abstract_canon_sha256":"38151d4df49a63279267ac6481082f6a1b33f0ad533ee103c9ba0fed3a57c577"},"schema_version":"1.0"},"canonical_sha256":"691899dc0a12d50ad13459ea74df769038aacc7995b08118a8f48045cce09275","source":{"kind":"arxiv","id":"1611.08270","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08270","created_at":"2026-05-18T00:56:39Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08270v1","created_at":"2026-05-18T00:56:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08270","created_at":"2026-05-18T00:56:39Z"},{"alias_kind":"pith_short_12","alias_value":"NEMJTXAKCLKQ","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NEMJTXAKCLKQVUJU","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NEMJTXAK","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NEMJTXAKCLKQVUJULHVHJX3WSA","target":"record","payload":{"canonical_record":{"source":{"id":"1611.08270","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-24T17:45:01Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"e6e906200c6496d80655f629875b49ddf395936f1c0638754735d79ac2071a72","abstract_canon_sha256":"38151d4df49a63279267ac6481082f6a1b33f0ad533ee103c9ba0fed3a57c577"},"schema_version":"1.0"},"canonical_sha256":"691899dc0a12d50ad13459ea74df769038aacc7995b08118a8f48045cce09275","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:39.637702Z","signature_b64":"IYVtpVWe126FKhLgUA42MAkI6Kbef3hnfPjoj2GagtFv2PWk82586BWxKEaUk+iVeQADueJ4J2hqAXQwB3MDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"691899dc0a12d50ad13459ea74df769038aacc7995b08118a8f48045cce09275","last_reissued_at":"2026-05-18T00:56:39.636998Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:39.636998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.08270","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-18T00:56:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"prHWveKyf7v/Un1TW1UmppI4OZZKLLeXyaEzKFLdjMeT4A84Xk+KebwL7XnrObkfoMAaNmhmkCrFY9m78wktBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:53:41.209350Z"},"content_sha256":"d67c4300014d769f32236f5e7b7cf84c7206d030875aa3be0f94773c000d6759","schema_version":"1.0","event_id":"sha256:d67c4300014d769f32236f5e7b7cf84c7206d030875aa3be0f94773c000d6759"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NEMJTXAKCLKQVUJULHVHJX3WSA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Status connectivity indices and co-indices of graphs and its computation to intersection graph, hypercube, Kneser graph and achiral polyhex nanotorus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Ashwini S. Yalnaik, Harishchandra S. Ramane, Reza Sharafdini","submitted_at":"2016-11-24T17:45:01Z","abstract_excerpt":"The status of a vertex $u$ in a connected graph $G$, denoted by $\\sigma_G(u)$, is defined as the sum of the distances between $u$ and all other vertices of a graph $G$. The first and second status connectivity indices of a graph $G$ are defined as $S_{1}(G) = \\sum_{uv \\in E(G)}[\\sigma_G(u)+ \\sigma_G(v)]$ and $S_{2}(G) = \\sum_{uv \\in E(G)}\\sigma_G(u)\\sigma_G(v)$ respectively, where $E(G)$ denotes the edge set of $G$. In this paper we have defined the first and second status co-indices of a graph $G$ as $\\overline{S_{1}}(G) = \\sum_{uv \\notin E(G)}[\\sigma_G(u)+ \\sigma_G(v)]$ and $\\overline{S_{2}}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08270","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-18T00:56:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/S9Fnu3yGcAsS4L/78WBEoDzzijFQux2laWgk5cBLuiZwRFyCdUMZBaIua1aaNTOyZhlyDQZAE4xsygWH0O+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:53:41.209839Z"},"content_sha256":"653584ffe9aa07ccb7d50dacd86f58da7fb6058a0e88eb84273d0c738fee5b35","schema_version":"1.0","event_id":"sha256:653584ffe9aa07ccb7d50dacd86f58da7fb6058a0e88eb84273d0c738fee5b35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NEMJTXAKCLKQVUJULHVHJX3WSA/bundle.json","state_url":"https://pith.science/pith/NEMJTXAKCLKQVUJULHVHJX3WSA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NEMJTXAKCLKQVUJULHVHJX3WSA/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-05-31T15:53:41Z","links":{"resolver":"https://pith.science/pith/NEMJTXAKCLKQVUJULHVHJX3WSA","bundle":"https://pith.science/pith/NEMJTXAKCLKQVUJULHVHJX3WSA/bundle.json","state":"https://pith.science/pith/NEMJTXAKCLKQVUJULHVHJX3WSA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NEMJTXAKCLKQVUJULHVHJX3WSA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NEMJTXAKCLKQVUJULHVHJX3WSA","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":"38151d4df49a63279267ac6481082f6a1b33f0ad533ee103c9ba0fed3a57c577","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-24T17:45:01Z","title_canon_sha256":"e6e906200c6496d80655f629875b49ddf395936f1c0638754735d79ac2071a72"},"schema_version":"1.0","source":{"id":"1611.08270","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08270","created_at":"2026-05-18T00:56:39Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08270v1","created_at":"2026-05-18T00:56:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08270","created_at":"2026-05-18T00:56:39Z"},{"alias_kind":"pith_short_12","alias_value":"NEMJTXAKCLKQ","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NEMJTXAKCLKQVUJU","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NEMJTXAK","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:653584ffe9aa07ccb7d50dacd86f58da7fb6058a0e88eb84273d0c738fee5b35","target":"graph","created_at":"2026-05-18T00:56:39Z","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":"The status of a vertex $u$ in a connected graph $G$, denoted by $\\sigma_G(u)$, is defined as the sum of the distances between $u$ and all other vertices of a graph $G$. The first and second status connectivity indices of a graph $G$ are defined as $S_{1}(G) = \\sum_{uv \\in E(G)}[\\sigma_G(u)+ \\sigma_G(v)]$ and $S_{2}(G) = \\sum_{uv \\in E(G)}\\sigma_G(u)\\sigma_G(v)$ respectively, where $E(G)$ denotes the edge set of $G$. In this paper we have defined the first and second status co-indices of a graph $G$ as $\\overline{S_{1}}(G) = \\sum_{uv \\notin E(G)}[\\sigma_G(u)+ \\sigma_G(v)]$ and $\\overline{S_{2}}","authors_text":"Ashwini S. Yalnaik, Harishchandra S. Ramane, Reza Sharafdini","cross_cats":["math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-24T17:45:01Z","title":"Status connectivity indices and co-indices of graphs and its computation to intersection graph, hypercube, Kneser graph and achiral polyhex nanotorus"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08270","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:d67c4300014d769f32236f5e7b7cf84c7206d030875aa3be0f94773c000d6759","target":"record","created_at":"2026-05-18T00:56:39Z","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":"38151d4df49a63279267ac6481082f6a1b33f0ad533ee103c9ba0fed3a57c577","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-24T17:45:01Z","title_canon_sha256":"e6e906200c6496d80655f629875b49ddf395936f1c0638754735d79ac2071a72"},"schema_version":"1.0","source":{"id":"1611.08270","kind":"arxiv","version":1}},"canonical_sha256":"691899dc0a12d50ad13459ea74df769038aacc7995b08118a8f48045cce09275","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"691899dc0a12d50ad13459ea74df769038aacc7995b08118a8f48045cce09275","first_computed_at":"2026-05-18T00:56:39.636998Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:39.636998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IYVtpVWe126FKhLgUA42MAkI6Kbef3hnfPjoj2GagtFv2PWk82586BWxKEaUk+iVeQADueJ4J2hqAXQwB3MDDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:39.637702Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.08270","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d67c4300014d769f32236f5e7b7cf84c7206d030875aa3be0f94773c000d6759","sha256:653584ffe9aa07ccb7d50dacd86f58da7fb6058a0e88eb84273d0c738fee5b35"],"state_sha256":"0585aa51b48011a1ee6714d539e30838ae10de21631f4489d88158a38792fa40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UgMinzraH+ZY+u8VipGyqzNv4a9+uQIu9NsqRBe6ZfWktVfh+lwILzaI5G7Ha9SRXaYnD9IkA68+DSCHLtLGCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:53:41.213421Z","bundle_sha256":"63d85849033c42886d42818ab7445ebc5e617a9fefc26586681fd8571ad436af"}}