{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MGFOUZQJU63ZCR5DP4U6N66K42","short_pith_number":"pith:MGFOUZQJ","schema_version":"1.0","canonical_sha256":"618aea6609a7b79147a37f29e6fbcae68f935ae08d131699a68e1b45eec56173","source":{"kind":"arxiv","id":"1305.4557","version":4},"attestation_state":"computed","paper":{"title":"$k$-Blocks: a connectivity invariant for graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fabian Hundertmark, Johannes Carmesin, Matthias Hamann, Reinhard Diestel","submitted_at":"2013-05-20T15:34:13Z","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 fewer than $k$ other vertices. The block number $\\beta(G)$ of $G$ is the largest integer $k$ such that $G$ has a $k$-block.\n  We investigate how $\\beta$ interacts with density invariants of graphs, such as their minimum or average degree. We further present algorithms that decide whether a graph has a $k$-block, or which find all its $k$-blocks.\n  The connectivity invariant $\\beta(G)$ has a dual width invariant, the block-width ${\\rm bw}(G)$ of $G$. Our algorithms imply the duality t"},"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":"1305.4557","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-20T15:34:13Z","cross_cats_sorted":[],"title_canon_sha256":"bc740c28abea764e81cbfec51d371dc0911ecd6cbfa813e50837ade2f0d57e37","abstract_canon_sha256":"c7dfcc55f6761bbe323631322a988c8029c837ff1ecb497690c8ea79b86a70ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:55.939541Z","signature_b64":"OLH4/zUmxWAVG5fE4Y1V5T8fRvbpB9r0aAZPDOByt9P+KfRRAaFvz2YTXSkK7ILJdTU0sLjO4Bx1qQk392dxCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"618aea6609a7b79147a37f29e6fbcae68f935ae08d131699a68e1b45eec56173","last_reissued_at":"2026-05-18T01:25:55.938810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:55.938810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$k$-Blocks: a connectivity invariant for graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fabian Hundertmark, Johannes Carmesin, Matthias Hamann, Reinhard Diestel","submitted_at":"2013-05-20T15:34:13Z","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 fewer than $k$ other vertices. The block number $\\beta(G)$ of $G$ is the largest integer $k$ such that $G$ has a $k$-block.\n  We investigate how $\\beta$ interacts with density invariants of graphs, such as their minimum or average degree. We further present algorithms that decide whether a graph has a $k$-block, or which find all its $k$-blocks.\n  The connectivity invariant $\\beta(G)$ has a dual width invariant, the block-width ${\\rm bw}(G)$ of $G$. Our algorithms imply the duality t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4557","kind":"arxiv","version":4},"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":"1305.4557","created_at":"2026-05-18T01:25:55.938975+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.4557v4","created_at":"2026-05-18T01:25:55.938975+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4557","created_at":"2026-05-18T01:25:55.938975+00:00"},{"alias_kind":"pith_short_12","alias_value":"MGFOUZQJU63Z","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MGFOUZQJU63ZCR5D","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MGFOUZQJ","created_at":"2026-05-18T12:27:52.871228+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/MGFOUZQJU63ZCR5DP4U6N66K42","json":"https://pith.science/pith/MGFOUZQJU63ZCR5DP4U6N66K42.json","graph_json":"https://pith.science/api/pith-number/MGFOUZQJU63ZCR5DP4U6N66K42/graph.json","events_json":"https://pith.science/api/pith-number/MGFOUZQJU63ZCR5DP4U6N66K42/events.json","paper":"https://pith.science/paper/MGFOUZQJ"},"agent_actions":{"view_html":"https://pith.science/pith/MGFOUZQJU63ZCR5DP4U6N66K42","download_json":"https://pith.science/pith/MGFOUZQJU63ZCR5DP4U6N66K42.json","view_paper":"https://pith.science/paper/MGFOUZQJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.4557&json=true","fetch_graph":"https://pith.science/api/pith-number/MGFOUZQJU63ZCR5DP4U6N66K42/graph.json","fetch_events":"https://pith.science/api/pith-number/MGFOUZQJU63ZCR5DP4U6N66K42/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MGFOUZQJU63ZCR5DP4U6N66K42/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MGFOUZQJU63ZCR5DP4U6N66K42/action/storage_attestation","attest_author":"https://pith.science/pith/MGFOUZQJU63ZCR5DP4U6N66K42/action/author_attestation","sign_citation":"https://pith.science/pith/MGFOUZQJU63ZCR5DP4U6N66K42/action/citation_signature","submit_replication":"https://pith.science/pith/MGFOUZQJU63ZCR5DP4U6N66K42/action/replication_record"}},"created_at":"2026-05-18T01:25:55.938975+00:00","updated_at":"2026-05-18T01:25:55.938975+00:00"}