{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:L67VPC6LLOYU5OOKU34GLAQG7N","short_pith_number":"pith:L67VPC6L","canonical_record":{"source":{"id":"2607.07160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-07-08T08:52:28Z","cross_cats_sorted":[],"title_canon_sha256":"c8f56f2224c5d2147e59e662c6d6e021f9f985feb71c431c87da5ad9be73415a","abstract_canon_sha256":"8d94f763dbf56a47042708fb894aa5c7359433b5b9734ca634bc5f66e0a271d6"},"schema_version":"1.0"},"canonical_sha256":"5fbf578bcb5bb14eb9caa6f8658206fb7300148583286482157ff3c6bd945e19","source":{"kind":"arxiv","id":"2607.07160","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.07160","created_at":"2026-07-09T01:20:15Z"},{"alias_kind":"arxiv_version","alias_value":"2607.07160v1","created_at":"2026-07-09T01:20:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07160","created_at":"2026-07-09T01:20:15Z"},{"alias_kind":"pith_short_12","alias_value":"L67VPC6LLOYU","created_at":"2026-07-09T01:20:15Z"},{"alias_kind":"pith_short_16","alias_value":"L67VPC6LLOYU5OOK","created_at":"2026-07-09T01:20:15Z"},{"alias_kind":"pith_short_8","alias_value":"L67VPC6L","created_at":"2026-07-09T01:20:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:L67VPC6LLOYU5OOKU34GLAQG7N","target":"record","payload":{"canonical_record":{"source":{"id":"2607.07160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-07-08T08:52:28Z","cross_cats_sorted":[],"title_canon_sha256":"c8f56f2224c5d2147e59e662c6d6e021f9f985feb71c431c87da5ad9be73415a","abstract_canon_sha256":"8d94f763dbf56a47042708fb894aa5c7359433b5b9734ca634bc5f66e0a271d6"},"schema_version":"1.0"},"canonical_sha256":"5fbf578bcb5bb14eb9caa6f8658206fb7300148583286482157ff3c6bd945e19","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-09T01:20:15.966514Z","signature_b64":"5wvLyw+AS/qmOJlHLwb+f8buw1ZgglDqUppGcAMEbNCHLnsWHoKYSYztWl6Vv3q2BPNSy8JOL5FlBLmabEfvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fbf578bcb5bb14eb9caa6f8658206fb7300148583286482157ff3c6bd945e19","last_reissued_at":"2026-07-09T01:20:15.966123Z","signature_status":"signed_v1","first_computed_at":"2026-07-09T01:20:15.966123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.07160","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-09T01:20:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JGzTXf0CzAhBjxKqlta/+3CuG8aLkQf73P5goFg/kXQ4mu7VALHL+leFDAamxz9vrJsw4aSeOYOfBzA/0pPoCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T05:37:55.527989Z"},"content_sha256":"9dd9180ba6f88d83db8eec0e25b32e99c5c96cdd3955a9c3ff453ad41af60b9a","schema_version":"1.0","event_id":"sha256:9dd9180ba6f88d83db8eec0e25b32e99c5c96cdd3955a9c3ff453ad41af60b9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:L67VPC6LLOYU5OOKU34GLAQG7N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stable Matchings with Minimum Utility Gap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Yao Sheng, Yu Yokoi","submitted_at":"2026-07-08T08:52:28Z","abstract_excerpt":"We introduce the Stable Matching Problem with Minimum Utility Gap, which seeks a stable matching in which the utilities received by individual agents are as balanced as possible. Our framework can handle many-to-many matchings and general utility functions on partner sets that are consistent with the agents' preferences. We consider two measures for comparing agents' utilities: the difference between the maximum and minimum utilities, and their ratio.\n  We provide a polynomial-time algorithm for both versions. The algorithm exploits the rotation-poset representation of the set of stable matchi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07160","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/2607.07160/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-09T01:20:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zx6tBCPmmClaARt5yd5YmpjLy6yXTe14XM1enMi7i7b3BdZYFhmCWxDg9sLTgL9ojy1d1cd9vzpMDLlVkH75Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T05:37:55.528486Z"},"content_sha256":"55d00f4a408b941c67f5580d4adcaf125b09ef294dd0dc04dea499c222e8e670","schema_version":"1.0","event_id":"sha256:55d00f4a408b941c67f5580d4adcaf125b09ef294dd0dc04dea499c222e8e670"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:L67VPC6LLOYU5OOKU34GLAQG7N","target":"integrity","payload":{"note":"Identifier '10.5555/3535850.3536083' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Shivika Narang, Arpita Biswas, and Yadati Narahari. On achieving leximin fairness and stability in many-to-one matchings. InProceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, pages 1705–1707. Inter","arxiv_id":"2607.07160","detector":"doi_compliance","evidence":{"doi":"10.5555/3535850.3536083","arxiv_id":null,"ref_index":23,"raw_excerpt":"Shivika Narang, Arpita Biswas, and Yadati Narahari. On achieving leximin fairness and stability in many-to-one matchings. InProceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, pages 1705–1707. International Foundation for Autonomous Agents and Multiagent Systems, 2022.doi:10.5555/3535850.3536083","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":23,"audited_at":"2026-07-09T18:49:11.889909Z","event_type":"pith.integrity.v1","detected_doi":"10.5555/3535850.3536083","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"bf93c7c18c055dd75e1f4bf3d5c83ec29f2f9ab59cf81fe84ffeb3d22485f76c","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":10352,"payload_sha256":"2c7e546631e804f58ae948ff3a5f7a9ca356d58b5e39b26219da0360942dc272","signature_b64":"uGMrw/4vyUazwoKDfobN4rApCh+z4BFGHZ8fYFWyiBEWqUX37WY+Sf2Y1RrnHAiZM9WA7Nq9M1B1jzF55PttAw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-09T18:53:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tk4QDNdQ2ns2wvqrgIuajP88ihjYEeOCBJj+7Rnnsmq0qN59abbUqRQv7l4mHD7C1LjhN5dcwhY8t9bBvo6CBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T05:37:55.532593Z"},"content_sha256":"ff972ae90d2901f3d9aae7918702165cdb1a240c98e8ae3ad2898beae4503690","schema_version":"1.0","event_id":"sha256:ff972ae90d2901f3d9aae7918702165cdb1a240c98e8ae3ad2898beae4503690"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:L67VPC6LLOYU5OOKU34GLAQG7N","target":"integrity","payload":{"note":"DOI '10.1142/8591' as printed in the bibliography is syntactically invalid and cannot resolve.","snippet":"David F. Manlove.Algorithmics of Matching Under Preferences, volume 2 ofSeries on Theoretical Computer Science. World Scientific, Singapore, 2013.doi:10.1142/8591","arxiv_id":"2607.07160","detector":"doi_compliance","evidence":{"ref_index":22,"raw_excerpt":"David F. Manlove.Algorithmics of Matching Under Preferences, volume 2 ofSeries on Theoretical Computer Science. World Scientific, Singapore, 2013.doi:10.1142/8591","verdict_class":"incontrovertible","doi_as_printed":"10.1142/8591"},"severity":"critical","ref_index":22,"audited_at":"2026-07-09T18:49:11.889909Z","event_type":"pith.integrity.v1","detected_doi":"10.1142/8591","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"broken_identifier","evidence_hash":"cb66e608ded8edef2d3f9f8425308d0e5c89ecae41cd3ececc8991652df592f5","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":10351,"payload_sha256":"e342dda4c6945c0d4c3454bb3e7205f11977d521e2a96fff3c57c25e1fe98d81","signature_b64":"4mzGAafAOzpBVNR0HzaaQL+G79TJpo5NdrUTU74BaUMBmx8OVM/T/j0TsZ3ENp/bHSNMTJZ2QSpgFgvp/Uf+BA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-09T18:53:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T188EudhjaKh2Ik2UV3bQjSXq8wmUiZme3ZIR0Hc97Z6vMwZFzfTRGIxuI6xnN+Fbhw8y1zyRRSpNv1udamfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T05:37:55.533092Z"},"content_sha256":"b404c78641d4e12d8a18b4a6a7700d0b9b9c329e0ce33982500abed01da0416a","schema_version":"1.0","event_id":"sha256:b404c78641d4e12d8a18b4a6a7700d0b9b9c329e0ce33982500abed01da0416a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L67VPC6LLOYU5OOKU34GLAQG7N/bundle.json","state_url":"https://pith.science/pith/L67VPC6LLOYU5OOKU34GLAQG7N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L67VPC6LLOYU5OOKU34GLAQG7N/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-07T05:37:55Z","links":{"resolver":"https://pith.science/pith/L67VPC6LLOYU5OOKU34GLAQG7N","bundle":"https://pith.science/pith/L67VPC6LLOYU5OOKU34GLAQG7N/bundle.json","state":"https://pith.science/pith/L67VPC6LLOYU5OOKU34GLAQG7N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L67VPC6LLOYU5OOKU34GLAQG7N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:L67VPC6LLOYU5OOKU34GLAQG7N","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8d94f763dbf56a47042708fb894aa5c7359433b5b9734ca634bc5f66e0a271d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-07-08T08:52:28Z","title_canon_sha256":"c8f56f2224c5d2147e59e662c6d6e021f9f985feb71c431c87da5ad9be73415a"},"schema_version":"1.0","source":{"id":"2607.07160","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.07160","created_at":"2026-07-09T01:20:15Z"},{"alias_kind":"arxiv_version","alias_value":"2607.07160v1","created_at":"2026-07-09T01:20:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07160","created_at":"2026-07-09T01:20:15Z"},{"alias_kind":"pith_short_12","alias_value":"L67VPC6LLOYU","created_at":"2026-07-09T01:20:15Z"},{"alias_kind":"pith_short_16","alias_value":"L67VPC6LLOYU5OOK","created_at":"2026-07-09T01:20:15Z"},{"alias_kind":"pith_short_8","alias_value":"L67VPC6L","created_at":"2026-07-09T01:20:15Z"}],"graph_snapshots":[{"event_id":"sha256:55d00f4a408b941c67f5580d4adcaf125b09ef294dd0dc04dea499c222e8e670","target":"graph","created_at":"2026-07-09T01:20:15Z","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/2607.07160/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce the Stable Matching Problem with Minimum Utility Gap, which seeks a stable matching in which the utilities received by individual agents are as balanced as possible. Our framework can handle many-to-many matchings and general utility functions on partner sets that are consistent with the agents' preferences. We consider two measures for comparing agents' utilities: the difference between the maximum and minimum utilities, and their ratio.\n  We provide a polynomial-time algorithm for both versions. The algorithm exploits the rotation-poset representation of the set of stable matchi","authors_text":"Yao Sheng, Yu Yokoi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07160","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:9dd9180ba6f88d83db8eec0e25b32e99c5c96cdd3955a9c3ff453ad41af60b9a","target":"record","created_at":"2026-07-09T01:20:15Z","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":"8d94f763dbf56a47042708fb894aa5c7359433b5b9734ca634bc5f66e0a271d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-07-08T08:52:28Z","title_canon_sha256":"c8f56f2224c5d2147e59e662c6d6e021f9f985feb71c431c87da5ad9be73415a"},"schema_version":"1.0","source":{"id":"2607.07160","kind":"arxiv","version":1}},"canonical_sha256":"5fbf578bcb5bb14eb9caa6f8658206fb7300148583286482157ff3c6bd945e19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fbf578bcb5bb14eb9caa6f8658206fb7300148583286482157ff3c6bd945e19","first_computed_at":"2026-07-09T01:20:15.966123Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-09T01:20:15.966123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5wvLyw+AS/qmOJlHLwb+f8buw1ZgglDqUppGcAMEbNCHLnsWHoKYSYztWl6Vv3q2BPNSy8JOL5FlBLmabEfvBA==","signature_status":"signed_v1","signed_at":"2026-07-09T01:20:15.966514Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.07160","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:b404c78641d4e12d8a18b4a6a7700d0b9b9c329e0ce33982500abed01da0416a","sha256:ff972ae90d2901f3d9aae7918702165cdb1a240c98e8ae3ad2898beae4503690"]}],"invalid_events":[],"applied_event_ids":["sha256:9dd9180ba6f88d83db8eec0e25b32e99c5c96cdd3955a9c3ff453ad41af60b9a","sha256:55d00f4a408b941c67f5580d4adcaf125b09ef294dd0dc04dea499c222e8e670"],"state_sha256":"3ad21554a03d2de67ba487b5899679ac052ea36fac7db70a0202d7cb1043ef79"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y/4l/Mm+8bcYCqgtDWrBm/FzCVKzuYOvhg3rho2U5CXDZXKWS5GpLEcQrP/njY9uJLTgUOe8g66Cbs5JLJ+kAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T05:37:55.535665Z","bundle_sha256":"b092aaf7e7fc49dcd0648712d3c1925499410a5b69853dc99c2a8365b6f7943a"}}