{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WM5CLXOV2D2K36FUPK2B3GUQFT","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":"70c6b37c351df1652850093e6cad39973339245ed1c628c2dd55d370e6bf940b","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-05T20:05:46Z","title_canon_sha256":"3aae8274bd399c4d79e160ac4c2125d425c7a233dd653cd19d2a1b61a23b527f"},"schema_version":"1.0","source":{"id":"2606.07820","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.07820","created_at":"2026-06-09T01:04:53Z"},{"alias_kind":"arxiv_version","alias_value":"2606.07820v1","created_at":"2026-06-09T01:04:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.07820","created_at":"2026-06-09T01:04:53Z"},{"alias_kind":"pith_short_12","alias_value":"WM5CLXOV2D2K","created_at":"2026-06-09T01:04:53Z"},{"alias_kind":"pith_short_16","alias_value":"WM5CLXOV2D2K36FU","created_at":"2026-06-09T01:04:53Z"},{"alias_kind":"pith_short_8","alias_value":"WM5CLXOV","created_at":"2026-06-09T01:04:53Z"}],"graph_snapshots":[{"event_id":"sha256:275b6348dd2bfccae2e1b536794dc9668cd6c8ca799bd768ceb1d80b0f6624d7","target":"graph","created_at":"2026-06-09T01:04:53Z","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/2606.07820/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We describe new dependent-rounding algorithms for bipartite graphs. Given a fractional matching $x$ of graph $G = (U \\cup V, E)$, the algorithms return an integral solution $X$ such that each right-node $v \\in V$ has at most one edge, and where the variables $X_e$ also satisfy broad non-positive correlation properties. In particular, for any edges $e_1, e_2$ sharing a left-node $u \\in U$, the variables $X_{e_1}, X_{e_2}$ have \\emph{strong} negative-correlation, i.e. the expectation of $X_{e_1} X_{e_2}$ is significantly below $x_{e_1} x_{e_2}$.\n  Dependent rounding schemes with these properties","authors_text":"David G. Harris","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-05T20:05:46Z","title":"A note on rounding fractional matchings with constant-factor strong negative correlation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.07820","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:6250f1dfb02c9403bddc60353ca9929a3d096f589aaf61637d91257a56d09088","target":"record","created_at":"2026-06-09T01:04:53Z","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":"70c6b37c351df1652850093e6cad39973339245ed1c628c2dd55d370e6bf940b","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-05T20:05:46Z","title_canon_sha256":"3aae8274bd399c4d79e160ac4c2125d425c7a233dd653cd19d2a1b61a23b527f"},"schema_version":"1.0","source":{"id":"2606.07820","kind":"arxiv","version":1}},"canonical_sha256":"b33a25ddd5d0f4adf8b47ab41d9a902cd118bc25c54256eab9ff37ca2f82b0d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b33a25ddd5d0f4adf8b47ab41d9a902cd118bc25c54256eab9ff37ca2f82b0d8","first_computed_at":"2026-06-09T01:04:53.056401Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T01:04:53.056401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3JYe1B2gMWbeAnxV2lnFHViskPMIb89x7NxkHsSfux+MOvDvlDoo9eZA3MYLN2oqaXnu15nNkZQdTFgNmBjtAA==","signature_status":"signed_v1","signed_at":"2026-06-09T01:04:53.056811Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.07820","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6250f1dfb02c9403bddc60353ca9929a3d096f589aaf61637d91257a56d09088","sha256:275b6348dd2bfccae2e1b536794dc9668cd6c8ca799bd768ceb1d80b0f6624d7"],"state_sha256":"6009cc8d338d000e7c003a3ee914f39dca9912b43d063a536f12a492eb7f4321"}