{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ONM7WRL2WAK3RN2ABLNWJ4VB3J","short_pith_number":"pith:ONM7WRL2","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"},"canonical_sha256":"7359fb457ab015b8b7400adb64f2a1da506eda6c98afa1ca902b1858e8f33e87","source":{"kind":"arxiv","id":"1703.08502","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.08502","created_at":"2026-05-18T00:39:36Z"},{"alias_kind":"arxiv_version","alias_value":"1703.08502v2","created_at":"2026-05-18T00:39:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08502","created_at":"2026-05-18T00:39:36Z"},{"alias_kind":"pith_short_12","alias_value":"ONM7WRL2WAK3","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"ONM7WRL2WAK3RN2A","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"ONM7WRL2","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ONM7WRL2WAK3RN2ABLNWJ4VB3J","target":"record","payload":{"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"},"canonical_sha256":"7359fb457ab015b8b7400adb64f2a1da506eda6c98afa1ca902b1858e8f33e87","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"},"source_kind":"arxiv","source_id":"1703.08502","source_version":2,"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:39:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rbUTP6izTjSly613wr83JGt/vDGJjBo/M2YeIkOrN1kieqCnZuDLNHZlRwQ/t2uoKPvlH8Xp5oDkcZQJ9uupDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T21:09:25.918354Z"},"content_sha256":"b11ab92e23a889dc190fabbc7d31399c73bd5ffdce8853c02bdc362e31e6dbb2","schema_version":"1.0","event_id":"sha256:b11ab92e23a889dc190fabbc7d31399c73bd5ffdce8853c02bdc362e31e6dbb2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ONM7WRL2WAK3RN2ABLNWJ4VB3J","target":"graph","payload":{"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"},"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:39:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vCtR1I9GfZq4uS74/pC2r7i20jKyiLIXaLhiT9cAaXwGmnbblqAvHhQzBK91Tq4XA0jazX3S3MwHWVXFe6zOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T21:09:25.918704Z"},"content_sha256":"dfc250eb585bf87db9da1ebe02159a6dd820ebf10c99d9d454263baae40582b7","schema_version":"1.0","event_id":"sha256:dfc250eb585bf87db9da1ebe02159a6dd820ebf10c99d9d454263baae40582b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ONM7WRL2WAK3RN2ABLNWJ4VB3J/bundle.json","state_url":"https://pith.science/pith/ONM7WRL2WAK3RN2ABLNWJ4VB3J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ONM7WRL2WAK3RN2ABLNWJ4VB3J/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-07-03T21:09:25Z","links":{"resolver":"https://pith.science/pith/ONM7WRL2WAK3RN2ABLNWJ4VB3J","bundle":"https://pith.science/pith/ONM7WRL2WAK3RN2ABLNWJ4VB3J/bundle.json","state":"https://pith.science/pith/ONM7WRL2WAK3RN2ABLNWJ4VB3J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ONM7WRL2WAK3RN2ABLNWJ4VB3J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ONM7WRL2WAK3RN2ABLNWJ4VB3J","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":"855bc5abd508ba779d9ca153989657d7607a16555437e9cc1172832e35d1cf24","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-24T16:53:14Z","title_canon_sha256":"1fead69dde1aebc0db5675d0ba27bf312b9960f0909dc095152d701c976f4142"},"schema_version":"1.0","source":{"id":"1703.08502","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.08502","created_at":"2026-05-18T00:39:36Z"},{"alias_kind":"arxiv_version","alias_value":"1703.08502v2","created_at":"2026-05-18T00:39:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08502","created_at":"2026-05-18T00:39:36Z"},{"alias_kind":"pith_short_12","alias_value":"ONM7WRL2WAK3","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"ONM7WRL2WAK3RN2A","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"ONM7WRL2","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:dfc250eb585bf87db9da1ebe02159a6dd820ebf10c99d9d454263baae40582b7","target":"graph","created_at":"2026-05-18T00:39:36Z","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":"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 $","authors_text":"Michael Stiebitz, Thomas Schweser","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-24T16:53:14Z","title":"Partitions of multigraphs under degree constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08502","kind":"arxiv","version":2},"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:b11ab92e23a889dc190fabbc7d31399c73bd5ffdce8853c02bdc362e31e6dbb2","target":"record","created_at":"2026-05-18T00:39:36Z","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":"855bc5abd508ba779d9ca153989657d7607a16555437e9cc1172832e35d1cf24","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-24T16:53:14Z","title_canon_sha256":"1fead69dde1aebc0db5675d0ba27bf312b9960f0909dc095152d701c976f4142"},"schema_version":"1.0","source":{"id":"1703.08502","kind":"arxiv","version":2}},"canonical_sha256":"7359fb457ab015b8b7400adb64f2a1da506eda6c98afa1ca902b1858e8f33e87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7359fb457ab015b8b7400adb64f2a1da506eda6c98afa1ca902b1858e8f33e87","first_computed_at":"2026-05-18T00:39:36.258379Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:36.258379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vdBs3Sjqh5YNLnBMf8ckcle99DDrrX5aO3qrsiHPGpoij0S99AZFfwZlTpl4LAiWlaMoHVPy4rD766uZ5yj8Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:36.258955Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.08502","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b11ab92e23a889dc190fabbc7d31399c73bd5ffdce8853c02bdc362e31e6dbb2","sha256:dfc250eb585bf87db9da1ebe02159a6dd820ebf10c99d9d454263baae40582b7"],"state_sha256":"654f24b6f9f60b1efc3fb002dcbe6b9bace21f232800b6208f2e678112a97a52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YXmfIvUc9Di2e5K5dBG60v0FG9viHeBs2ovS7H5Q128W3R5MKHFdh7Gl5Y0xOS6YzTFqyE6rlJM0jfENjZlIAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T21:09:25.920667Z","bundle_sha256":"fffb5aba6536a8cd0c43e2e969e3d4ddae448665617fa049b262134b521157c6"}}