{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FOXI62FR7IMGUQQJ2GAVWYNRRR","short_pith_number":"pith:FOXI62FR","schema_version":"1.0","canonical_sha256":"2bae8f68b1fa186a4209d1815b61b18c46949d507a6363a6b4955a15b5b980ad","source":{"kind":"arxiv","id":"1406.0378","version":1},"attestation_state":"computed","paper":{"title":"Connective eccentric index of some graph operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Anita Pal, Nilanjan De, Sk. Md. Abu Nayeem","submitted_at":"2014-06-02T14:06:36Z","abstract_excerpt":"The connective eccentric index of a graph is a topological index involving degrees and eccentricities of vertices of the graph. In this paper, we have studied the connective eccentric index for double graph and double cover. Also we give the connective eccentric index for some graph operations such as joins, symmetric difference, disjunction and splice of graphs."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1406.0378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-02T14:06:36Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"bd8e41e0ce1e9e175a8476ec6ce5f9869f893f7e8b0715ce00a982fd9e1b708a","abstract_canon_sha256":"d24c675dc7107f7ab809f1e4a452f0e2be40c88af19321880e42fe7530de7904"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:41.068187Z","signature_b64":"ErX3xXJa/W4vt+w2LR4fBE+h4uhk201rLXP6BkYtHibwCKJU67CfjQHedy95AWjLlKVgdkc9sFWaj12xv90cCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bae8f68b1fa186a4209d1815b61b18c46949d507a6363a6b4955a15b5b980ad","last_reissued_at":"2026-05-18T02:50:41.067662Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:41.067662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Connective eccentric index of some graph operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Anita Pal, Nilanjan De, Sk. Md. Abu Nayeem","submitted_at":"2014-06-02T14:06:36Z","abstract_excerpt":"The connective eccentric index of a graph is a topological index involving degrees and eccentricities of vertices of the graph. In this paper, we have studied the connective eccentric index for double graph and double cover. Also we give the connective eccentric index for some graph operations such as joins, symmetric difference, disjunction and splice of graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0378","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1406.0378","created_at":"2026-05-18T02:50:41.067729+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.0378v1","created_at":"2026-05-18T02:50:41.067729+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0378","created_at":"2026-05-18T02:50:41.067729+00:00"},{"alias_kind":"pith_short_12","alias_value":"FOXI62FR7IMG","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FOXI62FR7IMGUQQJ","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FOXI62FR","created_at":"2026-05-18T12:28:28.263976+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FOXI62FR7IMGUQQJ2GAVWYNRRR","json":"https://pith.science/pith/FOXI62FR7IMGUQQJ2GAVWYNRRR.json","graph_json":"https://pith.science/api/pith-number/FOXI62FR7IMGUQQJ2GAVWYNRRR/graph.json","events_json":"https://pith.science/api/pith-number/FOXI62FR7IMGUQQJ2GAVWYNRRR/events.json","paper":"https://pith.science/paper/FOXI62FR"},"agent_actions":{"view_html":"https://pith.science/pith/FOXI62FR7IMGUQQJ2GAVWYNRRR","download_json":"https://pith.science/pith/FOXI62FR7IMGUQQJ2GAVWYNRRR.json","view_paper":"https://pith.science/paper/FOXI62FR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.0378&json=true","fetch_graph":"https://pith.science/api/pith-number/FOXI62FR7IMGUQQJ2GAVWYNRRR/graph.json","fetch_events":"https://pith.science/api/pith-number/FOXI62FR7IMGUQQJ2GAVWYNRRR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FOXI62FR7IMGUQQJ2GAVWYNRRR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FOXI62FR7IMGUQQJ2GAVWYNRRR/action/storage_attestation","attest_author":"https://pith.science/pith/FOXI62FR7IMGUQQJ2GAVWYNRRR/action/author_attestation","sign_citation":"https://pith.science/pith/FOXI62FR7IMGUQQJ2GAVWYNRRR/action/citation_signature","submit_replication":"https://pith.science/pith/FOXI62FR7IMGUQQJ2GAVWYNRRR/action/replication_record"}},"created_at":"2026-05-18T02:50:41.067729+00:00","updated_at":"2026-05-18T02:50:41.067729+00:00"}