{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RHDJX4KMILUTUVYIQX472RNK3T","short_pith_number":"pith:RHDJX4KM","schema_version":"1.0","canonical_sha256":"89c69bf14c42e93a570885f9fd45aadcdabc82772c1ed0bc1ce088edae472b3b","source":{"kind":"arxiv","id":"2507.20253","version":2},"attestation_state":"computed","paper":{"title":"The Min Max Average Cycle Weight Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Erel Segal-Halevi, Noga Klein Elmalem, Rica Gonen","submitted_at":"2025-07-27T12:49:37Z","abstract_excerpt":"When an old apartment building is demolished and rebuilt, how can we fairly redistribute the new apartments to minimize envy among residents? We reduce this question to a combinatorial optimization problem called the *Min Max Average Cycle Weight* problem. In that problem we seek to assign objects to agents in a way that minimizes the maximum average weight of directed cycles in an associated envy graph. While this problem reduces to maximum-weight matching when starting from a clean slate (achieving polynomial-time solvability), we show that this is not the case when we account for preexistin"},"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":"2507.20253","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-27T12:49:37Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"5aa50f4a77794b08c50376c570c35da0d811c4082fc5420304b832cbfb5e5cbc","abstract_canon_sha256":"1f7ff23fc3cba66db12c382057105d4628a9da8b6d7e6c679c9b5fbdd4bceb7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:16.167299Z","signature_b64":"ShdvNPMwHI5IoWbXl+cGbt4Cuk2KXJGweqsQnIfsgQWNmWLFh987KGfrM+06Ddha66vvcflKedrn3XcK0WdXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89c69bf14c42e93a570885f9fd45aadcdabc82772c1ed0bc1ce088edae472b3b","last_reissued_at":"2026-06-23T02:13:16.166840Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:16.166840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Min Max Average Cycle Weight Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Erel Segal-Halevi, Noga Klein Elmalem, Rica Gonen","submitted_at":"2025-07-27T12:49:37Z","abstract_excerpt":"When an old apartment building is demolished and rebuilt, how can we fairly redistribute the new apartments to minimize envy among residents? We reduce this question to a combinatorial optimization problem called the *Min Max Average Cycle Weight* problem. In that problem we seek to assign objects to agents in a way that minimizes the maximum average weight of directed cycles in an associated envy graph. While this problem reduces to maximum-weight matching when starting from a clean slate (achieving polynomial-time solvability), we show that this is not the case when we account for preexistin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.20253","kind":"arxiv","version":2},"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/2507.20253/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":"2507.20253","created_at":"2026-06-23T02:13:16.166897+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.20253v2","created_at":"2026-06-23T02:13:16.166897+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.20253","created_at":"2026-06-23T02:13:16.166897+00:00"},{"alias_kind":"pith_short_12","alias_value":"RHDJX4KMILUT","created_at":"2026-06-23T02:13:16.166897+00:00"},{"alias_kind":"pith_short_16","alias_value":"RHDJX4KMILUTUVYI","created_at":"2026-06-23T02:13:16.166897+00:00"},{"alias_kind":"pith_short_8","alias_value":"RHDJX4KM","created_at":"2026-06-23T02:13:16.166897+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/RHDJX4KMILUTUVYIQX472RNK3T","json":"https://pith.science/pith/RHDJX4KMILUTUVYIQX472RNK3T.json","graph_json":"https://pith.science/api/pith-number/RHDJX4KMILUTUVYIQX472RNK3T/graph.json","events_json":"https://pith.science/api/pith-number/RHDJX4KMILUTUVYIQX472RNK3T/events.json","paper":"https://pith.science/paper/RHDJX4KM"},"agent_actions":{"view_html":"https://pith.science/pith/RHDJX4KMILUTUVYIQX472RNK3T","download_json":"https://pith.science/pith/RHDJX4KMILUTUVYIQX472RNK3T.json","view_paper":"https://pith.science/paper/RHDJX4KM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.20253&json=true","fetch_graph":"https://pith.science/api/pith-number/RHDJX4KMILUTUVYIQX472RNK3T/graph.json","fetch_events":"https://pith.science/api/pith-number/RHDJX4KMILUTUVYIQX472RNK3T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RHDJX4KMILUTUVYIQX472RNK3T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RHDJX4KMILUTUVYIQX472RNK3T/action/storage_attestation","attest_author":"https://pith.science/pith/RHDJX4KMILUTUVYIQX472RNK3T/action/author_attestation","sign_citation":"https://pith.science/pith/RHDJX4KMILUTUVYIQX472RNK3T/action/citation_signature","submit_replication":"https://pith.science/pith/RHDJX4KMILUTUVYIQX472RNK3T/action/replication_record"}},"created_at":"2026-06-23T02:13:16.166897+00:00","updated_at":"2026-06-23T02:13:16.166897+00:00"}