{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OTHN67XUIW35TJEV6YKEYSKMEK","short_pith_number":"pith:OTHN67XU","schema_version":"1.0","canonical_sha256":"74cedf7ef445b7d9a495f6144c494c22bc75313e16ac4e9b6da48c458edffe8a","source":{"kind":"arxiv","id":"1402.4277","version":2},"attestation_state":"computed","paper":{"title":"Characterizing Block Graphs in Terms of their Vertex-Induced Partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Dress, A. Spillner, J. Koolen, K. T. Huber, V. Moulton","submitted_at":"2014-02-18T10:31:59Z","abstract_excerpt":"Given a finite connected simple graph $G=(V,E)$ with vertex set $V$ and edge set $E\\subseteq \\binom{V}{2}$, we will show that\n  $1.$ the (necessarily unique) smallest block graph with vertex set $V$ whose edge set contains $E$ is uniquely determined by the $V$-indexed family ${\\bf P}_G:=\\big(\\pi_0(G^{(v)})\\big)_{v \\in V}$ of the various partitions $\\pi_0(G^{(v)})$ of the set $V$ into the set of connected components of the graph $G^{(v)}:=(V,\\{e\\in E: v\\notin e\\})$,\n  $2.$ the edge set of this block graph coincides with set of all $2$-subsets $\\{u,v\\}$ of $V$ for which $u$ and $v$ are, for all "},"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":"1402.4277","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-18T10:31:59Z","cross_cats_sorted":[],"title_canon_sha256":"cccd1bb65d6a4a121f7285482b351766dccc31d2a0b660c45a8ea5941e0ccdbb","abstract_canon_sha256":"65f1905bfc1c8c755543fd7586853612973b10fa0e9724e6f9a8052334c317ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:35.224102Z","signature_b64":"4KQKK8Z1v1YkW3uMKJmF2CiWYPd4owcaOo51vu9ezWRAOWyfWUAI2diSbWrR6AkJvXTDXhX4gvMLOiJdMcotCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74cedf7ef445b7d9a495f6144c494c22bc75313e16ac4e9b6da48c458edffe8a","last_reissued_at":"2026-05-18T02:57:35.223415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:35.223415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterizing Block Graphs in Terms of their Vertex-Induced Partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Dress, A. Spillner, J. Koolen, K. T. Huber, V. Moulton","submitted_at":"2014-02-18T10:31:59Z","abstract_excerpt":"Given a finite connected simple graph $G=(V,E)$ with vertex set $V$ and edge set $E\\subseteq \\binom{V}{2}$, we will show that\n  $1.$ the (necessarily unique) smallest block graph with vertex set $V$ whose edge set contains $E$ is uniquely determined by the $V$-indexed family ${\\bf P}_G:=\\big(\\pi_0(G^{(v)})\\big)_{v \\in V}$ of the various partitions $\\pi_0(G^{(v)})$ of the set $V$ into the set of connected components of the graph $G^{(v)}:=(V,\\{e\\in E: v\\notin e\\})$,\n  $2.$ the edge set of this block graph coincides with set of all $2$-subsets $\\{u,v\\}$ of $V$ for which $u$ and $v$ are, for all "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4277","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":"1402.4277","created_at":"2026-05-18T02:57:35.223537+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.4277v2","created_at":"2026-05-18T02:57:35.223537+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4277","created_at":"2026-05-18T02:57:35.223537+00:00"},{"alias_kind":"pith_short_12","alias_value":"OTHN67XUIW35","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OTHN67XUIW35TJEV","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OTHN67XU","created_at":"2026-05-18T12:28:43.426989+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/OTHN67XUIW35TJEV6YKEYSKMEK","json":"https://pith.science/pith/OTHN67XUIW35TJEV6YKEYSKMEK.json","graph_json":"https://pith.science/api/pith-number/OTHN67XUIW35TJEV6YKEYSKMEK/graph.json","events_json":"https://pith.science/api/pith-number/OTHN67XUIW35TJEV6YKEYSKMEK/events.json","paper":"https://pith.science/paper/OTHN67XU"},"agent_actions":{"view_html":"https://pith.science/pith/OTHN67XUIW35TJEV6YKEYSKMEK","download_json":"https://pith.science/pith/OTHN67XUIW35TJEV6YKEYSKMEK.json","view_paper":"https://pith.science/paper/OTHN67XU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.4277&json=true","fetch_graph":"https://pith.science/api/pith-number/OTHN67XUIW35TJEV6YKEYSKMEK/graph.json","fetch_events":"https://pith.science/api/pith-number/OTHN67XUIW35TJEV6YKEYSKMEK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OTHN67XUIW35TJEV6YKEYSKMEK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OTHN67XUIW35TJEV6YKEYSKMEK/action/storage_attestation","attest_author":"https://pith.science/pith/OTHN67XUIW35TJEV6YKEYSKMEK/action/author_attestation","sign_citation":"https://pith.science/pith/OTHN67XUIW35TJEV6YKEYSKMEK/action/citation_signature","submit_replication":"https://pith.science/pith/OTHN67XUIW35TJEV6YKEYSKMEK/action/replication_record"}},"created_at":"2026-05-18T02:57:35.223537+00:00","updated_at":"2026-05-18T02:57:35.223537+00:00"}