{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:UKU3NQ5WDRYL7M7G3Z6ODLLIC4","short_pith_number":"pith:UKU3NQ5W","canonical_record":{"source":{"id":"2502.02503","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-02-04T17:17:00Z","cross_cats_sorted":[],"title_canon_sha256":"e2b184f527d6bbf185cec1d98b030482870a4364c2ce8220e6f4c35395af14d9","abstract_canon_sha256":"16b2ca1ddefabbceeb5306d6b26e29ac03ebdc6ce5f701f2d3bbf529f650837d"},"schema_version":"1.0"},"canonical_sha256":"a2a9b6c3b61c70bfb3e6de7ce1ad68170ff4e9c3427e25e31f8148e49f71e9ee","source":{"kind":"arxiv","id":"2502.02503","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.02503","created_at":"2026-07-05T10:11:33Z"},{"alias_kind":"arxiv_version","alias_value":"2502.02503v2","created_at":"2026-07-05T10:11:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.02503","created_at":"2026-07-05T10:11:33Z"},{"alias_kind":"pith_short_12","alias_value":"UKU3NQ5WDRYL","created_at":"2026-07-05T10:11:33Z"},{"alias_kind":"pith_short_16","alias_value":"UKU3NQ5WDRYL7M7G","created_at":"2026-07-05T10:11:33Z"},{"alias_kind":"pith_short_8","alias_value":"UKU3NQ5W","created_at":"2026-07-05T10:11:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:UKU3NQ5WDRYL7M7G3Z6ODLLIC4","target":"record","payload":{"canonical_record":{"source":{"id":"2502.02503","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-02-04T17:17:00Z","cross_cats_sorted":[],"title_canon_sha256":"e2b184f527d6bbf185cec1d98b030482870a4364c2ce8220e6f4c35395af14d9","abstract_canon_sha256":"16b2ca1ddefabbceeb5306d6b26e29ac03ebdc6ce5f701f2d3bbf529f650837d"},"schema_version":"1.0"},"canonical_sha256":"a2a9b6c3b61c70bfb3e6de7ce1ad68170ff4e9c3427e25e31f8148e49f71e9ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:11:33.164033Z","signature_b64":"NLrfv1hiAzjAESp28eD1bHq6jiN9wjXl+e5Jb83ddytjgah7SRTFo2//tgvOS6Vv2Axb093AMy8xJaS1v+f9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2a9b6c3b61c70bfb3e6de7ce1ad68170ff4e9c3427e25e31f8148e49f71e9ee","last_reissued_at":"2026-07-05T10:11:33.163563Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:11:33.163563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.02503","source_version":2,"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-05T10:11:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g7YjrxLCUWUOZCu7v+bjjXFc8/an1Uf74C9IRdCbL4KAT0K1k5iXOcjQlrdCA5QI1CIO8HmhQ7rmhRfvADs4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T05:43:02.379042Z"},"content_sha256":"21391a94dcd286f09d8b13c74ed8eb37f746e9ba3a924143273f89318de3df21","schema_version":"1.0","event_id":"sha256:21391a94dcd286f09d8b13c74ed8eb37f746e9ba3a924143273f89318de3df21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:UKU3NQ5WDRYL7M7G3Z6ODLLIC4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-Feasible Solutions to Complex Stable Matching Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Gergely Cs\\'aji","submitted_at":"2025-02-04T17:17:00Z","abstract_excerpt":"In this paper, we demonstrate that in many NP-complete variants of the stable matching problem, such as the Stable Hypergraph Matching problem, the Stable Multicommodity Flow problem, and the College Admission problem with common quotas, a near-feasible stable solution - that is, a solution which is stable, but may slightly violate some capacities - always exists. Our results provide strong theoretical guarantees that even under complex constraints, stability can be restored with minimal capacity modifications.\n  To achieve this, we present an iterative rounding algorithm that starts from a st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.02503","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/2502.02503/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-05T10:11:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iIqfs8yhK/spj8Jba3G7wmcBWp6cMpVWZ4O7J5ows9rZf8aj/yAlh4OefafAAe9JBLjtr/2ea0FE2vRue/I8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T05:43:02.379938Z"},"content_sha256":"772563a752dce6fc5f442321214646bb751a5c08274a07bb31dadae2d8d20eda","schema_version":"1.0","event_id":"sha256:772563a752dce6fc5f442321214646bb751a5c08274a07bb31dadae2d8d20eda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UKU3NQ5WDRYL7M7G3Z6ODLLIC4/bundle.json","state_url":"https://pith.science/pith/UKU3NQ5WDRYL7M7G3Z6ODLLIC4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UKU3NQ5WDRYL7M7G3Z6ODLLIC4/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-10T05:43:02Z","links":{"resolver":"https://pith.science/pith/UKU3NQ5WDRYL7M7G3Z6ODLLIC4","bundle":"https://pith.science/pith/UKU3NQ5WDRYL7M7G3Z6ODLLIC4/bundle.json","state":"https://pith.science/pith/UKU3NQ5WDRYL7M7G3Z6ODLLIC4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UKU3NQ5WDRYL7M7G3Z6ODLLIC4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:UKU3NQ5WDRYL7M7G3Z6ODLLIC4","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":"16b2ca1ddefabbceeb5306d6b26e29ac03ebdc6ce5f701f2d3bbf529f650837d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-02-04T17:17:00Z","title_canon_sha256":"e2b184f527d6bbf185cec1d98b030482870a4364c2ce8220e6f4c35395af14d9"},"schema_version":"1.0","source":{"id":"2502.02503","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.02503","created_at":"2026-07-05T10:11:33Z"},{"alias_kind":"arxiv_version","alias_value":"2502.02503v2","created_at":"2026-07-05T10:11:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.02503","created_at":"2026-07-05T10:11:33Z"},{"alias_kind":"pith_short_12","alias_value":"UKU3NQ5WDRYL","created_at":"2026-07-05T10:11:33Z"},{"alias_kind":"pith_short_16","alias_value":"UKU3NQ5WDRYL7M7G","created_at":"2026-07-05T10:11:33Z"},{"alias_kind":"pith_short_8","alias_value":"UKU3NQ5W","created_at":"2026-07-05T10:11:33Z"}],"graph_snapshots":[{"event_id":"sha256:772563a752dce6fc5f442321214646bb751a5c08274a07bb31dadae2d8d20eda","target":"graph","created_at":"2026-07-05T10:11:33Z","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/2502.02503/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we demonstrate that in many NP-complete variants of the stable matching problem, such as the Stable Hypergraph Matching problem, the Stable Multicommodity Flow problem, and the College Admission problem with common quotas, a near-feasible stable solution - that is, a solution which is stable, but may slightly violate some capacities - always exists. Our results provide strong theoretical guarantees that even under complex constraints, stability can be restored with minimal capacity modifications.\n  To achieve this, we present an iterative rounding algorithm that starts from a st","authors_text":"Gergely Cs\\'aji","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.02503","kind":"arxiv","version":2},"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:21391a94dcd286f09d8b13c74ed8eb37f746e9ba3a924143273f89318de3df21","target":"record","created_at":"2026-07-05T10:11:33Z","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":"16b2ca1ddefabbceeb5306d6b26e29ac03ebdc6ce5f701f2d3bbf529f650837d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-02-04T17:17:00Z","title_canon_sha256":"e2b184f527d6bbf185cec1d98b030482870a4364c2ce8220e6f4c35395af14d9"},"schema_version":"1.0","source":{"id":"2502.02503","kind":"arxiv","version":2}},"canonical_sha256":"a2a9b6c3b61c70bfb3e6de7ce1ad68170ff4e9c3427e25e31f8148e49f71e9ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2a9b6c3b61c70bfb3e6de7ce1ad68170ff4e9c3427e25e31f8148e49f71e9ee","first_computed_at":"2026-07-05T10:11:33.163563Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:11:33.163563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NLrfv1hiAzjAESp28eD1bHq6jiN9wjXl+e5Jb83ddytjgah7SRTFo2//tgvOS6Vv2Axb093AMy8xJaS1v+f9Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:11:33.164033Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.02503","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21391a94dcd286f09d8b13c74ed8eb37f746e9ba3a924143273f89318de3df21","sha256:772563a752dce6fc5f442321214646bb751a5c08274a07bb31dadae2d8d20eda"],"state_sha256":"40ac4c53bae24bbc64d97e5882bb5a8ca1f34ccbe6078821b7b53394beae7472"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5+8ZKPnc5MKxN98M44yk0EtkeioXdte49zGvhu+ffUZDEvZLr61oRr0kYbazvtXxlN6gTWDEE05W+YqhVPp/Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T05:43:02.385434Z","bundle_sha256":"02e52d06520fce5ff1eff8f9a66df4961ae8acf9a20f9096cebe6dab10f7c93e"}}