{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:F5CMNG7TD2QMHQYZ2XVLM2H5KR","short_pith_number":"pith:F5CMNG7T","canonical_record":{"source":{"id":"1702.04245","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-14T14:55:56Z","cross_cats_sorted":[],"title_canon_sha256":"47c155db0be008860c855bdc47c307ad2d4648f65142e438e8dda8e3da95b9f5","abstract_canon_sha256":"d0792fecf81ff1683b5c1ff69f7c6dcb23f0a84192d01fc8519050da71bc9b09"},"schema_version":"1.0"},"canonical_sha256":"2f44c69bf31ea0c3c319d5eab668fd54778e347fb9dc3cdae89326fd534f706b","source":{"kind":"arxiv","id":"1702.04245","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04245","created_at":"2026-05-18T00:50:48Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04245v1","created_at":"2026-05-18T00:50:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04245","created_at":"2026-05-18T00:50:48Z"},{"alias_kind":"pith_short_12","alias_value":"F5CMNG7TD2QM","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"F5CMNG7TD2QMHQYZ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"F5CMNG7T","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:F5CMNG7TD2QMHQYZ2XVLM2H5KR","target":"record","payload":{"canonical_record":{"source":{"id":"1702.04245","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-14T14:55:56Z","cross_cats_sorted":[],"title_canon_sha256":"47c155db0be008860c855bdc47c307ad2d4648f65142e438e8dda8e3da95b9f5","abstract_canon_sha256":"d0792fecf81ff1683b5c1ff69f7c6dcb23f0a84192d01fc8519050da71bc9b09"},"schema_version":"1.0"},"canonical_sha256":"2f44c69bf31ea0c3c319d5eab668fd54778e347fb9dc3cdae89326fd534f706b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:48.619598Z","signature_b64":"OWMbCJlz6C3y8RYx3oEVBnQgPQPC/Ztytib8Xtv7RhOTZZ93UAA34KhxLwfPCjw61IHUOgS8kPOx9nYNa6bgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f44c69bf31ea0c3c319d5eab668fd54778e347fb9dc3cdae89326fd534f706b","last_reissued_at":"2026-05-18T00:50:48.618970Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:48.618970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.04245","source_version":1,"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-18T00:50:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sw639lCGhRFrFoAbmpQpVxoFP9mYkcvjrzPAIbWNlgzh4gaRpuV88b37IpPkQlJx/g45/hB1fSDyyzlDy7+SDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T06:08:36.217788Z"},"content_sha256":"6402354a5ff534960cdab1284458e530f0791d9268acbeca8b94eca76b28cdd6","schema_version":"1.0","event_id":"sha256:6402354a5ff534960cdab1284458e530f0791d9268acbeca8b94eca76b28cdd6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:F5CMNG7TD2QMHQYZ2XVLM2H5KR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the block number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Wei{\\ss}auer","submitted_at":"2017-02-14T14:55:56Z","abstract_excerpt":"A $k$-block in a graph $G$ is a maximal set of at least $k$ vertices no two of which can be separated in $G$ by deleting fewer than $k$ vertices. The block number $\\beta(G)$ of $G$ is the maximum integer $k$ for which $G$ contains a $k$-block.\n  We prove a structure theorem for graphs without a $(k+1)$-block, showing that every such graph has a tree-decomposition in which every torso has at most $k$ vertices of degree $2k^2$ or greater. This yields a qualitative duality, since every graph that admits such a decomposition has block number at most $2k^2$.\n  We also study $k$-blocks in graphs fro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04245","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"},"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-18T00:50:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I0zQZPHDRjQQ/J4Ss2o0S6/hQIqQ+2uey6G+RuRLKOzvFSh3BIg4Q20J3eeJ1KWxj3MjMVxlIOPKWW739HWtDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T06:08:36.218129Z"},"content_sha256":"01a30e5b6795400c575fac0d0e49ff69dbf5536580d733149a2e5c8f692aa88f","schema_version":"1.0","event_id":"sha256:01a30e5b6795400c575fac0d0e49ff69dbf5536580d733149a2e5c8f692aa88f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F5CMNG7TD2QMHQYZ2XVLM2H5KR/bundle.json","state_url":"https://pith.science/pith/F5CMNG7TD2QMHQYZ2XVLM2H5KR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F5CMNG7TD2QMHQYZ2XVLM2H5KR/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-12T06:08:36Z","links":{"resolver":"https://pith.science/pith/F5CMNG7TD2QMHQYZ2XVLM2H5KR","bundle":"https://pith.science/pith/F5CMNG7TD2QMHQYZ2XVLM2H5KR/bundle.json","state":"https://pith.science/pith/F5CMNG7TD2QMHQYZ2XVLM2H5KR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F5CMNG7TD2QMHQYZ2XVLM2H5KR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:F5CMNG7TD2QMHQYZ2XVLM2H5KR","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":"d0792fecf81ff1683b5c1ff69f7c6dcb23f0a84192d01fc8519050da71bc9b09","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-14T14:55:56Z","title_canon_sha256":"47c155db0be008860c855bdc47c307ad2d4648f65142e438e8dda8e3da95b9f5"},"schema_version":"1.0","source":{"id":"1702.04245","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04245","created_at":"2026-05-18T00:50:48Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04245v1","created_at":"2026-05-18T00:50:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04245","created_at":"2026-05-18T00:50:48Z"},{"alias_kind":"pith_short_12","alias_value":"F5CMNG7TD2QM","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"F5CMNG7TD2QMHQYZ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"F5CMNG7T","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:01a30e5b6795400c575fac0d0e49ff69dbf5536580d733149a2e5c8f692aa88f","target":"graph","created_at":"2026-05-18T00:50:48Z","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":"A $k$-block in a graph $G$ is a maximal set of at least $k$ vertices no two of which can be separated in $G$ by deleting fewer than $k$ vertices. The block number $\\beta(G)$ of $G$ is the maximum integer $k$ for which $G$ contains a $k$-block.\n  We prove a structure theorem for graphs without a $(k+1)$-block, showing that every such graph has a tree-decomposition in which every torso has at most $k$ vertices of degree $2k^2$ or greater. This yields a qualitative duality, since every graph that admits such a decomposition has block number at most $2k^2$.\n  We also study $k$-blocks in graphs fro","authors_text":"Daniel Wei{\\ss}auer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-14T14:55:56Z","title":"On the block number of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04245","kind":"arxiv","version":1},"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:6402354a5ff534960cdab1284458e530f0791d9268acbeca8b94eca76b28cdd6","target":"record","created_at":"2026-05-18T00:50:48Z","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":"d0792fecf81ff1683b5c1ff69f7c6dcb23f0a84192d01fc8519050da71bc9b09","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-14T14:55:56Z","title_canon_sha256":"47c155db0be008860c855bdc47c307ad2d4648f65142e438e8dda8e3da95b9f5"},"schema_version":"1.0","source":{"id":"1702.04245","kind":"arxiv","version":1}},"canonical_sha256":"2f44c69bf31ea0c3c319d5eab668fd54778e347fb9dc3cdae89326fd534f706b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f44c69bf31ea0c3c319d5eab668fd54778e347fb9dc3cdae89326fd534f706b","first_computed_at":"2026-05-18T00:50:48.618970Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:48.618970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OWMbCJlz6C3y8RYx3oEVBnQgPQPC/Ztytib8Xtv7RhOTZZ93UAA34KhxLwfPCjw61IHUOgS8kPOx9nYNa6bgDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:48.619598Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.04245","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6402354a5ff534960cdab1284458e530f0791d9268acbeca8b94eca76b28cdd6","sha256:01a30e5b6795400c575fac0d0e49ff69dbf5536580d733149a2e5c8f692aa88f"],"state_sha256":"0c2b2e9fd0776fc67aaf36983d68629ba927e012fc205034caca44c7a3267f66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AO/HhJ/p388QwMdLDPBo2A+Y82vJ+rxemrd9LX4GOxE4qdoQz08ej5mTiy3M7fT09rXufMC7US/kkwRTuhCpDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T06:08:36.220144Z","bundle_sha256":"cbd9d4c21bbe6c1b6475a0d38cbe4243f67246ff658ccdf25038e396d93a9f06"}}