{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GWG3DNTUVCPBSAQ2JE5SOX7DY5","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":"072e5953a12b34e4e513acf34c5af838a02892d164f8c41b9ec4b14c5049f3aa","cross_cats_sorted":["cs.GT","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-28T06:03:25Z","title_canon_sha256":"195f3fd939b6f917d0125282f11060edbaa40c58c6cb1c16087eb4d8c411df49"},"schema_version":"1.0","source":{"id":"1901.09527","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09527","created_at":"2026-07-05T04:14:35Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09527v6","created_at":"2026-07-05T04:14:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09527","created_at":"2026-07-05T04:14:35Z"},{"alias_kind":"pith_short_12","alias_value":"GWG3DNTUVCPB","created_at":"2026-07-05T04:14:35Z"},{"alias_kind":"pith_short_16","alias_value":"GWG3DNTUVCPBSAQ2","created_at":"2026-07-05T04:14:35Z"},{"alias_kind":"pith_short_8","alias_value":"GWG3DNTU","created_at":"2026-07-05T04:14:35Z"}],"graph_snapshots":[{"event_id":"sha256:1e9c3dce9485524e759dc3c44b3129acc2810fb2c34dd5fb9ebbd32ccf773562","target":"graph","created_at":"2026-07-05T04:14:35Z","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/1901.09527/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A matching in a bipartite graph with parts X and Y is called envy-free if no unmatched vertex in X is a adjacent to a matched vertex in Y. Every perfect matching is envy-free, but envy-free matchings exist even when perfect matchings do not. We prove that every bipartite graph has a unique partition such that all envy-free matchings are contained in one of the partition sets. Using this structural theorem, we provide a polynomial-time algorithm for finding an envy-free matching of maximum cardinality. For edge-weighted bipartite graphs, we provide a polynomial-time algorithm for finding a maxi","authors_text":"Elad Aigner-Horev, Erel Segal-Halevi","cross_cats":["cs.GT","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-28T06:03:25Z","title":"Envy-free Matchings in Bipartite Graphs and their Applications to Fair Division"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09527","kind":"arxiv","version":6},"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:b54debc701fd9d90750bb30e8ab7f0c4dd80f32a7fb46357d20c56c017b5644a","target":"record","created_at":"2026-07-05T04:14:35Z","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":"072e5953a12b34e4e513acf34c5af838a02892d164f8c41b9ec4b14c5049f3aa","cross_cats_sorted":["cs.GT","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-28T06:03:25Z","title_canon_sha256":"195f3fd939b6f917d0125282f11060edbaa40c58c6cb1c16087eb4d8c411df49"},"schema_version":"1.0","source":{"id":"1901.09527","kind":"arxiv","version":6}},"canonical_sha256":"358db1b674a89e19021a493b275fe3c77ba163de7570d0eb2bb740e83c9f0702","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"358db1b674a89e19021a493b275fe3c77ba163de7570d0eb2bb740e83c9f0702","first_computed_at":"2026-07-05T04:14:35.292935Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:14:35.292935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l78FCOCqqb8m+xzx07LrVuB8CH/MzgLwWxhgvmjf/lPaO3HiNEzFufcZ2B2820qmxZYkbVJcE49M2lMwH54eAg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:14:35.293540Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.09527","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b54debc701fd9d90750bb30e8ab7f0c4dd80f32a7fb46357d20c56c017b5644a","sha256:1e9c3dce9485524e759dc3c44b3129acc2810fb2c34dd5fb9ebbd32ccf773562"],"state_sha256":"d5dd974210e023ee3d042aa67c448f6813ca6fe8e4b0420139196bfc9e0f77d9"}