{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:WM5CLXOV2D2K36FUPK2B3GUQFT","short_pith_number":"pith:WM5CLXOV","schema_version":"1.0","canonical_sha256":"b33a25ddd5d0f4adf8b47ab41d9a902cd118bc25c54256eab9ff37ca2f82b0d8","source":{"kind":"arxiv","id":"2606.07820","version":1},"attestation_state":"computed","paper":{"title":"A note on rounding fractional matchings with constant-factor strong negative correlation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DS","authors_text":"David G. Harris","submitted_at":"2026-06-05T20:05:46Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2606.07820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-05T20:05:46Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"3aae8274bd399c4d79e160ac4c2125d425c7a233dd653cd19d2a1b61a23b527f","abstract_canon_sha256":"70c6b37c351df1652850093e6cad39973339245ed1c628c2dd55d370e6bf940b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:04:53.056811Z","signature_b64":"3JYe1B2gMWbeAnxV2lnFHViskPMIb89x7NxkHsSfux+MOvDvlDoo9eZA3MYLN2oqaXnu15nNkZQdTFgNmBjtAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b33a25ddd5d0f4adf8b47ab41d9a902cd118bc25c54256eab9ff37ca2f82b0d8","last_reissued_at":"2026-06-09T01:04:53.056401Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:04:53.056401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on rounding fractional matchings with constant-factor strong negative correlation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DS","authors_text":"David G. Harris","submitted_at":"2026-06-05T20:05:46Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.07820","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/2606.07820/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.07820","created_at":"2026-06-09T01:04:53.056458+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.07820v1","created_at":"2026-06-09T01:04:53.056458+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.07820","created_at":"2026-06-09T01:04:53.056458+00:00"},{"alias_kind":"pith_short_12","alias_value":"WM5CLXOV2D2K","created_at":"2026-06-09T01:04:53.056458+00:00"},{"alias_kind":"pith_short_16","alias_value":"WM5CLXOV2D2K36FU","created_at":"2026-06-09T01:04:53.056458+00:00"},{"alias_kind":"pith_short_8","alias_value":"WM5CLXOV","created_at":"2026-06-09T01:04:53.056458+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WM5CLXOV2D2K36FUPK2B3GUQFT","json":"https://pith.science/pith/WM5CLXOV2D2K36FUPK2B3GUQFT.json","graph_json":"https://pith.science/api/pith-number/WM5CLXOV2D2K36FUPK2B3GUQFT/graph.json","events_json":"https://pith.science/api/pith-number/WM5CLXOV2D2K36FUPK2B3GUQFT/events.json","paper":"https://pith.science/paper/WM5CLXOV"},"agent_actions":{"view_html":"https://pith.science/pith/WM5CLXOV2D2K36FUPK2B3GUQFT","download_json":"https://pith.science/pith/WM5CLXOV2D2K36FUPK2B3GUQFT.json","view_paper":"https://pith.science/paper/WM5CLXOV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.07820&json=true","fetch_graph":"https://pith.science/api/pith-number/WM5CLXOV2D2K36FUPK2B3GUQFT/graph.json","fetch_events":"https://pith.science/api/pith-number/WM5CLXOV2D2K36FUPK2B3GUQFT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WM5CLXOV2D2K36FUPK2B3GUQFT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WM5CLXOV2D2K36FUPK2B3GUQFT/action/storage_attestation","attest_author":"https://pith.science/pith/WM5CLXOV2D2K36FUPK2B3GUQFT/action/author_attestation","sign_citation":"https://pith.science/pith/WM5CLXOV2D2K36FUPK2B3GUQFT/action/citation_signature","submit_replication":"https://pith.science/pith/WM5CLXOV2D2K36FUPK2B3GUQFT/action/replication_record"}},"created_at":"2026-06-09T01:04:53.056458+00:00","updated_at":"2026-06-09T01:04:53.056458+00:00"}