{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:W66UZPZNBR4HL4AUY5NOE7OLNV","short_pith_number":"pith:W66UZPZN","schema_version":"1.0","canonical_sha256":"b7bd4cbf2d0c7875f014c75ae27dcb6d631cbd1d1c87b42c31ac0c4e65de1315","source":{"kind":"arxiv","id":"2606.11558","version":1},"attestation_state":"computed","paper":{"title":"Measurable matchings in unbalanced graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.LO","authors_text":"Anton Bernshteyn, Felix Weilacher, Matt Bowen","submitted_at":"2026-06-10T01:35:26Z","abstract_excerpt":"Let $G$ be a locally finite multigraph that is bipartite and \"unbalanced,\" meaning that it has a nontrivial bipartition $(A,B)$ with $\\deg(x) > \\deg(y)$ for all $x \\in A$ and $y \\in B$. We explore matchings in such graphs through the lens of descriptive set theory. In particular, we show that when $G$ is Borel and $\\mu$ is a Borel probability measure on its vertex set, there is a Borel matching in $G$ that covers $\\mu$-almost every vertex in $A$. This was previously known only under the assumption that $\\mu$ is $G$-invariant, which we eliminate using a novel probabilistic approach. We also des"},"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.11558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2026-06-10T01:35:26Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a08dd1c48c2ccd0c1c00504f7afdbaa26f9aae57e0e93a8254834f517ab2c062","abstract_canon_sha256":"4c4fb03bc38ee3d828e2a49a72f95c02b3a4d0b38a4a43874b30426ea78a18b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:09:56.011997Z","signature_b64":"MENl9HgrTbPxQACt5dcPu91A0fHJaGkDfxo924aJvaJqAKKefd+RcoTncgREkcvMkt63XWSiEczXITxcjbpGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7bd4cbf2d0c7875f014c75ae27dcb6d631cbd1d1c87b42c31ac0c4e65de1315","last_reissued_at":"2026-06-11T01:09:56.011074Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:09:56.011074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Measurable matchings in unbalanced graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.LO","authors_text":"Anton Bernshteyn, Felix Weilacher, Matt Bowen","submitted_at":"2026-06-10T01:35:26Z","abstract_excerpt":"Let $G$ be a locally finite multigraph that is bipartite and \"unbalanced,\" meaning that it has a nontrivial bipartition $(A,B)$ with $\\deg(x) > \\deg(y)$ for all $x \\in A$ and $y \\in B$. We explore matchings in such graphs through the lens of descriptive set theory. In particular, we show that when $G$ is Borel and $\\mu$ is a Borel probability measure on its vertex set, there is a Borel matching in $G$ that covers $\\mu$-almost every vertex in $A$. This was previously known only under the assumption that $\\mu$ is $G$-invariant, which we eliminate using a novel probabilistic approach. We also des"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11558","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.11558/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.11558","created_at":"2026-06-11T01:09:56.011228+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.11558v1","created_at":"2026-06-11T01:09:56.011228+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11558","created_at":"2026-06-11T01:09:56.011228+00:00"},{"alias_kind":"pith_short_12","alias_value":"W66UZPZNBR4H","created_at":"2026-06-11T01:09:56.011228+00:00"},{"alias_kind":"pith_short_16","alias_value":"W66UZPZNBR4HL4AU","created_at":"2026-06-11T01:09:56.011228+00:00"},{"alias_kind":"pith_short_8","alias_value":"W66UZPZN","created_at":"2026-06-11T01:09:56.011228+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/W66UZPZNBR4HL4AUY5NOE7OLNV","json":"https://pith.science/pith/W66UZPZNBR4HL4AUY5NOE7OLNV.json","graph_json":"https://pith.science/api/pith-number/W66UZPZNBR4HL4AUY5NOE7OLNV/graph.json","events_json":"https://pith.science/api/pith-number/W66UZPZNBR4HL4AUY5NOE7OLNV/events.json","paper":"https://pith.science/paper/W66UZPZN"},"agent_actions":{"view_html":"https://pith.science/pith/W66UZPZNBR4HL4AUY5NOE7OLNV","download_json":"https://pith.science/pith/W66UZPZNBR4HL4AUY5NOE7OLNV.json","view_paper":"https://pith.science/paper/W66UZPZN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.11558&json=true","fetch_graph":"https://pith.science/api/pith-number/W66UZPZNBR4HL4AUY5NOE7OLNV/graph.json","fetch_events":"https://pith.science/api/pith-number/W66UZPZNBR4HL4AUY5NOE7OLNV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W66UZPZNBR4HL4AUY5NOE7OLNV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W66UZPZNBR4HL4AUY5NOE7OLNV/action/storage_attestation","attest_author":"https://pith.science/pith/W66UZPZNBR4HL4AUY5NOE7OLNV/action/author_attestation","sign_citation":"https://pith.science/pith/W66UZPZNBR4HL4AUY5NOE7OLNV/action/citation_signature","submit_replication":"https://pith.science/pith/W66UZPZNBR4HL4AUY5NOE7OLNV/action/replication_record"}},"created_at":"2026-06-11T01:09:56.011228+00:00","updated_at":"2026-06-11T01:09:56.011228+00:00"}