{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JQ4YWJDFTL3TEOU3I6LRCMIUNV","short_pith_number":"pith:JQ4YWJDF","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"},"canonical_sha256":"4c398b24659af7323a9b47971131146d57d9553f28a9defbcee3115188cf1ab7","source":{"kind":"arxiv","id":"1710.07089","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07089","created_at":"2026-05-18T00:32:27Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07089v1","created_at":"2026-05-18T00:32:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07089","created_at":"2026-05-18T00:32:27Z"},{"alias_kind":"pith_short_12","alias_value":"JQ4YWJDFTL3T","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JQ4YWJDFTL3TEOU3","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JQ4YWJDF","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JQ4YWJDFTL3TEOU3I6LRCMIUNV","target":"record","payload":{"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"},"canonical_sha256":"4c398b24659af7323a9b47971131146d57d9553f28a9defbcee3115188cf1ab7","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"},"source_kind":"arxiv","source_id":"1710.07089","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:32:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SD9THjdoqIrqrrOFcWPjuZYMsZpeqmPpP4vUyB2MtsSx10V21l2LAkruEUBJXW8xq0SDujB+sRrUmgqTt4gpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:24:32.324741Z"},"content_sha256":"3e46e5e06ad94ff1f001a87ec834adba82ad55137e5cc05884ec427b51943d74","schema_version":"1.0","event_id":"sha256:3e46e5e06ad94ff1f001a87ec834adba82ad55137e5cc05884ec427b51943d74"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JQ4YWJDFTL3TEOU3I6LRCMIUNV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:32:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xaBDG8bCxw7TKPVlxgpcFjvxomLAPEHCHOOjCfdOeOF9bRZX1R2Qr+4cgQWRp5WQd64zldR/G+u7sTv7HIHDDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:24:32.325478Z"},"content_sha256":"2dd3e28d02b2ba216b898fcd5424f97e7aa3f245b780959164a24838cfdea66e","schema_version":"1.0","event_id":"sha256:2dd3e28d02b2ba216b898fcd5424f97e7aa3f245b780959164a24838cfdea66e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JQ4YWJDFTL3TEOU3I6LRCMIUNV/bundle.json","state_url":"https://pith.science/pith/JQ4YWJDFTL3TEOU3I6LRCMIUNV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JQ4YWJDFTL3TEOU3I6LRCMIUNV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T21:24:32Z","links":{"resolver":"https://pith.science/pith/JQ4YWJDFTL3TEOU3I6LRCMIUNV","bundle":"https://pith.science/pith/JQ4YWJDFTL3TEOU3I6LRCMIUNV/bundle.json","state":"https://pith.science/pith/JQ4YWJDFTL3TEOU3I6LRCMIUNV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JQ4YWJDFTL3TEOU3I6LRCMIUNV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JQ4YWJDFTL3TEOU3I6LRCMIUNV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c94cdbadbb201b4ab372459b6a1c6d2f71bff0c22678172772ae036e0c3cd9b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-19T11:17:27Z","title_canon_sha256":"84d5bb9d33514c00d40ed61b26ca7989cb187b11e2bf4fd0ecff9e96b70eb7f6"},"schema_version":"1.0","source":{"id":"1710.07089","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07089","created_at":"2026-05-18T00:32:27Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07089v1","created_at":"2026-05-18T00:32:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07089","created_at":"2026-05-18T00:32:27Z"},{"alias_kind":"pith_short_12","alias_value":"JQ4YWJDFTL3T","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JQ4YWJDFTL3TEOU3","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JQ4YWJDF","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:2dd3e28d02b2ba216b898fcd5424f97e7aa3f245b780959164a24838cfdea66e","target":"graph","created_at":"2026-05-18T00:32:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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})","authors_text":"Zolt\\'an Kir\\'aly","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-19T11:17:27Z","title":"Spanning tree with lower bound on the degrees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07089","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3e46e5e06ad94ff1f001a87ec834adba82ad55137e5cc05884ec427b51943d74","target":"record","created_at":"2026-05-18T00:32:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c94cdbadbb201b4ab372459b6a1c6d2f71bff0c22678172772ae036e0c3cd9b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-19T11:17:27Z","title_canon_sha256":"84d5bb9d33514c00d40ed61b26ca7989cb187b11e2bf4fd0ecff9e96b70eb7f6"},"schema_version":"1.0","source":{"id":"1710.07089","kind":"arxiv","version":1}},"canonical_sha256":"4c398b24659af7323a9b47971131146d57d9553f28a9defbcee3115188cf1ab7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c398b24659af7323a9b47971131146d57d9553f28a9defbcee3115188cf1ab7","first_computed_at":"2026-05-18T00:32:27.024646Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:27.024646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rB3PgEZXtchkmgWMthuBp9tvtVmfkPXA2xjuEkTGySrbV98hpoeey3KRgo3HeD6wttenzJnG+YF2YS8uqqYUCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:27.025267Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.07089","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e46e5e06ad94ff1f001a87ec834adba82ad55137e5cc05884ec427b51943d74","sha256:2dd3e28d02b2ba216b898fcd5424f97e7aa3f245b780959164a24838cfdea66e"],"state_sha256":"6d80f700a919c464680064a2caf013c0e3d898eb0fd8f7f40b373579907d4b6e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qfXt5paUHfJxQFe7T5LqanAMgzmZQS78c0EhanNyNwJw704xsXfC+xWtjdhbuEYvMJwgp/IKmg1m+rgxx+d0Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T21:24:32.330161Z","bundle_sha256":"129abaadff1659030143909975518db1ac72468cc4ed575044db455b24468605"}}