{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:V2E6XVYVR7AANR2X2BXCPKQ4NE","short_pith_number":"pith:V2E6XVYV","canonical_record":{"source":{"id":"2605.25078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-24T13:41:44Z","cross_cats_sorted":[],"title_canon_sha256":"90380831cd318f5e9a07751d6a5404235d2437d148555fbf2379f6aab8d583a0","abstract_canon_sha256":"cc058889fb4c67a07176693fc9afc3b3bcdc1d43225ae8fadbb600f9de2e73f0"},"schema_version":"1.0"},"canonical_sha256":"ae89ebd7158fc006c757d06e27aa1c6929f6323b2693be393ebcc1c3edc45d2c","source":{"kind":"arxiv","id":"2605.25078","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.25078","created_at":"2026-05-26T02:03:38Z"},{"alias_kind":"arxiv_version","alias_value":"2605.25078v1","created_at":"2026-05-26T02:03:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25078","created_at":"2026-05-26T02:03:38Z"},{"alias_kind":"pith_short_12","alias_value":"V2E6XVYVR7AA","created_at":"2026-05-26T02:03:38Z"},{"alias_kind":"pith_short_16","alias_value":"V2E6XVYVR7AANR2X","created_at":"2026-05-26T02:03:38Z"},{"alias_kind":"pith_short_8","alias_value":"V2E6XVYV","created_at":"2026-05-26T02:03:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:V2E6XVYVR7AANR2X2BXCPKQ4NE","target":"record","payload":{"canonical_record":{"source":{"id":"2605.25078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-24T13:41:44Z","cross_cats_sorted":[],"title_canon_sha256":"90380831cd318f5e9a07751d6a5404235d2437d148555fbf2379f6aab8d583a0","abstract_canon_sha256":"cc058889fb4c67a07176693fc9afc3b3bcdc1d43225ae8fadbb600f9de2e73f0"},"schema_version":"1.0"},"canonical_sha256":"ae89ebd7158fc006c757d06e27aa1c6929f6323b2693be393ebcc1c3edc45d2c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:03:38.993728Z","signature_b64":"ruEFC+sLSJbi3WqBbmVyRf7o18enj+7o7bF7AdHd+tdcRluIqbNe2igtdQCPSbZ35lDsCpOt7xMs78K7A7s6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae89ebd7158fc006c757d06e27aa1c6929f6323b2693be393ebcc1c3edc45d2c","last_reissued_at":"2026-05-26T02:03:38.992905Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:03:38.992905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.25078","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-26T02:03:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DGBFxIZ9nCluAjA6uashEEUNV1CZNwI1I1oFr3fJSodllj8c7vkFRYresIFvmfQzcveaNeB0LkXDTMcM8yNtAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T14:30:01.061705Z"},"content_sha256":"ba11da59f8469c2013e359cd9d94bd4804159475d8ce00ca465c60e744e835ae","schema_version":"1.0","event_id":"sha256:ba11da59f8469c2013e359cd9d94bd4804159475d8ce00ca465c60e744e835ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:V2E6XVYVR7AANR2X2BXCPKQ4NE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Dirichlet Mechanism for rounding with strong negative correlation, with applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David G. Harris, George Z. Li, Nitya Raju, Renata Valieva","submitted_at":"2026-05-24T13:41:44Z","abstract_excerpt":"Many optimization and scheduling problems can be abstracted in terms of a bipartite ``assignment graph\" $G = (L \\cup R, E)$, where the goal is to select exactly one edge for each right-node. For example, a right-node may correspond to a job, and a left-node to a possible machine assignment. A common strategy to solve such problems is to obtain a fractional relaxation $x_e$ for each edge $e$, and then have each right-node independently select an edge with probability $x_e$. However, this may cause the left-nodes to become unevenly loaded, leading to suboptimal solutions for some problems.\n  To "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.25078","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/2605.25078/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-05-26T02:03:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F5N5tFcqO4Y/lm2B4jBvLi7icad7VDwyJsXLRzYB29jLa++8GiAfbRCVavS8zP3Jtz8rhofUG12NuAaz/Pk5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T14:30:01.062076Z"},"content_sha256":"53ec097cad71edec8918349fa13b592f7a04575d0340067b94c7137f343b6c73","schema_version":"1.0","event_id":"sha256:53ec097cad71edec8918349fa13b592f7a04575d0340067b94c7137f343b6c73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V2E6XVYVR7AANR2X2BXCPKQ4NE/bundle.json","state_url":"https://pith.science/pith/V2E6XVYVR7AANR2X2BXCPKQ4NE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V2E6XVYVR7AANR2X2BXCPKQ4NE/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-06-06T14:30:01Z","links":{"resolver":"https://pith.science/pith/V2E6XVYVR7AANR2X2BXCPKQ4NE","bundle":"https://pith.science/pith/V2E6XVYVR7AANR2X2BXCPKQ4NE/bundle.json","state":"https://pith.science/pith/V2E6XVYVR7AANR2X2BXCPKQ4NE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V2E6XVYVR7AANR2X2BXCPKQ4NE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:V2E6XVYVR7AANR2X2BXCPKQ4NE","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":"cc058889fb4c67a07176693fc9afc3b3bcdc1d43225ae8fadbb600f9de2e73f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-24T13:41:44Z","title_canon_sha256":"90380831cd318f5e9a07751d6a5404235d2437d148555fbf2379f6aab8d583a0"},"schema_version":"1.0","source":{"id":"2605.25078","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.25078","created_at":"2026-05-26T02:03:38Z"},{"alias_kind":"arxiv_version","alias_value":"2605.25078v1","created_at":"2026-05-26T02:03:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25078","created_at":"2026-05-26T02:03:38Z"},{"alias_kind":"pith_short_12","alias_value":"V2E6XVYVR7AA","created_at":"2026-05-26T02:03:38Z"},{"alias_kind":"pith_short_16","alias_value":"V2E6XVYVR7AANR2X","created_at":"2026-05-26T02:03:38Z"},{"alias_kind":"pith_short_8","alias_value":"V2E6XVYV","created_at":"2026-05-26T02:03:38Z"}],"graph_snapshots":[{"event_id":"sha256:53ec097cad71edec8918349fa13b592f7a04575d0340067b94c7137f343b6c73","target":"graph","created_at":"2026-05-26T02:03:38Z","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/2605.25078/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many optimization and scheduling problems can be abstracted in terms of a bipartite ``assignment graph\" $G = (L \\cup R, E)$, where the goal is to select exactly one edge for each right-node. For example, a right-node may correspond to a job, and a left-node to a possible machine assignment. A common strategy to solve such problems is to obtain a fractional relaxation $x_e$ for each edge $e$, and then have each right-node independently select an edge with probability $x_e$. However, this may cause the left-nodes to become unevenly loaded, leading to suboptimal solutions for some problems.\n  To ","authors_text":"David G. Harris, George Z. Li, Nitya Raju, Renata Valieva","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-24T13:41:44Z","title":"The Dirichlet Mechanism for rounding with strong negative correlation, with applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.25078","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:ba11da59f8469c2013e359cd9d94bd4804159475d8ce00ca465c60e744e835ae","target":"record","created_at":"2026-05-26T02:03:38Z","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":"cc058889fb4c67a07176693fc9afc3b3bcdc1d43225ae8fadbb600f9de2e73f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-24T13:41:44Z","title_canon_sha256":"90380831cd318f5e9a07751d6a5404235d2437d148555fbf2379f6aab8d583a0"},"schema_version":"1.0","source":{"id":"2605.25078","kind":"arxiv","version":1}},"canonical_sha256":"ae89ebd7158fc006c757d06e27aa1c6929f6323b2693be393ebcc1c3edc45d2c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae89ebd7158fc006c757d06e27aa1c6929f6323b2693be393ebcc1c3edc45d2c","first_computed_at":"2026-05-26T02:03:38.992905Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T02:03:38.992905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ruEFC+sLSJbi3WqBbmVyRf7o18enj+7o7bF7AdHd+tdcRluIqbNe2igtdQCPSbZ35lDsCpOt7xMs78K7A7s6CA==","signature_status":"signed_v1","signed_at":"2026-05-26T02:03:38.993728Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.25078","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba11da59f8469c2013e359cd9d94bd4804159475d8ce00ca465c60e744e835ae","sha256:53ec097cad71edec8918349fa13b592f7a04575d0340067b94c7137f343b6c73"],"state_sha256":"590c23503bb4caeadb1a706514f96a1c31482b31a3e277993d28ad2e74b45ae7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FZOy3keir9A88GR2vub6ZB7rUwXF010X+8740STVGe/lmTJOVMyL7tJKPqnuz3VnYSV3yxQUWg+x8miPjOgdCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T14:30:01.064273Z","bundle_sha256":"3d744199e6419da88dc5823bb1a5fc7a3a660b5d51f0887b3d6d84c2a679195b"}}