{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ONM7WRL2WAK3RN2ABLNWJ4VB3J","short_pith_number":"pith:ONM7WRL2","schema_version":"1.0","canonical_sha256":"7359fb457ab015b8b7400adb64f2a1da506eda6c98afa1ca902b1858e8f33e87","source":{"kind":"arxiv","id":"1703.08502","version":2},"attestation_state":"computed","paper":{"title":"Partitions of multigraphs under degree constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Stiebitz, Thomas Schweser","submitted_at":"2017-03-24T16:53:14Z","abstract_excerpt":"In 1996, Michael Stiebitz proved that if $G$ is a simple graph with $\\delta(G)\\geq s+t+1$ and $s,t\\in \\mathbb{Z}_{\\geq 0}$, then $V(G)$ can be partitioned into two sets $A$ and $B$ such that $\\delta(G[A])\\geq s$ and $\\delta(G[B])\\geq t$. In 2016, Amir Ban proved a similar result for weighted graphs. Let $G$ be a simple graph with at least two vertices, let $w:E(G) \\to \\mathbb{r}_{>0}$ be a weight function, let $s,t \\in \\mathbb{R}_{\\geq 0}$, and let $W=\\max_{e\\in E(G)} w(e)$. If $\\delta(G)\\geq s+t+2W$, then $V(G)$ can be partitioned into two sets $A$ and $B$ such that $\\delta(G[A])\\geq s$ and $"},"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":"1703.08502","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-24T16:53:14Z","cross_cats_sorted":[],"title_canon_sha256":"1fead69dde1aebc0db5675d0ba27bf312b9960f0909dc095152d701c976f4142","abstract_canon_sha256":"855bc5abd508ba779d9ca153989657d7607a16555437e9cc1172832e35d1cf24"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:36.258955Z","signature_b64":"vdBs3Sjqh5YNLnBMf8ckcle99DDrrX5aO3qrsiHPGpoij0S99AZFfwZlTpl4LAiWlaMoHVPy4rD766uZ5yj8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7359fb457ab015b8b7400adb64f2a1da506eda6c98afa1ca902b1858e8f33e87","last_reissued_at":"2026-05-18T00:39:36.258379Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:36.258379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partitions of multigraphs under degree constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Stiebitz, Thomas Schweser","submitted_at":"2017-03-24T16:53:14Z","abstract_excerpt":"In 1996, Michael Stiebitz proved that if $G$ is a simple graph with $\\delta(G)\\geq s+t+1$ and $s,t\\in \\mathbb{Z}_{\\geq 0}$, then $V(G)$ can be partitioned into two sets $A$ and $B$ such that $\\delta(G[A])\\geq s$ and $\\delta(G[B])\\geq t$. In 2016, Amir Ban proved a similar result for weighted graphs. Let $G$ be a simple graph with at least two vertices, let $w:E(G) \\to \\mathbb{r}_{>0}$ be a weight function, let $s,t \\in \\mathbb{R}_{\\geq 0}$, and let $W=\\max_{e\\in E(G)} w(e)$. If $\\delta(G)\\geq s+t+2W$, then $V(G)$ can be partitioned into two sets $A$ and $B$ such that $\\delta(G[A])\\geq s$ and $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08502","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":"1703.08502","created_at":"2026-05-18T00:39:36.258469+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.08502v2","created_at":"2026-05-18T00:39:36.258469+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08502","created_at":"2026-05-18T00:39:36.258469+00:00"},{"alias_kind":"pith_short_12","alias_value":"ONM7WRL2WAK3","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"ONM7WRL2WAK3RN2A","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"ONM7WRL2","created_at":"2026-05-18T12:31:34.259226+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/ONM7WRL2WAK3RN2ABLNWJ4VB3J","json":"https://pith.science/pith/ONM7WRL2WAK3RN2ABLNWJ4VB3J.json","graph_json":"https://pith.science/api/pith-number/ONM7WRL2WAK3RN2ABLNWJ4VB3J/graph.json","events_json":"https://pith.science/api/pith-number/ONM7WRL2WAK3RN2ABLNWJ4VB3J/events.json","paper":"https://pith.science/paper/ONM7WRL2"},"agent_actions":{"view_html":"https://pith.science/pith/ONM7WRL2WAK3RN2ABLNWJ4VB3J","download_json":"https://pith.science/pith/ONM7WRL2WAK3RN2ABLNWJ4VB3J.json","view_paper":"https://pith.science/paper/ONM7WRL2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.08502&json=true","fetch_graph":"https://pith.science/api/pith-number/ONM7WRL2WAK3RN2ABLNWJ4VB3J/graph.json","fetch_events":"https://pith.science/api/pith-number/ONM7WRL2WAK3RN2ABLNWJ4VB3J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ONM7WRL2WAK3RN2ABLNWJ4VB3J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ONM7WRL2WAK3RN2ABLNWJ4VB3J/action/storage_attestation","attest_author":"https://pith.science/pith/ONM7WRL2WAK3RN2ABLNWJ4VB3J/action/author_attestation","sign_citation":"https://pith.science/pith/ONM7WRL2WAK3RN2ABLNWJ4VB3J/action/citation_signature","submit_replication":"https://pith.science/pith/ONM7WRL2WAK3RN2ABLNWJ4VB3J/action/replication_record"}},"created_at":"2026-05-18T00:39:36.258469+00:00","updated_at":"2026-05-18T00:39:36.258469+00:00"}