{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:T56ZJELBO4QK7DAOFFAR452YD7","short_pith_number":"pith:T56ZJELB","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"},"canonical_sha256":"9f7d9491617720af8c0e29411e77581fd6fafe30863eb9ada7e57ccdfcf930c3","source":{"kind":"arxiv","id":"2602.14772","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.14772","created_at":"2026-06-25T01:17:50Z"},{"alias_kind":"arxiv_version","alias_value":"2602.14772v2","created_at":"2026-06-25T01:17:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.14772","created_at":"2026-06-25T01:17:50Z"},{"alias_kind":"pith_short_12","alias_value":"T56ZJELBO4QK","created_at":"2026-06-25T01:17:50Z"},{"alias_kind":"pith_short_16","alias_value":"T56ZJELBO4QK7DAO","created_at":"2026-06-25T01:17:50Z"},{"alias_kind":"pith_short_8","alias_value":"T56ZJELB","created_at":"2026-06-25T01:17:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:T56ZJELBO4QK7DAOFFAR452YD7","target":"record","payload":{"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"},"canonical_sha256":"9f7d9491617720af8c0e29411e77581fd6fafe30863eb9ada7e57ccdfcf930c3","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"},"source_kind":"arxiv","source_id":"2602.14772","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-06-25T01:17:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tgPw7Um5T7C4K1cjGQnYqB99fE/3vXmOlxtCkEg5DSfz3x+7iiBxydmReDYVtGEdnfurZ2hgU7VYioIaW13PDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T22:02:34.959624Z"},"content_sha256":"bb434660b21f7e01a93cb9b87590bc5d315d03c6cf5466ce33ee427411aa338d","schema_version":"1.0","event_id":"sha256:bb434660b21f7e01a93cb9b87590bc5d315d03c6cf5466ce33ee427411aa338d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:T56ZJELBO4QK7DAOFFAR452YD7","target":"graph","payload":{"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"},"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-06-25T01:17:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZVUNVVvhwoj7CQhfTYHOCGPgwORVy5VNwlrGvFfdCw26/6JgcUD++P5QKzdI+oopK4Z10Zmj+CV/lrCiq8B1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T22:02:34.960209Z"},"content_sha256":"78b43436f75ac250372cd19608025b47dab381d333be7850feb0498d93624653","schema_version":"1.0","event_id":"sha256:78b43436f75ac250372cd19608025b47dab381d333be7850feb0498d93624653"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T56ZJELBO4QK7DAOFFAR452YD7/bundle.json","state_url":"https://pith.science/pith/T56ZJELBO4QK7DAOFFAR452YD7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T56ZJELBO4QK7DAOFFAR452YD7/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-09T22:02:34Z","links":{"resolver":"https://pith.science/pith/T56ZJELBO4QK7DAOFFAR452YD7","bundle":"https://pith.science/pith/T56ZJELBO4QK7DAOFFAR452YD7/bundle.json","state":"https://pith.science/pith/T56ZJELBO4QK7DAOFFAR452YD7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T56ZJELBO4QK7DAOFFAR452YD7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:T56ZJELBO4QK7DAOFFAR452YD7","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":"a9a4908d4d26869959c2c321b73b4111358fed69dee99dd0c012e7240569e1b9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-16T14:26:25Z","title_canon_sha256":"9e14d582e7b7a780265a264e0809cb8a119c57461362a9b3481cfedfdbaedd47"},"schema_version":"1.0","source":{"id":"2602.14772","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.14772","created_at":"2026-06-25T01:17:50Z"},{"alias_kind":"arxiv_version","alias_value":"2602.14772v2","created_at":"2026-06-25T01:17:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.14772","created_at":"2026-06-25T01:17:50Z"},{"alias_kind":"pith_short_12","alias_value":"T56ZJELBO4QK","created_at":"2026-06-25T01:17:50Z"},{"alias_kind":"pith_short_16","alias_value":"T56ZJELBO4QK7DAO","created_at":"2026-06-25T01:17:50Z"},{"alias_kind":"pith_short_8","alias_value":"T56ZJELB","created_at":"2026-06-25T01:17:50Z"}],"graph_snapshots":[{"event_id":"sha256:78b43436f75ac250372cd19608025b47dab381d333be7850feb0498d93624653","target":"graph","created_at":"2026-06-25T01:17:50Z","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/2602.14772/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Sungwoo Kang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-16T14:26:25Z","title":"Learning Structural Hardness for Combinatorial Auctions: Instance-Dependent Algorithm Selection via Graph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.14772","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:bb434660b21f7e01a93cb9b87590bc5d315d03c6cf5466ce33ee427411aa338d","target":"record","created_at":"2026-06-25T01:17:50Z","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":"a9a4908d4d26869959c2c321b73b4111358fed69dee99dd0c012e7240569e1b9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-16T14:26:25Z","title_canon_sha256":"9e14d582e7b7a780265a264e0809cb8a119c57461362a9b3481cfedfdbaedd47"},"schema_version":"1.0","source":{"id":"2602.14772","kind":"arxiv","version":2}},"canonical_sha256":"9f7d9491617720af8c0e29411e77581fd6fafe30863eb9ada7e57ccdfcf930c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f7d9491617720af8c0e29411e77581fd6fafe30863eb9ada7e57ccdfcf930c3","first_computed_at":"2026-06-25T01:17:50.631765Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-25T01:17:50.631765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UcKASWtaudw6Kn9x/Uo/wG5s+9uhGALACcy5gOMTtIABT+T8Yb5Jcn8ToyoT9H/QKvyjiCnjqlIMdivwCmd+Dw==","signature_status":"signed_v1","signed_at":"2026-06-25T01:17:50.632257Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.14772","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb434660b21f7e01a93cb9b87590bc5d315d03c6cf5466ce33ee427411aa338d","sha256:78b43436f75ac250372cd19608025b47dab381d333be7850feb0498d93624653"],"state_sha256":"eaea34ea0843899c9408e7cde64cf90298d89aa916c9bf311fe6474c7bd608e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"efyupfFbvtPBH087wd40UOViysdYP0Nv0ooFJ3LWVE+A9VXE3RZid5HXMF26MU1BLNoJ0vK69JI4T/cfxHMJDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T22:02:34.965509Z","bundle_sha256":"484f1687fda1181f1b9dbed39b38c991d5811cb725b38ae6bdc3b0f8196186c6"}}