{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:3O5F7ATMMFO2JNU4YM7A2N2TK2","short_pith_number":"pith:3O5F7ATM","schema_version":"1.0","canonical_sha256":"dbba5f826c615da4b69cc33e0d375356b6af676f17e0c15a9c1a0c3717b6624f","source":{"kind":"arxiv","id":"2210.10590","version":1},"attestation_state":"computed","paper":{"title":"Toughness of recursively partitionable graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brandon Du Preez, Calum Buchanan, K. E. Perry, Puck Rombach","submitted_at":"2022-10-19T14:31:59Z","abstract_excerpt":"A simple graph $G=(V,E)$ on $n$ vertices is said to be recursively partitionable (RP) if $G \\simeq K_1$, or if $G$ is connected and satisfies the following recursive property: for every integer partition $a_1, a_2, \\dots, a_k$ of $n$, there is a partition $\\{A_1, A_2, \\dots, A_k\\}$ of $V$ such that each $|A_i|=a_i$, and each induced subgraph $G[A_i]$ is RP ($1\\leq i \\leq k$). We show that if $S$ is a vertex cut of an RP graph $G$ with $|S|\\geq 2$, then $G-S$ has at most $3|S|-1$ components. Moreover, this bound is sharp for $|S|=3$. We present two methods for constructing new RP graphs from ol"},"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":"2210.10590","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-10-19T14:31:59Z","cross_cats_sorted":[],"title_canon_sha256":"d5354d57dcd61d6e0ed1ef4c463d353f84876474957b2195a181ef9564992eec","abstract_canon_sha256":"007bafcb2300dfa994a896283d0754df4e9d13ec908d9f308f1fa4d524a08062"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:08:21.293884Z","signature_b64":"073ly4wKXCY87TQZ8QRuHHp5efdWmUDRboVuFJF4lPcO/QITetimFt4ogHSFxhnUEHPo9fZqsX9tMKRqCs6IDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbba5f826c615da4b69cc33e0d375356b6af676f17e0c15a9c1a0c3717b6624f","last_reissued_at":"2026-07-05T05:08:21.293474Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:08:21.293474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Toughness of recursively partitionable graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brandon Du Preez, Calum Buchanan, K. E. Perry, Puck Rombach","submitted_at":"2022-10-19T14:31:59Z","abstract_excerpt":"A simple graph $G=(V,E)$ on $n$ vertices is said to be recursively partitionable (RP) if $G \\simeq K_1$, or if $G$ is connected and satisfies the following recursive property: for every integer partition $a_1, a_2, \\dots, a_k$ of $n$, there is a partition $\\{A_1, A_2, \\dots, A_k\\}$ of $V$ such that each $|A_i|=a_i$, and each induced subgraph $G[A_i]$ is RP ($1\\leq i \\leq k$). We show that if $S$ is a vertex cut of an RP graph $G$ with $|S|\\geq 2$, then $G-S$ has at most $3|S|-1$ components. Moreover, this bound is sharp for $|S|=3$. We present two methods for constructing new RP graphs from ol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.10590","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.10590/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2210.10590","created_at":"2026-07-05T05:08:21.293550+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.10590v1","created_at":"2026-07-05T05:08:21.293550+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.10590","created_at":"2026-07-05T05:08:21.293550+00:00"},{"alias_kind":"pith_short_12","alias_value":"3O5F7ATMMFO2","created_at":"2026-07-05T05:08:21.293550+00:00"},{"alias_kind":"pith_short_16","alias_value":"3O5F7ATMMFO2JNU4","created_at":"2026-07-05T05:08:21.293550+00:00"},{"alias_kind":"pith_short_8","alias_value":"3O5F7ATM","created_at":"2026-07-05T05:08:21.293550+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/3O5F7ATMMFO2JNU4YM7A2N2TK2","json":"https://pith.science/pith/3O5F7ATMMFO2JNU4YM7A2N2TK2.json","graph_json":"https://pith.science/api/pith-number/3O5F7ATMMFO2JNU4YM7A2N2TK2/graph.json","events_json":"https://pith.science/api/pith-number/3O5F7ATMMFO2JNU4YM7A2N2TK2/events.json","paper":"https://pith.science/paper/3O5F7ATM"},"agent_actions":{"view_html":"https://pith.science/pith/3O5F7ATMMFO2JNU4YM7A2N2TK2","download_json":"https://pith.science/pith/3O5F7ATMMFO2JNU4YM7A2N2TK2.json","view_paper":"https://pith.science/paper/3O5F7ATM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.10590&json=true","fetch_graph":"https://pith.science/api/pith-number/3O5F7ATMMFO2JNU4YM7A2N2TK2/graph.json","fetch_events":"https://pith.science/api/pith-number/3O5F7ATMMFO2JNU4YM7A2N2TK2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3O5F7ATMMFO2JNU4YM7A2N2TK2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3O5F7ATMMFO2JNU4YM7A2N2TK2/action/storage_attestation","attest_author":"https://pith.science/pith/3O5F7ATMMFO2JNU4YM7A2N2TK2/action/author_attestation","sign_citation":"https://pith.science/pith/3O5F7ATMMFO2JNU4YM7A2N2TK2/action/citation_signature","submit_replication":"https://pith.science/pith/3O5F7ATMMFO2JNU4YM7A2N2TK2/action/replication_record"}},"created_at":"2026-07-05T05:08:21.293550+00:00","updated_at":"2026-07-05T05:08:21.293550+00:00"}