{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:RQZT2AHZQYVHQWVRECKTRYWV4R","short_pith_number":"pith:RQZT2AHZ","canonical_record":{"source":{"id":"2306.08217","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-06-14T03:11:55Z","cross_cats_sorted":[],"title_canon_sha256":"c93a78316f333bfae85ac30b565d6778ee16cf838493a4a5f849b8bc54da8459","abstract_canon_sha256":"0fa5f188d21c3c06f7111ce18748e251701127aa50b6dc2a3b646d02b969849c"},"schema_version":"1.0"},"canonical_sha256":"8c333d00f9862a785ab1209538e2d5e464707a63aff2e848310215855acd02c8","source":{"kind":"arxiv","id":"2306.08217","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.08217","created_at":"2026-07-05T06:20:49Z"},{"alias_kind":"arxiv_version","alias_value":"2306.08217v1","created_at":"2026-07-05T06:20:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.08217","created_at":"2026-07-05T06:20:49Z"},{"alias_kind":"pith_short_12","alias_value":"RQZT2AHZQYVH","created_at":"2026-07-05T06:20:49Z"},{"alias_kind":"pith_short_16","alias_value":"RQZT2AHZQYVHQWVR","created_at":"2026-07-05T06:20:49Z"},{"alias_kind":"pith_short_8","alias_value":"RQZT2AHZ","created_at":"2026-07-05T06:20:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:RQZT2AHZQYVHQWVRECKTRYWV4R","target":"record","payload":{"canonical_record":{"source":{"id":"2306.08217","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-06-14T03:11:55Z","cross_cats_sorted":[],"title_canon_sha256":"c93a78316f333bfae85ac30b565d6778ee16cf838493a4a5f849b8bc54da8459","abstract_canon_sha256":"0fa5f188d21c3c06f7111ce18748e251701127aa50b6dc2a3b646d02b969849c"},"schema_version":"1.0"},"canonical_sha256":"8c333d00f9862a785ab1209538e2d5e464707a63aff2e848310215855acd02c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:20:49.440076Z","signature_b64":"hNTN/o0nedctPu5fPXWp3ZS2LJBo/WHtglbGZ/he/qEjRFcpVLhdAodVH1ABKjG5BrlIbQMSKa8argv4wyi1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c333d00f9862a785ab1209538e2d5e464707a63aff2e848310215855acd02c8","last_reissued_at":"2026-07-05T06:20:49.439606Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:20:49.439606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2306.08217","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-07-05T06:20:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XWBcM2ippsVdiLfj9Eed/1rOg5Qid5EBXnXZZy+mKFUdioq3seFdfFBHfUG8QA9cZfMuzl8qyP8InJg4oHiaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T21:47:09.982049Z"},"content_sha256":"4d9790da0a16b616bab8f8907b5ed085231f06828de8e234b13a9ac7b3ad0d4e","schema_version":"1.0","event_id":"sha256:4d9790da0a16b616bab8f8907b5ed085231f06828de8e234b13a9ac7b3ad0d4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:RQZT2AHZQYVHQWVRECKTRYWV4R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partitioning graphs with linear minimum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hehui Wu, Jie Ma","submitted_at":"2023-06-14T03:11:55Z","abstract_excerpt":"We prove that there exists an absolute constant $C>0$ such that, for any positive integer $k$, every graph $G$ with minimum degree at least $Ck$ admits a vertex-partition $V(G)=S\\cup T$, where both $G[S]$ and $G[T]$ have minimum degree at least $k$, and every vertex in $S$ has at least $k$ neighbors in $T$. This confirms a question posted by K\\\"uhn and Osthus and is tight up to a constant factor. Our proof combines probabilistic methods with structural arguments based on Ore's Theorem on $f$-factors of bipartite graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.08217","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.08217/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:20:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pmi4u7LpSjb+w1WfAi8bVuvADPDYXmoW4vylk1ugV90qbUqAlFZHUAV1+Ymd79hnIDQVjfXNanHp+ZrhWgquCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T21:47:09.982771Z"},"content_sha256":"9aecc586f5201398bef6970bf8c6bb0cd9637cdc51161e9f7d17318c8860a173","schema_version":"1.0","event_id":"sha256:9aecc586f5201398bef6970bf8c6bb0cd9637cdc51161e9f7d17318c8860a173"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RQZT2AHZQYVHQWVRECKTRYWV4R/bundle.json","state_url":"https://pith.science/pith/RQZT2AHZQYVHQWVRECKTRYWV4R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RQZT2AHZQYVHQWVRECKTRYWV4R/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-08-03T21:47:09Z","links":{"resolver":"https://pith.science/pith/RQZT2AHZQYVHQWVRECKTRYWV4R","bundle":"https://pith.science/pith/RQZT2AHZQYVHQWVRECKTRYWV4R/bundle.json","state":"https://pith.science/pith/RQZT2AHZQYVHQWVRECKTRYWV4R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RQZT2AHZQYVHQWVRECKTRYWV4R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:RQZT2AHZQYVHQWVRECKTRYWV4R","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":"0fa5f188d21c3c06f7111ce18748e251701127aa50b6dc2a3b646d02b969849c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-06-14T03:11:55Z","title_canon_sha256":"c93a78316f333bfae85ac30b565d6778ee16cf838493a4a5f849b8bc54da8459"},"schema_version":"1.0","source":{"id":"2306.08217","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.08217","created_at":"2026-07-05T06:20:49Z"},{"alias_kind":"arxiv_version","alias_value":"2306.08217v1","created_at":"2026-07-05T06:20:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.08217","created_at":"2026-07-05T06:20:49Z"},{"alias_kind":"pith_short_12","alias_value":"RQZT2AHZQYVH","created_at":"2026-07-05T06:20:49Z"},{"alias_kind":"pith_short_16","alias_value":"RQZT2AHZQYVHQWVR","created_at":"2026-07-05T06:20:49Z"},{"alias_kind":"pith_short_8","alias_value":"RQZT2AHZ","created_at":"2026-07-05T06:20:49Z"}],"graph_snapshots":[{"event_id":"sha256:9aecc586f5201398bef6970bf8c6bb0cd9637cdc51161e9f7d17318c8860a173","target":"graph","created_at":"2026-07-05T06:20:49Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2306.08217/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that there exists an absolute constant $C>0$ such that, for any positive integer $k$, every graph $G$ with minimum degree at least $Ck$ admits a vertex-partition $V(G)=S\\cup T$, where both $G[S]$ and $G[T]$ have minimum degree at least $k$, and every vertex in $S$ has at least $k$ neighbors in $T$. This confirms a question posted by K\\\"uhn and Osthus and is tight up to a constant factor. Our proof combines probabilistic methods with structural arguments based on Ore's Theorem on $f$-factors of bipartite graphs.","authors_text":"Hehui Wu, Jie Ma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-06-14T03:11:55Z","title":"Partitioning graphs with linear minimum degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.08217","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:4d9790da0a16b616bab8f8907b5ed085231f06828de8e234b13a9ac7b3ad0d4e","target":"record","created_at":"2026-07-05T06:20:49Z","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":"0fa5f188d21c3c06f7111ce18748e251701127aa50b6dc2a3b646d02b969849c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-06-14T03:11:55Z","title_canon_sha256":"c93a78316f333bfae85ac30b565d6778ee16cf838493a4a5f849b8bc54da8459"},"schema_version":"1.0","source":{"id":"2306.08217","kind":"arxiv","version":1}},"canonical_sha256":"8c333d00f9862a785ab1209538e2d5e464707a63aff2e848310215855acd02c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c333d00f9862a785ab1209538e2d5e464707a63aff2e848310215855acd02c8","first_computed_at":"2026-07-05T06:20:49.439606Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:20:49.439606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hNTN/o0nedctPu5fPXWp3ZS2LJBo/WHtglbGZ/he/qEjRFcpVLhdAodVH1ABKjG5BrlIbQMSKa8argv4wyi1AA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:20:49.440076Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.08217","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d9790da0a16b616bab8f8907b5ed085231f06828de8e234b13a9ac7b3ad0d4e","sha256:9aecc586f5201398bef6970bf8c6bb0cd9637cdc51161e9f7d17318c8860a173"],"state_sha256":"734b3a72d914aa040abcdaed88a3ab04afcf6169ece6f7180218a4aaa11739c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iIc/zYY7RTWzOgP3fdoLIoG61mKjXUL9H2ASknBHre/AAZX0oG7eyEM9pvAoHj7PsubuE+/zofrbogViESsSAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T21:47:09.987916Z","bundle_sha256":"03d0b4b2c0b42eaea05866028729715ce1b7e91c9ef0b5d3203a456279906664"}}