{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OTHN67XUIW35TJEV6YKEYSKMEK","short_pith_number":"pith:OTHN67XU","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"},"canonical_sha256":"74cedf7ef445b7d9a495f6144c494c22bc75313e16ac4e9b6da48c458edffe8a","source":{"kind":"arxiv","id":"1402.4277","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4277","created_at":"2026-05-18T02:57:35Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4277v2","created_at":"2026-05-18T02:57:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4277","created_at":"2026-05-18T02:57:35Z"},{"alias_kind":"pith_short_12","alias_value":"OTHN67XUIW35","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OTHN67XUIW35TJEV","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OTHN67XU","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OTHN67XUIW35TJEV6YKEYSKMEK","target":"record","payload":{"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"},"canonical_sha256":"74cedf7ef445b7d9a495f6144c494c22bc75313e16ac4e9b6da48c458edffe8a","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"},"source_kind":"arxiv","source_id":"1402.4277","source_version":2,"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-18T02:57:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cbEId/ijkssUdM3CHW1c77yxln+iFc5qsoPOqHoNvXdv5/yZwGzCdGqRJJ8isxGks0DI32ZCFaH4mzZskbE+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:03:10.670824Z"},"content_sha256":"d2f45a47f44699abf1ca46a9a1693bdd037bae317b6970179612e28efc2d0fc1","schema_version":"1.0","event_id":"sha256:d2f45a47f44699abf1ca46a9a1693bdd037bae317b6970179612e28efc2d0fc1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OTHN67XUIW35TJEV6YKEYSKMEK","target":"graph","payload":{"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"},"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-18T02:57:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PT6NK/fPk6ueQ1BLQEDdKikn33ByWR2K/ze6DICjCELn3XYAbf6DKLVnxN56hZ5keJYRyqxg9LCxbcsdumS4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:03:10.671558Z"},"content_sha256":"64003bd6d7e815d19be735ef4483e6c8a8b19f3b8090a5ebaa0e422f2aee6228","schema_version":"1.0","event_id":"sha256:64003bd6d7e815d19be735ef4483e6c8a8b19f3b8090a5ebaa0e422f2aee6228"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OTHN67XUIW35TJEV6YKEYSKMEK/bundle.json","state_url":"https://pith.science/pith/OTHN67XUIW35TJEV6YKEYSKMEK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OTHN67XUIW35TJEV6YKEYSKMEK/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-06-11T06:03:10Z","links":{"resolver":"https://pith.science/pith/OTHN67XUIW35TJEV6YKEYSKMEK","bundle":"https://pith.science/pith/OTHN67XUIW35TJEV6YKEYSKMEK/bundle.json","state":"https://pith.science/pith/OTHN67XUIW35TJEV6YKEYSKMEK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OTHN67XUIW35TJEV6YKEYSKMEK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OTHN67XUIW35TJEV6YKEYSKMEK","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":"65f1905bfc1c8c755543fd7586853612973b10fa0e9724e6f9a8052334c317ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-18T10:31:59Z","title_canon_sha256":"cccd1bb65d6a4a121f7285482b351766dccc31d2a0b660c45a8ea5941e0ccdbb"},"schema_version":"1.0","source":{"id":"1402.4277","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4277","created_at":"2026-05-18T02:57:35Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4277v2","created_at":"2026-05-18T02:57:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4277","created_at":"2026-05-18T02:57:35Z"},{"alias_kind":"pith_short_12","alias_value":"OTHN67XUIW35","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OTHN67XUIW35TJEV","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OTHN67XU","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:64003bd6d7e815d19be735ef4483e6c8a8b19f3b8090a5ebaa0e422f2aee6228","target":"graph","created_at":"2026-05-18T02:57:35Z","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":"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 ","authors_text":"A. Dress, A. Spillner, J. Koolen, K. T. Huber, V. Moulton","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-18T10:31:59Z","title":"Characterizing Block Graphs in Terms of their Vertex-Induced Partitions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4277","kind":"arxiv","version":2},"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:d2f45a47f44699abf1ca46a9a1693bdd037bae317b6970179612e28efc2d0fc1","target":"record","created_at":"2026-05-18T02:57:35Z","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":"65f1905bfc1c8c755543fd7586853612973b10fa0e9724e6f9a8052334c317ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-18T10:31:59Z","title_canon_sha256":"cccd1bb65d6a4a121f7285482b351766dccc31d2a0b660c45a8ea5941e0ccdbb"},"schema_version":"1.0","source":{"id":"1402.4277","kind":"arxiv","version":2}},"canonical_sha256":"74cedf7ef445b7d9a495f6144c494c22bc75313e16ac4e9b6da48c458edffe8a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74cedf7ef445b7d9a495f6144c494c22bc75313e16ac4e9b6da48c458edffe8a","first_computed_at":"2026-05-18T02:57:35.223415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:35.223415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4KQKK8Z1v1YkW3uMKJmF2CiWYPd4owcaOo51vu9ezWRAOWyfWUAI2diSbWrR6AkJvXTDXhX4gvMLOiJdMcotCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:35.224102Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.4277","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2f45a47f44699abf1ca46a9a1693bdd037bae317b6970179612e28efc2d0fc1","sha256:64003bd6d7e815d19be735ef4483e6c8a8b19f3b8090a5ebaa0e422f2aee6228"],"state_sha256":"67609e907e1ae5c83869ecefabde86bc04f9999c9e802bff9d4f6653d29b1a0c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uCUIzRo2q+nVc2zz9q4MF6hLJTvweGET3CUBiWHMpKqdQ+A/0LQ5SR8pXdbtfTP6sscbnqxCcMPPnxjxwTr5Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:03:10.675471Z","bundle_sha256":"8ad28c8b3afd390fd5f25e2aad7fabbb4ba4f38dc06e38db331ba4a25655a220"}}