{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:N26VWXMKSP7VK2RAPAQOQ6JQVZ","short_pith_number":"pith:N26VWXMK","schema_version":"1.0","canonical_sha256":"6ebd5b5d8a93ff556a207820e87930ae4a01e87dacedf4979798d78252463871","source":{"kind":"arxiv","id":"1811.11411","version":2},"attestation_state":"computed","paper":{"title":"The core index of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dinesh Pandey, Kamal Lochan Patra","submitted_at":"2018-11-28T07:03:11Z","abstract_excerpt":"For a graph $G,$ we denote the number of connected subgraphs of $G$ by $F(G)$. For a tree $T$, $F(T)$ has been studied extensively and it has been observed that $F(T)$ has a reverse correlation with Wiener index of $T$. Based on that, we call $F(G),$ the core index of $G$.\n  In this paper, we characterize the graphs which extremize the core index among all graphs on $n$ vertices with $k\\geq 0$ connected components. We extend our study of core index to unicyclic graphs and connected graphs with fixed number of pendant vertices. We obtained the unicyclic graphs which extremize the core index ove"},"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":"1811.11411","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-28T07:03:11Z","cross_cats_sorted":[],"title_canon_sha256":"061566d13f8663fc084de93bfbf33071d67280ef70883747fc865979c7c8fe34","abstract_canon_sha256":"3843ea373fe6271aeea2123a3a5f52eeff689d28b3aef7348e317f1e6f4a7542"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:45.384425Z","signature_b64":"2P9F9fLv2pwDvYz/NHYKVdiFBqgM1MnxHQHekFOXisN7KcD1bWB0OxPU8ERZlbUD8nTCYDAmmW9Ob/G+7u9YCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ebd5b5d8a93ff556a207820e87930ae4a01e87dacedf4979798d78252463871","last_reissued_at":"2026-05-17T23:48:45.383888Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:45.383888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The core index of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dinesh Pandey, Kamal Lochan Patra","submitted_at":"2018-11-28T07:03:11Z","abstract_excerpt":"For a graph $G,$ we denote the number of connected subgraphs of $G$ by $F(G)$. For a tree $T$, $F(T)$ has been studied extensively and it has been observed that $F(T)$ has a reverse correlation with Wiener index of $T$. Based on that, we call $F(G),$ the core index of $G$.\n  In this paper, we characterize the graphs which extremize the core index among all graphs on $n$ vertices with $k\\geq 0$ connected components. We extend our study of core index to unicyclic graphs and connected graphs with fixed number of pendant vertices. We obtained the unicyclic graphs which extremize the core index ove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11411","kind":"arxiv","version":2},"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":"1811.11411","created_at":"2026-05-17T23:48:45.383969+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.11411v2","created_at":"2026-05-17T23:48:45.383969+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11411","created_at":"2026-05-17T23:48:45.383969+00:00"},{"alias_kind":"pith_short_12","alias_value":"N26VWXMKSP7V","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"N26VWXMKSP7VK2RA","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"N26VWXMK","created_at":"2026-05-18T12:32:40.477152+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/N26VWXMKSP7VK2RAPAQOQ6JQVZ","json":"https://pith.science/pith/N26VWXMKSP7VK2RAPAQOQ6JQVZ.json","graph_json":"https://pith.science/api/pith-number/N26VWXMKSP7VK2RAPAQOQ6JQVZ/graph.json","events_json":"https://pith.science/api/pith-number/N26VWXMKSP7VK2RAPAQOQ6JQVZ/events.json","paper":"https://pith.science/paper/N26VWXMK"},"agent_actions":{"view_html":"https://pith.science/pith/N26VWXMKSP7VK2RAPAQOQ6JQVZ","download_json":"https://pith.science/pith/N26VWXMKSP7VK2RAPAQOQ6JQVZ.json","view_paper":"https://pith.science/paper/N26VWXMK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.11411&json=true","fetch_graph":"https://pith.science/api/pith-number/N26VWXMKSP7VK2RAPAQOQ6JQVZ/graph.json","fetch_events":"https://pith.science/api/pith-number/N26VWXMKSP7VK2RAPAQOQ6JQVZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N26VWXMKSP7VK2RAPAQOQ6JQVZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N26VWXMKSP7VK2RAPAQOQ6JQVZ/action/storage_attestation","attest_author":"https://pith.science/pith/N26VWXMKSP7VK2RAPAQOQ6JQVZ/action/author_attestation","sign_citation":"https://pith.science/pith/N26VWXMKSP7VK2RAPAQOQ6JQVZ/action/citation_signature","submit_replication":"https://pith.science/pith/N26VWXMKSP7VK2RAPAQOQ6JQVZ/action/replication_record"}},"created_at":"2026-05-17T23:48:45.383969+00:00","updated_at":"2026-05-17T23:48:45.383969+00:00"}