{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:H6MJY2S6A4XWINWQI6BWYUZ3C4","short_pith_number":"pith:H6MJY2S6","schema_version":"1.0","canonical_sha256":"3f989c6a5e072f6436d047836c533b1704f832707130c4ef964639d40259f108","source":{"kind":"arxiv","id":"1811.05430","version":1},"attestation_state":"computed","paper":{"title":"On the Mean Order of Connected Induced Subgraphs of Block Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kristaps J. Balodis, Lucas Mol, Matthew E. Kroeker, Ortrud R. Oellermann","submitted_at":"2018-11-13T17:43:11Z","abstract_excerpt":"The average order of the connected induced subgraphs of a graph $G$ is called the mean connected induced subgraph (CIS) order of $G$. This is an extension of the mean subtree order of a tree, first studied by Jamison. In this article, we demonstrate that among all connected block graphs of order $n$, the path $P_n$ has minimum mean CIS order. This extends a result of Jamison from trees to connected block graphs, and supports the conjecture of Kroeker, Mol, and Oellermann that $P_n$ has minimum mean CIS order among all connected graphs of order $n$."},"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.05430","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-13T17:43:11Z","cross_cats_sorted":[],"title_canon_sha256":"e45242404575f44e4179f27ca7fe57ddfd5561d984a9c16a36eb8560851007fb","abstract_canon_sha256":"8c7cc2de3d0905dc0ad950d9fafa063a10d0f9ca946b10bc0ba9dd12ae00184b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:46.159898Z","signature_b64":"QVPdfAVHfEHimEHyfAUaookFj5nb9BBQMZ76WYnCPqeCQJj8PXl3ABr7EC+M7PheVgQTudNuTfW30HVbhz3ODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f989c6a5e072f6436d047836c533b1704f832707130c4ef964639d40259f108","last_reissued_at":"2026-05-18T00:00:46.159413Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:46.159413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Mean Order of Connected Induced Subgraphs of Block Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kristaps J. Balodis, Lucas Mol, Matthew E. Kroeker, Ortrud R. Oellermann","submitted_at":"2018-11-13T17:43:11Z","abstract_excerpt":"The average order of the connected induced subgraphs of a graph $G$ is called the mean connected induced subgraph (CIS) order of $G$. This is an extension of the mean subtree order of a tree, first studied by Jamison. In this article, we demonstrate that among all connected block graphs of order $n$, the path $P_n$ has minimum mean CIS order. This extends a result of Jamison from trees to connected block graphs, and supports the conjecture of Kroeker, Mol, and Oellermann that $P_n$ has minimum mean CIS order among all connected graphs of order $n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05430","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":"1811.05430","created_at":"2026-05-18T00:00:46.159498+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.05430v1","created_at":"2026-05-18T00:00:46.159498+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05430","created_at":"2026-05-18T00:00:46.159498+00:00"},{"alias_kind":"pith_short_12","alias_value":"H6MJY2S6A4XW","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"H6MJY2S6A4XWINWQ","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"H6MJY2S6","created_at":"2026-05-18T12:32:28.185984+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/H6MJY2S6A4XWINWQI6BWYUZ3C4","json":"https://pith.science/pith/H6MJY2S6A4XWINWQI6BWYUZ3C4.json","graph_json":"https://pith.science/api/pith-number/H6MJY2S6A4XWINWQI6BWYUZ3C4/graph.json","events_json":"https://pith.science/api/pith-number/H6MJY2S6A4XWINWQI6BWYUZ3C4/events.json","paper":"https://pith.science/paper/H6MJY2S6"},"agent_actions":{"view_html":"https://pith.science/pith/H6MJY2S6A4XWINWQI6BWYUZ3C4","download_json":"https://pith.science/pith/H6MJY2S6A4XWINWQI6BWYUZ3C4.json","view_paper":"https://pith.science/paper/H6MJY2S6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.05430&json=true","fetch_graph":"https://pith.science/api/pith-number/H6MJY2S6A4XWINWQI6BWYUZ3C4/graph.json","fetch_events":"https://pith.science/api/pith-number/H6MJY2S6A4XWINWQI6BWYUZ3C4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H6MJY2S6A4XWINWQI6BWYUZ3C4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H6MJY2S6A4XWINWQI6BWYUZ3C4/action/storage_attestation","attest_author":"https://pith.science/pith/H6MJY2S6A4XWINWQI6BWYUZ3C4/action/author_attestation","sign_citation":"https://pith.science/pith/H6MJY2S6A4XWINWQI6BWYUZ3C4/action/citation_signature","submit_replication":"https://pith.science/pith/H6MJY2S6A4XWINWQI6BWYUZ3C4/action/replication_record"}},"created_at":"2026-05-18T00:00:46.159498+00:00","updated_at":"2026-05-18T00:00:46.159498+00:00"}