{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:T56ZJELBO4QK7DAOFFAR452YD7","short_pith_number":"pith:T56ZJELB","schema_version":"1.0","canonical_sha256":"9f7d9491617720af8c0e29411e77581fd6fafe30863eb9ada7e57ccdfcf930c3","source":{"kind":"arxiv","id":"2602.14772","version":2},"attestation_state":"computed","paper":{"title":"Learning Structural Hardness for Combinatorial Auctions: Instance-Dependent Algorithm Selection via Graph Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Sungwoo Kang","submitted_at":"2026-02-16T14:26:25Z","abstract_excerpt":"The Winner Determination Problem (WDP) in combinatorial auctions is NP-hard, and no existing method reliably predicts which instances will defeat fast greedy heuristics. The ML-for-combinatorial-optimization community has focused on learning to \\emph{replace} solvers, yet recent evidence shows that graph neural networks (GNNs) rarely outperform well-tuned classical methods on standard benchmarks. We pursue a different objective: learning to predict \\emph{when} a given instance is hard for greedy allocation, enabling instance-dependent algorithm selection. We design a 20-dimensional structural "},"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":"2602.14772","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-16T14:26:25Z","cross_cats_sorted":[],"title_canon_sha256":"9e14d582e7b7a780265a264e0809cb8a119c57461362a9b3481cfedfdbaedd47","abstract_canon_sha256":"a9a4908d4d26869959c2c321b73b4111358fed69dee99dd0c012e7240569e1b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T01:17:50.632257Z","signature_b64":"UcKASWtaudw6Kn9x/Uo/wG5s+9uhGALACcy5gOMTtIABT+T8Yb5Jcn8ToyoT9H/QKvyjiCnjqlIMdivwCmd+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f7d9491617720af8c0e29411e77581fd6fafe30863eb9ada7e57ccdfcf930c3","last_reissued_at":"2026-06-25T01:17:50.631765Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T01:17:50.631765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Structural Hardness for Combinatorial Auctions: Instance-Dependent Algorithm Selection via Graph Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Sungwoo Kang","submitted_at":"2026-02-16T14:26:25Z","abstract_excerpt":"The Winner Determination Problem (WDP) in combinatorial auctions is NP-hard, and no existing method reliably predicts which instances will defeat fast greedy heuristics. The ML-for-combinatorial-optimization community has focused on learning to \\emph{replace} solvers, yet recent evidence shows that graph neural networks (GNNs) rarely outperform well-tuned classical methods on standard benchmarks. We pursue a different objective: learning to predict \\emph{when} a given instance is hard for greedy allocation, enabling instance-dependent algorithm selection. We design a 20-dimensional structural "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.14772","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/2602.14772/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":"2602.14772","created_at":"2026-06-25T01:17:50.631823+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.14772v2","created_at":"2026-06-25T01:17:50.631823+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.14772","created_at":"2026-06-25T01:17:50.631823+00:00"},{"alias_kind":"pith_short_12","alias_value":"T56ZJELBO4QK","created_at":"2026-06-25T01:17:50.631823+00:00"},{"alias_kind":"pith_short_16","alias_value":"T56ZJELBO4QK7DAO","created_at":"2026-06-25T01:17:50.631823+00:00"},{"alias_kind":"pith_short_8","alias_value":"T56ZJELB","created_at":"2026-06-25T01:17:50.631823+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/T56ZJELBO4QK7DAOFFAR452YD7","json":"https://pith.science/pith/T56ZJELBO4QK7DAOFFAR452YD7.json","graph_json":"https://pith.science/api/pith-number/T56ZJELBO4QK7DAOFFAR452YD7/graph.json","events_json":"https://pith.science/api/pith-number/T56ZJELBO4QK7DAOFFAR452YD7/events.json","paper":"https://pith.science/paper/T56ZJELB"},"agent_actions":{"view_html":"https://pith.science/pith/T56ZJELBO4QK7DAOFFAR452YD7","download_json":"https://pith.science/pith/T56ZJELBO4QK7DAOFFAR452YD7.json","view_paper":"https://pith.science/paper/T56ZJELB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.14772&json=true","fetch_graph":"https://pith.science/api/pith-number/T56ZJELBO4QK7DAOFFAR452YD7/graph.json","fetch_events":"https://pith.science/api/pith-number/T56ZJELBO4QK7DAOFFAR452YD7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T56ZJELBO4QK7DAOFFAR452YD7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T56ZJELBO4QK7DAOFFAR452YD7/action/storage_attestation","attest_author":"https://pith.science/pith/T56ZJELBO4QK7DAOFFAR452YD7/action/author_attestation","sign_citation":"https://pith.science/pith/T56ZJELBO4QK7DAOFFAR452YD7/action/citation_signature","submit_replication":"https://pith.science/pith/T56ZJELBO4QK7DAOFFAR452YD7/action/replication_record"}},"created_at":"2026-06-25T01:17:50.631823+00:00","updated_at":"2026-06-25T01:17:50.631823+00:00"}