{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JQ4YWJDFTL3TEOU3I6LRCMIUNV","short_pith_number":"pith:JQ4YWJDF","schema_version":"1.0","canonical_sha256":"4c398b24659af7323a9b47971131146d57d9553f28a9defbcee3115188cf1ab7","source":{"kind":"arxiv","id":"1710.07089","version":1},"attestation_state":"computed","paper":{"title":"Spanning tree with lower bound on the degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Zolt\\'an Kir\\'aly","submitted_at":"2017-10-19T11:17:27Z","abstract_excerpt":"We concentrate on some recent results of Egawa and Ozeki [J. Graph Theory, 2015 and Combinatorica, 2014], and He et al. [J. Graph Theory, 2002]. We give shorter proofs and polynomial time algorithms as well.\n  We present two new proofs for the sufficient condition for having a spanning tree with prescribed lower bounds on the degrees, achieved recently by Egawa and Ozeki. The first one is a natural proof using induction, and the second one is a simple reduction to the theorem of Lov\\'asz. Using an algorithm of Frank we show that the condition of the theorem can be checked in time $O(m\\sqrt{n})"},"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":"1710.07089","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-19T11:17:27Z","cross_cats_sorted":[],"title_canon_sha256":"84d5bb9d33514c00d40ed61b26ca7989cb187b11e2bf4fd0ecff9e96b70eb7f6","abstract_canon_sha256":"c94cdbadbb201b4ab372459b6a1c6d2f71bff0c22678172772ae036e0c3cd9b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:27.025267Z","signature_b64":"rB3PgEZXtchkmgWMthuBp9tvtVmfkPXA2xjuEkTGySrbV98hpoeey3KRgo3HeD6wttenzJnG+YF2YS8uqqYUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c398b24659af7323a9b47971131146d57d9553f28a9defbcee3115188cf1ab7","last_reissued_at":"2026-05-18T00:32:27.024646Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:27.024646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spanning tree with lower bound on the degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Zolt\\'an Kir\\'aly","submitted_at":"2017-10-19T11:17:27Z","abstract_excerpt":"We concentrate on some recent results of Egawa and Ozeki [J. Graph Theory, 2015 and Combinatorica, 2014], and He et al. [J. Graph Theory, 2002]. We give shorter proofs and polynomial time algorithms as well.\n  We present two new proofs for the sufficient condition for having a spanning tree with prescribed lower bounds on the degrees, achieved recently by Egawa and Ozeki. The first one is a natural proof using induction, and the second one is a simple reduction to the theorem of Lov\\'asz. Using an algorithm of Frank we show that the condition of the theorem can be checked in time $O(m\\sqrt{n})"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07089","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":"1710.07089","created_at":"2026-05-18T00:32:27.024731+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.07089v1","created_at":"2026-05-18T00:32:27.024731+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07089","created_at":"2026-05-18T00:32:27.024731+00:00"},{"alias_kind":"pith_short_12","alias_value":"JQ4YWJDFTL3T","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JQ4YWJDFTL3TEOU3","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JQ4YWJDF","created_at":"2026-05-18T12:31:24.725408+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/JQ4YWJDFTL3TEOU3I6LRCMIUNV","json":"https://pith.science/pith/JQ4YWJDFTL3TEOU3I6LRCMIUNV.json","graph_json":"https://pith.science/api/pith-number/JQ4YWJDFTL3TEOU3I6LRCMIUNV/graph.json","events_json":"https://pith.science/api/pith-number/JQ4YWJDFTL3TEOU3I6LRCMIUNV/events.json","paper":"https://pith.science/paper/JQ4YWJDF"},"agent_actions":{"view_html":"https://pith.science/pith/JQ4YWJDFTL3TEOU3I6LRCMIUNV","download_json":"https://pith.science/pith/JQ4YWJDFTL3TEOU3I6LRCMIUNV.json","view_paper":"https://pith.science/paper/JQ4YWJDF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.07089&json=true","fetch_graph":"https://pith.science/api/pith-number/JQ4YWJDFTL3TEOU3I6LRCMIUNV/graph.json","fetch_events":"https://pith.science/api/pith-number/JQ4YWJDFTL3TEOU3I6LRCMIUNV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JQ4YWJDFTL3TEOU3I6LRCMIUNV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JQ4YWJDFTL3TEOU3I6LRCMIUNV/action/storage_attestation","attest_author":"https://pith.science/pith/JQ4YWJDFTL3TEOU3I6LRCMIUNV/action/author_attestation","sign_citation":"https://pith.science/pith/JQ4YWJDFTL3TEOU3I6LRCMIUNV/action/citation_signature","submit_replication":"https://pith.science/pith/JQ4YWJDFTL3TEOU3I6LRCMIUNV/action/replication_record"}},"created_at":"2026-05-18T00:32:27.024731+00:00","updated_at":"2026-05-18T00:32:27.024731+00:00"}