{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:F5CMNG7TD2QMHQYZ2XVLM2H5KR","short_pith_number":"pith:F5CMNG7T","schema_version":"1.0","canonical_sha256":"2f44c69bf31ea0c3c319d5eab668fd54778e347fb9dc3cdae89326fd534f706b","source":{"kind":"arxiv","id":"1702.04245","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.04245","created_at":"2026-05-18T00:50:48.619065+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.04245v1","created_at":"2026-05-18T00:50:48.619065+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04245","created_at":"2026-05-18T00:50:48.619065+00:00"},{"alias_kind":"pith_short_12","alias_value":"F5CMNG7TD2QM","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"F5CMNG7TD2QMHQYZ","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"F5CMNG7T","created_at":"2026-05-18T12:31:15.632608+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/F5CMNG7TD2QMHQYZ2XVLM2H5KR","json":"https://pith.science/pith/F5CMNG7TD2QMHQYZ2XVLM2H5KR.json","graph_json":"https://pith.science/api/pith-number/F5CMNG7TD2QMHQYZ2XVLM2H5KR/graph.json","events_json":"https://pith.science/api/pith-number/F5CMNG7TD2QMHQYZ2XVLM2H5KR/events.json","paper":"https://pith.science/paper/F5CMNG7T"},"agent_actions":{"view_html":"https://pith.science/pith/F5CMNG7TD2QMHQYZ2XVLM2H5KR","download_json":"https://pith.science/pith/F5CMNG7TD2QMHQYZ2XVLM2H5KR.json","view_paper":"https://pith.science/paper/F5CMNG7T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.04245&json=true","fetch_graph":"https://pith.science/api/pith-number/F5CMNG7TD2QMHQYZ2XVLM2H5KR/graph.json","fetch_events":"https://pith.science/api/pith-number/F5CMNG7TD2QMHQYZ2XVLM2H5KR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F5CMNG7TD2QMHQYZ2XVLM2H5KR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F5CMNG7TD2QMHQYZ2XVLM2H5KR/action/storage_attestation","attest_author":"https://pith.science/pith/F5CMNG7TD2QMHQYZ2XVLM2H5KR/action/author_attestation","sign_citation":"https://pith.science/pith/F5CMNG7TD2QMHQYZ2XVLM2H5KR/action/citation_signature","submit_replication":"https://pith.science/pith/F5CMNG7TD2QMHQYZ2XVLM2H5KR/action/replication_record"}},"created_at":"2026-05-18T00:50:48.619065+00:00","updated_at":"2026-05-18T00:50:48.619065+00:00"}