{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:WWWYOQMZWH6OOT3OA326ZF7GWF","short_pith_number":"pith:WWWYOQMZ","schema_version":"1.0","canonical_sha256":"b5ad874199b1fce74f6e06f5ec97e6b1589076b7ff9e3bcd39e8eb75d93fc4c1","source":{"kind":"arxiv","id":"0912.2919","version":2},"attestation_state":"computed","paper":{"title":"Toughness and Vertex Degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D. Bauer, E. Schmeichel, H.J. Broersma, J. van den Heuvel, N. Kahl","submitted_at":"2009-12-15T15:10:31Z","abstract_excerpt":"We study theorems giving sufficient conditions on the vertex degrees of a graph $G$ to guarantee $G$ is $t$-tough. We first give a best monotone theorem when $t\\ge1$, but then show that for any integer $k\\ge1$, a best monotone theorem for $t=\\frac1k\\le 1$ requires at least $f(k)\\cdot|V(G)|$ nonredundant conditions, where $f(k)$ grows superpolynomially as $k\\rightarrow\\infty$. When $t<1$, we give an additional, simple theorem for $G$ to be $t$-tough, in terms of its vertex degrees."},"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":"0912.2919","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-12-15T15:10:31Z","cross_cats_sorted":[],"title_canon_sha256":"bd9a54b5e86ee4cbe1f25bc8f36fefe1f468ec1dc3b42fd3e56c385665b2bacb","abstract_canon_sha256":"29017ebf545b6bb5cc02719702cc2ddf2fe014a31754b2b67caeb0491f45622c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:13.738567Z","signature_b64":"/4+584/cLnb7/w502OH+M0M9WhyZMc24KUWomFqHkOiOPkz7B6EWtidVnqhEJwC2keU5/f9xGhx9AeM68iM3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5ad874199b1fce74f6e06f5ec97e6b1589076b7ff9e3bcd39e8eb75d93fc4c1","last_reissued_at":"2026-05-18T04:21:13.738005Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:13.738005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Toughness and Vertex Degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D. Bauer, E. Schmeichel, H.J. Broersma, J. van den Heuvel, N. Kahl","submitted_at":"2009-12-15T15:10:31Z","abstract_excerpt":"We study theorems giving sufficient conditions on the vertex degrees of a graph $G$ to guarantee $G$ is $t$-tough. We first give a best monotone theorem when $t\\ge1$, but then show that for any integer $k\\ge1$, a best monotone theorem for $t=\\frac1k\\le 1$ requires at least $f(k)\\cdot|V(G)|$ nonredundant conditions, where $f(k)$ grows superpolynomially as $k\\rightarrow\\infty$. When $t<1$, we give an additional, simple theorem for $G$ to be $t$-tough, in terms of its vertex degrees."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.2919","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0912.2919","created_at":"2026-05-18T04:21:13.738092+00:00"},{"alias_kind":"arxiv_version","alias_value":"0912.2919v2","created_at":"2026-05-18T04:21:13.738092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.2919","created_at":"2026-05-18T04:21:13.738092+00:00"},{"alias_kind":"pith_short_12","alias_value":"WWWYOQMZWH6O","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"WWWYOQMZWH6OOT3O","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"WWWYOQMZ","created_at":"2026-05-18T12:26:02.257875+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/WWWYOQMZWH6OOT3OA326ZF7GWF","json":"https://pith.science/pith/WWWYOQMZWH6OOT3OA326ZF7GWF.json","graph_json":"https://pith.science/api/pith-number/WWWYOQMZWH6OOT3OA326ZF7GWF/graph.json","events_json":"https://pith.science/api/pith-number/WWWYOQMZWH6OOT3OA326ZF7GWF/events.json","paper":"https://pith.science/paper/WWWYOQMZ"},"agent_actions":{"view_html":"https://pith.science/pith/WWWYOQMZWH6OOT3OA326ZF7GWF","download_json":"https://pith.science/pith/WWWYOQMZWH6OOT3OA326ZF7GWF.json","view_paper":"https://pith.science/paper/WWWYOQMZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0912.2919&json=true","fetch_graph":"https://pith.science/api/pith-number/WWWYOQMZWH6OOT3OA326ZF7GWF/graph.json","fetch_events":"https://pith.science/api/pith-number/WWWYOQMZWH6OOT3OA326ZF7GWF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WWWYOQMZWH6OOT3OA326ZF7GWF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WWWYOQMZWH6OOT3OA326ZF7GWF/action/storage_attestation","attest_author":"https://pith.science/pith/WWWYOQMZWH6OOT3OA326ZF7GWF/action/author_attestation","sign_citation":"https://pith.science/pith/WWWYOQMZWH6OOT3OA326ZF7GWF/action/citation_signature","submit_replication":"https://pith.science/pith/WWWYOQMZWH6OOT3OA326ZF7GWF/action/replication_record"}},"created_at":"2026-05-18T04:21:13.738092+00:00","updated_at":"2026-05-18T04:21:13.738092+00:00"}