{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:IMOQ5MH5AMCQRJBCYI23VMNDF6","short_pith_number":"pith:IMOQ5MH5","canonical_record":{"source":{"id":"2505.06005","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-09T12:35:45Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"deb9275410d7c0f889c6a2293140614704b0d97a98228f66b1f32ee447c248e4","abstract_canon_sha256":"92cbbe80be10d8590915e0d92825c71ffa79c379abf51b821483f05ce8a92c0e"},"schema_version":"1.0"},"canonical_sha256":"431d0eb0fd030508a422c235bab1a32f9d26735ae2e36f36e0b3ae0a1298de30","source":{"kind":"arxiv","id":"2505.06005","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.06005","created_at":"2026-07-05T11:00:52Z"},{"alias_kind":"arxiv_version","alias_value":"2505.06005v1","created_at":"2026-07-05T11:00:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.06005","created_at":"2026-07-05T11:00:52Z"},{"alias_kind":"pith_short_12","alias_value":"IMOQ5MH5AMCQ","created_at":"2026-07-05T11:00:52Z"},{"alias_kind":"pith_short_16","alias_value":"IMOQ5MH5AMCQRJBC","created_at":"2026-07-05T11:00:52Z"},{"alias_kind":"pith_short_8","alias_value":"IMOQ5MH5","created_at":"2026-07-05T11:00:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:IMOQ5MH5AMCQRJBCYI23VMNDF6","target":"record","payload":{"canonical_record":{"source":{"id":"2505.06005","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-09T12:35:45Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"deb9275410d7c0f889c6a2293140614704b0d97a98228f66b1f32ee447c248e4","abstract_canon_sha256":"92cbbe80be10d8590915e0d92825c71ffa79c379abf51b821483f05ce8a92c0e"},"schema_version":"1.0"},"canonical_sha256":"431d0eb0fd030508a422c235bab1a32f9d26735ae2e36f36e0b3ae0a1298de30","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:00:52.003033Z","signature_b64":"Z10FrU+sq9YirtGDVjenMEl2Q/5JZwo4xfmZgwPsgELx8N1GLA33FCgm6LfDbHN56E94akTAVbN//KIzxCr/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"431d0eb0fd030508a422c235bab1a32f9d26735ae2e36f36e0b3ae0a1298de30","last_reissued_at":"2026-07-05T11:00:52.002475Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:00:52.002475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.06005","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-05T11:00:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z452/OADTi4nn2uxH6AlZVc2VjgOwnOWy0oOO2y9GJX552kae+XPQSqMazuu26J5CYCeQwm8C6fQbdECaQFgBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T14:15:00.670241Z"},"content_sha256":"34b94d8ae10b3e4c308c7a0052de0c5ebdd8d74fc9a8272ca5eafdb313552ab7","schema_version":"1.0","event_id":"sha256:34b94d8ae10b3e4c308c7a0052de0c5ebdd8d74fc9a8272ca5eafdb313552ab7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:IMOQ5MH5AMCQRJBCYI23VMNDF6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Second Price Matching with Complete Allocation and Degree Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Jiaye Wei, Lukas Vogl, Neta Singer, Rom Pinchasi","submitted_at":"2025-05-09T12:35:45Z","abstract_excerpt":"We study the Second Price Matching problem, introduced by Azar, Birnbaum, Karlin, and Nguyen in 2009. In this problem, a bipartite graph (bidders and goods) is given, and the profit of a matching is the number of matches containing a second unmatched bidder. Maximizing profit is known to be APX-hard and the current best approximation guarantee is $1/2$. APX-hardness even holds when all degrees are bounded by a constant. In this paper, we investigate the approximability of the problem under regular degree constraints. Our main result is an improved approximation guarantee of $9/10$ for Second P"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.06005","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/2505.06005/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-05T11:00:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aZkxk7nJqha+vWYwqufXjh0BWCwTkWRMPEA5w2PcnuCPF6NfYYtVTL39rkFRydEyLRVrGJvwqrtyy+wIkSl2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T14:15:00.671196Z"},"content_sha256":"ca835b25c12c2ad307239be850bc556a2a3dbd76c8d4a301d7deb64f5c513919","schema_version":"1.0","event_id":"sha256:ca835b25c12c2ad307239be850bc556a2a3dbd76c8d4a301d7deb64f5c513919"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IMOQ5MH5AMCQRJBCYI23VMNDF6/bundle.json","state_url":"https://pith.science/pith/IMOQ5MH5AMCQRJBCYI23VMNDF6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IMOQ5MH5AMCQRJBCYI23VMNDF6/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-18T14:15:00Z","links":{"resolver":"https://pith.science/pith/IMOQ5MH5AMCQRJBCYI23VMNDF6","bundle":"https://pith.science/pith/IMOQ5MH5AMCQRJBCYI23VMNDF6/bundle.json","state":"https://pith.science/pith/IMOQ5MH5AMCQRJBCYI23VMNDF6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IMOQ5MH5AMCQRJBCYI23VMNDF6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IMOQ5MH5AMCQRJBCYI23VMNDF6","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":"92cbbe80be10d8590915e0d92825c71ffa79c379abf51b821483f05ce8a92c0e","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-09T12:35:45Z","title_canon_sha256":"deb9275410d7c0f889c6a2293140614704b0d97a98228f66b1f32ee447c248e4"},"schema_version":"1.0","source":{"id":"2505.06005","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.06005","created_at":"2026-07-05T11:00:52Z"},{"alias_kind":"arxiv_version","alias_value":"2505.06005v1","created_at":"2026-07-05T11:00:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.06005","created_at":"2026-07-05T11:00:52Z"},{"alias_kind":"pith_short_12","alias_value":"IMOQ5MH5AMCQ","created_at":"2026-07-05T11:00:52Z"},{"alias_kind":"pith_short_16","alias_value":"IMOQ5MH5AMCQRJBC","created_at":"2026-07-05T11:00:52Z"},{"alias_kind":"pith_short_8","alias_value":"IMOQ5MH5","created_at":"2026-07-05T11:00:52Z"}],"graph_snapshots":[{"event_id":"sha256:ca835b25c12c2ad307239be850bc556a2a3dbd76c8d4a301d7deb64f5c513919","target":"graph","created_at":"2026-07-05T11:00:52Z","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/2505.06005/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the Second Price Matching problem, introduced by Azar, Birnbaum, Karlin, and Nguyen in 2009. In this problem, a bipartite graph (bidders and goods) is given, and the profit of a matching is the number of matches containing a second unmatched bidder. Maximizing profit is known to be APX-hard and the current best approximation guarantee is $1/2$. APX-hardness even holds when all degrees are bounded by a constant. In this paper, we investigate the approximability of the problem under regular degree constraints. Our main result is an improved approximation guarantee of $9/10$ for Second P","authors_text":"Jiaye Wei, Lukas Vogl, Neta Singer, Rom Pinchasi","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-09T12:35:45Z","title":"Second Price Matching with Complete Allocation and Degree Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.06005","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:34b94d8ae10b3e4c308c7a0052de0c5ebdd8d74fc9a8272ca5eafdb313552ab7","target":"record","created_at":"2026-07-05T11:00:52Z","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":"92cbbe80be10d8590915e0d92825c71ffa79c379abf51b821483f05ce8a92c0e","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-09T12:35:45Z","title_canon_sha256":"deb9275410d7c0f889c6a2293140614704b0d97a98228f66b1f32ee447c248e4"},"schema_version":"1.0","source":{"id":"2505.06005","kind":"arxiv","version":1}},"canonical_sha256":"431d0eb0fd030508a422c235bab1a32f9d26735ae2e36f36e0b3ae0a1298de30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"431d0eb0fd030508a422c235bab1a32f9d26735ae2e36f36e0b3ae0a1298de30","first_computed_at":"2026-07-05T11:00:52.002475Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:00:52.002475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z10FrU+sq9YirtGDVjenMEl2Q/5JZwo4xfmZgwPsgELx8N1GLA33FCgm6LfDbHN56E94akTAVbN//KIzxCr/Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:00:52.003033Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.06005","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34b94d8ae10b3e4c308c7a0052de0c5ebdd8d74fc9a8272ca5eafdb313552ab7","sha256:ca835b25c12c2ad307239be850bc556a2a3dbd76c8d4a301d7deb64f5c513919"],"state_sha256":"cd0e1dcc7b0b6eba58a3bcdf20edc4436ec58d8b5efd96cb5e39efe515578df9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RTciZTYqO35JANJgYgpAN9lQ4B0H0rhmPmiseXK8lKuW4HB0FTlEJeX6vgu9r2jOCmX0wNiDR6eZzQnxaWuTCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T14:15:00.689347Z","bundle_sha256":"442ac4b71c4aa7dd26a98734fe7ae25ac0dc611d80e0c387a5a5b80000edc194"}}