{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EU74G44BPEBUBUNYKI637GSW2N","short_pith_number":"pith:EU74G44B","canonical_record":{"source":{"id":"1305.2986","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-14T01:03:15Z","cross_cats_sorted":[],"title_canon_sha256":"44898f343dcedd5ec76593fb946ccd5e2bbfd3c26565b3e03300559bd5bc26d6","abstract_canon_sha256":"db1f47f7b31ef841305cabe623b6561c71b9d659f6ac390c27fca34e16cd920b"},"schema_version":"1.0"},"canonical_sha256":"253fc37381790340d1b8523dbf9a56d377b0caa5acb332f0dc1a9bb41c9aba53","source":{"kind":"arxiv","id":"1305.2986","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.2986","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"arxiv_version","alias_value":"1305.2986v2","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2986","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"pith_short_12","alias_value":"EU74G44BPEBU","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EU74G44BPEBUBUNY","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EU74G44B","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EU74G44BPEBUBUNYKI637GSW2N","target":"record","payload":{"canonical_record":{"source":{"id":"1305.2986","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-14T01:03:15Z","cross_cats_sorted":[],"title_canon_sha256":"44898f343dcedd5ec76593fb946ccd5e2bbfd3c26565b3e03300559bd5bc26d6","abstract_canon_sha256":"db1f47f7b31ef841305cabe623b6561c71b9d659f6ac390c27fca34e16cd920b"},"schema_version":"1.0"},"canonical_sha256":"253fc37381790340d1b8523dbf9a56d377b0caa5acb332f0dc1a9bb41c9aba53","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:09.065261Z","signature_b64":"hwopxEQUc+NxarH2+JCLrms4Ahg8eCkx6XWn3KH9Ac2X3MujaneMci99jD+Z4WyEdZSa4wXjPetU+Q1MTDQkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"253fc37381790340d1b8523dbf9a56d377b0caa5acb332f0dc1a9bb41c9aba53","last_reissued_at":"2026-05-18T02:41:09.064828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:09.064828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.2986","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-18T02:41:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zrCl5zZsVInFSOz+1M+JTzqZ2SXFRJs36HvvxfsVM/oivS7aUc+U9Qhb/ajlD2BeD9Py7FUp+/wM3m4HwomZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:36:43.003108Z"},"content_sha256":"095ca1dac7a35a0f426162be3b96bbc982cf20e3d1fcfa2356fc0c84370a0053","schema_version":"1.0","event_id":"sha256:095ca1dac7a35a0f426162be3b96bbc982cf20e3d1fcfa2356fc0c84370a0053"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EU74G44BPEBUBUNYKI637GSW2N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Judicious partitions of directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Choongbum Lee, Po-Shen Loh","submitted_at":"2013-05-14T01:03:15Z","abstract_excerpt":"The area of judicious partitioning considers the general family of partitioning problems in which one seeks to optimize several parameters simultaneously, and these problems have been widely studied in various combinatorial contexts. In this paper, we study essentially the most fundamental judicious partitioning problem for directed graphs, which naturally extends the classical Max Cut problem to this setting: we seek bipartitions in which many edges cross in each direction. It is easy to see that a minimum outdegree condition is required in order for the problem to be nontrivial, and we prove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2986","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-18T02:41:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jHRvNgNPZzX18S0SevqZsslKuN06k9cA4pK+N8DpD839DM7nAXqQjGvi3nUUqAKU/CoH7vgQHcLQ0We08BhkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:36:43.003644Z"},"content_sha256":"e6753171d3314349b03dd6130bacb68846251f43e5e6d54bf26e07ea880dc102","schema_version":"1.0","event_id":"sha256:e6753171d3314349b03dd6130bacb68846251f43e5e6d54bf26e07ea880dc102"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EU74G44BPEBUBUNYKI637GSW2N/bundle.json","state_url":"https://pith.science/pith/EU74G44BPEBUBUNYKI637GSW2N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EU74G44BPEBUBUNYKI637GSW2N/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-30T02:36:43Z","links":{"resolver":"https://pith.science/pith/EU74G44BPEBUBUNYKI637GSW2N","bundle":"https://pith.science/pith/EU74G44BPEBUBUNYKI637GSW2N/bundle.json","state":"https://pith.science/pith/EU74G44BPEBUBUNYKI637GSW2N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EU74G44BPEBUBUNYKI637GSW2N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EU74G44BPEBUBUNYKI637GSW2N","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":"db1f47f7b31ef841305cabe623b6561c71b9d659f6ac390c27fca34e16cd920b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-14T01:03:15Z","title_canon_sha256":"44898f343dcedd5ec76593fb946ccd5e2bbfd3c26565b3e03300559bd5bc26d6"},"schema_version":"1.0","source":{"id":"1305.2986","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.2986","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"arxiv_version","alias_value":"1305.2986v2","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2986","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"pith_short_12","alias_value":"EU74G44BPEBU","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EU74G44BPEBUBUNY","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EU74G44B","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:e6753171d3314349b03dd6130bacb68846251f43e5e6d54bf26e07ea880dc102","target":"graph","created_at":"2026-05-18T02:41:09Z","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":"The area of judicious partitioning considers the general family of partitioning problems in which one seeks to optimize several parameters simultaneously, and these problems have been widely studied in various combinatorial contexts. In this paper, we study essentially the most fundamental judicious partitioning problem for directed graphs, which naturally extends the classical Max Cut problem to this setting: we seek bipartitions in which many edges cross in each direction. It is easy to see that a minimum outdegree condition is required in order for the problem to be nontrivial, and we prove","authors_text":"Benny Sudakov, Choongbum Lee, Po-Shen Loh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-14T01:03:15Z","title":"Judicious partitions of directed graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2986","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:095ca1dac7a35a0f426162be3b96bbc982cf20e3d1fcfa2356fc0c84370a0053","target":"record","created_at":"2026-05-18T02:41:09Z","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":"db1f47f7b31ef841305cabe623b6561c71b9d659f6ac390c27fca34e16cd920b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-14T01:03:15Z","title_canon_sha256":"44898f343dcedd5ec76593fb946ccd5e2bbfd3c26565b3e03300559bd5bc26d6"},"schema_version":"1.0","source":{"id":"1305.2986","kind":"arxiv","version":2}},"canonical_sha256":"253fc37381790340d1b8523dbf9a56d377b0caa5acb332f0dc1a9bb41c9aba53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"253fc37381790340d1b8523dbf9a56d377b0caa5acb332f0dc1a9bb41c9aba53","first_computed_at":"2026-05-18T02:41:09.064828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:09.064828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hwopxEQUc+NxarH2+JCLrms4Ahg8eCkx6XWn3KH9Ac2X3MujaneMci99jD+Z4WyEdZSa4wXjPetU+Q1MTDQkDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:09.065261Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.2986","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:095ca1dac7a35a0f426162be3b96bbc982cf20e3d1fcfa2356fc0c84370a0053","sha256:e6753171d3314349b03dd6130bacb68846251f43e5e6d54bf26e07ea880dc102"],"state_sha256":"b7d85db065891e45c5bf33c105b63a76b1b03d93923337b701c67c91b2c8ef2c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"99WKR3lnIHCx4tT8cw7gx02KCWxbLOlt6fa/zappj+f6WyZPh08dmfk2XdZ3WB0XvNcWCc8uLakVQf0VVsVMAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:36:43.006737Z","bundle_sha256":"1cfea0bfe23dece90e7ee9bf0b49c483a78fa5945377be470ec8deaf8fc22ce6"}}