{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KY7TXAEBRQ6JJYG4ESKLUGXW7T","short_pith_number":"pith:KY7TXAEB","canonical_record":{"source":{"id":"1805.05506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-15T00:42:25Z","cross_cats_sorted":[],"title_canon_sha256":"ae7cee84b2fb703281f6680a6237d1e1a54f33da72f70e2b2700b2044ea58582","abstract_canon_sha256":"8a09d7002dc9a12ceb68fb867a7185d5d0317e4f5ae63cf2e7717f7972a55f63"},"schema_version":"1.0"},"canonical_sha256":"563f3b80818c3c94e0dc2494ba1af6fcd8097e07a7f6e022baa498afedfaee75","source":{"kind":"arxiv","id":"1805.05506","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05506","created_at":"2026-05-18T00:16:00Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05506v1","created_at":"2026-05-18T00:16:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05506","created_at":"2026-05-18T00:16:00Z"},{"alias_kind":"pith_short_12","alias_value":"KY7TXAEBRQ6J","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KY7TXAEBRQ6JJYG4","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KY7TXAEB","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KY7TXAEBRQ6JJYG4ESKLUGXW7T","target":"record","payload":{"canonical_record":{"source":{"id":"1805.05506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-15T00:42:25Z","cross_cats_sorted":[],"title_canon_sha256":"ae7cee84b2fb703281f6680a6237d1e1a54f33da72f70e2b2700b2044ea58582","abstract_canon_sha256":"8a09d7002dc9a12ceb68fb867a7185d5d0317e4f5ae63cf2e7717f7972a55f63"},"schema_version":"1.0"},"canonical_sha256":"563f3b80818c3c94e0dc2494ba1af6fcd8097e07a7f6e022baa498afedfaee75","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:00.432579Z","signature_b64":"coVz3G/DUeTCq8DRkIXOyE+wM/Z9lX9SiL8b2psBu4SjjGcPdAICVK57EW3f3s35qRSkjGli2lUHyKyAyfD0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"563f3b80818c3c94e0dc2494ba1af6fcd8097e07a7f6e022baa498afedfaee75","last_reissued_at":"2026-05-18T00:16:00.432110Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:00.432110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.05506","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:16:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GtKoYb7XWY1vrSvMoxJVO3vAifNU3OJhd7YRQhadrPqYhw4Sp12GQoxQQYTbxzVdSZFoYKLrVce38cbmQ5OkDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:30:06.249106Z"},"content_sha256":"4f9d3a1f53a95ada83d63db0227d1ea0f387bc48c8e9bece52c59ec9de221c07","schema_version":"1.0","event_id":"sha256:4f9d3a1f53a95ada83d63db0227d1ea0f387bc48c8e9bece52c59ec9de221c07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KY7TXAEBRQ6JJYG4ESKLUGXW7T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A bound on judicious bipartitions of directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Huawen Ma, Jianfeng Hou, Xia Zhang, Xingxing Yu","submitted_at":"2018-05-15T00:42:25Z","abstract_excerpt":"Judicious partitioning problems on graphs ask for partitions that bound several quantities simultaneously, which have received a lot of attentions lately. Scott asked the following natural question: What is the maximum constant $c_d$ such that every directed graph $D$ with $m$ arcs and minimum outdegree $d$ admits a bipartition $V(D)= V_1\\cup V_2$ satisfying $\\min\\{e(V_1, V_2), e(V_2, V_1)\\}\\ge c_d m$? Here, for $i=1,2$, $e(V_{i},V_{3-i})$ denotes the number of arcs in $D$ from $V_{i}$ to $V_{3-i}$. Lee, Loh, and Sudakov %[Judicious partitions of directed graphs, Random Struct. Alg. 48 %(2016)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05506","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:16:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RHpzRgKai/VeI7NnvItEeaBcfNFzUKRXTzLlEiqq6LzQV+acR0PnaQpHiFV+N/66Q+Dg4kubgWxOYBe1+zoODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:30:06.249471Z"},"content_sha256":"3de705487a2c60971094bb7cfc65b14e02d5a372e3f4fc16f18ba4e1aa7bfff4","schema_version":"1.0","event_id":"sha256:3de705487a2c60971094bb7cfc65b14e02d5a372e3f4fc16f18ba4e1aa7bfff4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KY7TXAEBRQ6JJYG4ESKLUGXW7T/bundle.json","state_url":"https://pith.science/pith/KY7TXAEBRQ6JJYG4ESKLUGXW7T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KY7TXAEBRQ6JJYG4ESKLUGXW7T/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-05-30T19:30:06Z","links":{"resolver":"https://pith.science/pith/KY7TXAEBRQ6JJYG4ESKLUGXW7T","bundle":"https://pith.science/pith/KY7TXAEBRQ6JJYG4ESKLUGXW7T/bundle.json","state":"https://pith.science/pith/KY7TXAEBRQ6JJYG4ESKLUGXW7T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KY7TXAEBRQ6JJYG4ESKLUGXW7T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KY7TXAEBRQ6JJYG4ESKLUGXW7T","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":"8a09d7002dc9a12ceb68fb867a7185d5d0317e4f5ae63cf2e7717f7972a55f63","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-15T00:42:25Z","title_canon_sha256":"ae7cee84b2fb703281f6680a6237d1e1a54f33da72f70e2b2700b2044ea58582"},"schema_version":"1.0","source":{"id":"1805.05506","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05506","created_at":"2026-05-18T00:16:00Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05506v1","created_at":"2026-05-18T00:16:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05506","created_at":"2026-05-18T00:16:00Z"},{"alias_kind":"pith_short_12","alias_value":"KY7TXAEBRQ6J","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KY7TXAEBRQ6JJYG4","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KY7TXAEB","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:3de705487a2c60971094bb7cfc65b14e02d5a372e3f4fc16f18ba4e1aa7bfff4","target":"graph","created_at":"2026-05-18T00:16:00Z","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":"Judicious partitioning problems on graphs ask for partitions that bound several quantities simultaneously, which have received a lot of attentions lately. Scott asked the following natural question: What is the maximum constant $c_d$ such that every directed graph $D$ with $m$ arcs and minimum outdegree $d$ admits a bipartition $V(D)= V_1\\cup V_2$ satisfying $\\min\\{e(V_1, V_2), e(V_2, V_1)\\}\\ge c_d m$? Here, for $i=1,2$, $e(V_{i},V_{3-i})$ denotes the number of arcs in $D$ from $V_{i}$ to $V_{3-i}$. Lee, Loh, and Sudakov %[Judicious partitions of directed graphs, Random Struct. Alg. 48 %(2016)","authors_text":"Huawen Ma, Jianfeng Hou, Xia Zhang, Xingxing Yu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-15T00:42:25Z","title":"A bound on judicious bipartitions of directed graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05506","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:4f9d3a1f53a95ada83d63db0227d1ea0f387bc48c8e9bece52c59ec9de221c07","target":"record","created_at":"2026-05-18T00:16:00Z","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":"8a09d7002dc9a12ceb68fb867a7185d5d0317e4f5ae63cf2e7717f7972a55f63","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-15T00:42:25Z","title_canon_sha256":"ae7cee84b2fb703281f6680a6237d1e1a54f33da72f70e2b2700b2044ea58582"},"schema_version":"1.0","source":{"id":"1805.05506","kind":"arxiv","version":1}},"canonical_sha256":"563f3b80818c3c94e0dc2494ba1af6fcd8097e07a7f6e022baa498afedfaee75","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"563f3b80818c3c94e0dc2494ba1af6fcd8097e07a7f6e022baa498afedfaee75","first_computed_at":"2026-05-18T00:16:00.432110Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:00.432110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"coVz3G/DUeTCq8DRkIXOyE+wM/Z9lX9SiL8b2psBu4SjjGcPdAICVK57EW3f3s35qRSkjGli2lUHyKyAyfD0Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:00.432579Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.05506","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f9d3a1f53a95ada83d63db0227d1ea0f387bc48c8e9bece52c59ec9de221c07","sha256:3de705487a2c60971094bb7cfc65b14e02d5a372e3f4fc16f18ba4e1aa7bfff4"],"state_sha256":"6eba5e19153feab08bb46cbde2c6d4cd847ffd222c7f14c778c2c170e4549a6c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YAjmdpENxMPKuPzEPgklFFwcwNFgTz22WHLr7L/Ni3Q0+uusznw/OdcUcs0WfjUTtOTmAWsAE/A8nZ837waNAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T19:30:06.251659Z","bundle_sha256":"38ff542e721d3f8d0af176c014c85871c6af48da8af80a6d0bb25ba98f48defa"}}