{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SNLXB2XRAOQHZ2XERHO4ANVGNH","short_pith_number":"pith:SNLXB2XR","schema_version":"1.0","canonical_sha256":"935770eaf103a07ceae489ddc036a669cad8b74c81f4cc925dae8dc422b9be50","source":{"kind":"arxiv","id":"1607.04710","version":2},"attestation_state":"computed","paper":{"title":"A Descending Price Auction for Matching Markets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Grant Schoenebeck, Jacob D. Abernethy, Shih-Tang Su, Vijay G. Subramanian","submitted_at":"2016-07-16T06:46:34Z","abstract_excerpt":"This work presents a descending-price-auction algorithm to obtain the maximum market-clearing price vector (MCP) in unit-demand matching markets with m items by exploiting the combinatorial structure. With a shrewd choice of goods for which the prices are reduced in each step, the algorithm only uses the combinatorial structure, which avoids solving LPs and enjoys a strongly polynomial runtime of $O(m^4)$. Critical to the algorithm is determining the set of under-demanded goods for which we reduce the prices simultaneously in each step of the algorithm. This we accomplish by choosing the subse"},"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":"1607.04710","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-07-16T06:46:34Z","cross_cats_sorted":[],"title_canon_sha256":"2265434fa7c262489ace29995819a2a05b3dec83b98d9da6c82e5ad826663fce","abstract_canon_sha256":"c312f8e21ecc1ec4bde39c53031d34a7d8bbc9c05b3a4a36865314b6cffb415a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:22.565692Z","signature_b64":"O9zVMVlvzx3/eVqEhFdo2gMPNFRA87w/uwSlD4AqgJMxIvwxpQ1261EH0BTo/MzZ1iOtAhzPlDdEYsPLH/YwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"935770eaf103a07ceae489ddc036a669cad8b74c81f4cc925dae8dc422b9be50","last_reissued_at":"2026-05-18T00:31:22.564944Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:22.564944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Descending Price Auction for Matching Markets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Grant Schoenebeck, Jacob D. Abernethy, Shih-Tang Su, Vijay G. Subramanian","submitted_at":"2016-07-16T06:46:34Z","abstract_excerpt":"This work presents a descending-price-auction algorithm to obtain the maximum market-clearing price vector (MCP) in unit-demand matching markets with m items by exploiting the combinatorial structure. With a shrewd choice of goods for which the prices are reduced in each step, the algorithm only uses the combinatorial structure, which avoids solving LPs and enjoys a strongly polynomial runtime of $O(m^4)$. Critical to the algorithm is determining the set of under-demanded goods for which we reduce the prices simultaneously in each step of the algorithm. This we accomplish by choosing the subse"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04710","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":""},"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":"1607.04710","created_at":"2026-05-18T00:31:22.565050+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.04710v2","created_at":"2026-05-18T00:31:22.565050+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04710","created_at":"2026-05-18T00:31:22.565050+00:00"},{"alias_kind":"pith_short_12","alias_value":"SNLXB2XRAOQH","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SNLXB2XRAOQHZ2XE","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SNLXB2XR","created_at":"2026-05-18T12:30:44.179134+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/SNLXB2XRAOQHZ2XERHO4ANVGNH","json":"https://pith.science/pith/SNLXB2XRAOQHZ2XERHO4ANVGNH.json","graph_json":"https://pith.science/api/pith-number/SNLXB2XRAOQHZ2XERHO4ANVGNH/graph.json","events_json":"https://pith.science/api/pith-number/SNLXB2XRAOQHZ2XERHO4ANVGNH/events.json","paper":"https://pith.science/paper/SNLXB2XR"},"agent_actions":{"view_html":"https://pith.science/pith/SNLXB2XRAOQHZ2XERHO4ANVGNH","download_json":"https://pith.science/pith/SNLXB2XRAOQHZ2XERHO4ANVGNH.json","view_paper":"https://pith.science/paper/SNLXB2XR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.04710&json=true","fetch_graph":"https://pith.science/api/pith-number/SNLXB2XRAOQHZ2XERHO4ANVGNH/graph.json","fetch_events":"https://pith.science/api/pith-number/SNLXB2XRAOQHZ2XERHO4ANVGNH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SNLXB2XRAOQHZ2XERHO4ANVGNH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SNLXB2XRAOQHZ2XERHO4ANVGNH/action/storage_attestation","attest_author":"https://pith.science/pith/SNLXB2XRAOQHZ2XERHO4ANVGNH/action/author_attestation","sign_citation":"https://pith.science/pith/SNLXB2XRAOQHZ2XERHO4ANVGNH/action/citation_signature","submit_replication":"https://pith.science/pith/SNLXB2XRAOQHZ2XERHO4ANVGNH/action/replication_record"}},"created_at":"2026-05-18T00:31:22.565050+00:00","updated_at":"2026-05-18T00:31:22.565050+00:00"}