{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:UTWTPC3BFSFWCEKMAVQRZ4RNNP","short_pith_number":"pith:UTWTPC3B","canonical_record":{"source":{"id":"2501.19219","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-01-31T15:27:29Z","cross_cats_sorted":[],"title_canon_sha256":"cf7311afac57c43d9170d6092056cecc8e0c94b01d6a2c05520e60caad43294e","abstract_canon_sha256":"a2421a0fac23069f329f669bf1724699a5eebeb24ed867c556651ce5bf24f1ab"},"schema_version":"1.0"},"canonical_sha256":"a4ed378b612c8b61114c05611cf22d6bceefe6273d9875a73bb0c3fcd64519e4","source":{"kind":"arxiv","id":"2501.19219","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.19219","created_at":"2026-07-05T10:07:57Z"},{"alias_kind":"arxiv_version","alias_value":"2501.19219v1","created_at":"2026-07-05T10:07:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.19219","created_at":"2026-07-05T10:07:57Z"},{"alias_kind":"pith_short_12","alias_value":"UTWTPC3BFSFW","created_at":"2026-07-05T10:07:57Z"},{"alias_kind":"pith_short_16","alias_value":"UTWTPC3BFSFWCEKM","created_at":"2026-07-05T10:07:57Z"},{"alias_kind":"pith_short_8","alias_value":"UTWTPC3B","created_at":"2026-07-05T10:07:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:UTWTPC3BFSFWCEKMAVQRZ4RNNP","target":"record","payload":{"canonical_record":{"source":{"id":"2501.19219","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-01-31T15:27:29Z","cross_cats_sorted":[],"title_canon_sha256":"cf7311afac57c43d9170d6092056cecc8e0c94b01d6a2c05520e60caad43294e","abstract_canon_sha256":"a2421a0fac23069f329f669bf1724699a5eebeb24ed867c556651ce5bf24f1ab"},"schema_version":"1.0"},"canonical_sha256":"a4ed378b612c8b61114c05611cf22d6bceefe6273d9875a73bb0c3fcd64519e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:07:57.951517Z","signature_b64":"Lx7CUkAgzSVDiVrnldlZTeANLmDZlJIh/E6ueM4Uow9eMybYXAOYNfHEP7QJnd+0QyAIXBByNeJobugkEhyCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4ed378b612c8b61114c05611cf22d6bceefe6273d9875a73bb0c3fcd64519e4","last_reissued_at":"2026-07-05T10:07:57.951013Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:07:57.951013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.19219","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-05T10:07:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YjdFeXJNvxXrC1BwYweHpocWQwkyzd4tJRjjyDastH7QS13vFdQBQDlKtdaPOpXHXksz/aUOOPerezctLlAbBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T17:12:00.306568Z"},"content_sha256":"4d755e822a947e4fcdb0b19d05a2e9521325d7bf2f829e86853cf7159573e03d","schema_version":"1.0","event_id":"sha256:4d755e822a947e4fcdb0b19d05a2e9521325d7bf2f829e86853cf7159573e03d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:UTWTPC3BFSFWCEKMAVQRZ4RNNP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Advancing Differentiable Economics: A Neural Network Framework for Revenue-Maximizing Combinatorial Auction Mechanisms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Mai Pham, Peter Chin, Vikrant Vaze","submitted_at":"2025-01-31T15:27:29Z","abstract_excerpt":"Differentiable economics, which uses neural networks as function approximators and gradient-based optimization in automated mechanism design (AMD), marked a significant breakthrough with the introduction of RegretNet \\citep{regretnet_paper}. It combines the flexibility of deep learning with a regret-based approach to relax incentive compatibility, allowing for approximations of revenue-maximizing auctions. However, applying these techniques to combinatorial auctions (CAs) - where bidders value bundles rather than individual items, capturing item interdependencies - remains a challenge, primari"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.19219","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/2501.19219/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:07:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7DeMFWzCe8yD/bnzbVKhj10VBjalBxLy3qEiuqa9/N9krrBmk1GpIOtXnTvq4SYF/2VOTndpS4xV1ns8nKfNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T17:12:00.307055Z"},"content_sha256":"d4ff5f6aec8870b75550146393cde091316ad7c928203f63f0a7069f60ca9f9b","schema_version":"1.0","event_id":"sha256:d4ff5f6aec8870b75550146393cde091316ad7c928203f63f0a7069f60ca9f9b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UTWTPC3BFSFWCEKMAVQRZ4RNNP/bundle.json","state_url":"https://pith.science/pith/UTWTPC3BFSFWCEKMAVQRZ4RNNP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UTWTPC3BFSFWCEKMAVQRZ4RNNP/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-08T17:12:00Z","links":{"resolver":"https://pith.science/pith/UTWTPC3BFSFWCEKMAVQRZ4RNNP","bundle":"https://pith.science/pith/UTWTPC3BFSFWCEKMAVQRZ4RNNP/bundle.json","state":"https://pith.science/pith/UTWTPC3BFSFWCEKMAVQRZ4RNNP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UTWTPC3BFSFWCEKMAVQRZ4RNNP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:UTWTPC3BFSFWCEKMAVQRZ4RNNP","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":"a2421a0fac23069f329f669bf1724699a5eebeb24ed867c556651ce5bf24f1ab","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-01-31T15:27:29Z","title_canon_sha256":"cf7311afac57c43d9170d6092056cecc8e0c94b01d6a2c05520e60caad43294e"},"schema_version":"1.0","source":{"id":"2501.19219","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.19219","created_at":"2026-07-05T10:07:57Z"},{"alias_kind":"arxiv_version","alias_value":"2501.19219v1","created_at":"2026-07-05T10:07:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.19219","created_at":"2026-07-05T10:07:57Z"},{"alias_kind":"pith_short_12","alias_value":"UTWTPC3BFSFW","created_at":"2026-07-05T10:07:57Z"},{"alias_kind":"pith_short_16","alias_value":"UTWTPC3BFSFWCEKM","created_at":"2026-07-05T10:07:57Z"},{"alias_kind":"pith_short_8","alias_value":"UTWTPC3B","created_at":"2026-07-05T10:07:57Z"}],"graph_snapshots":[{"event_id":"sha256:d4ff5f6aec8870b75550146393cde091316ad7c928203f63f0a7069f60ca9f9b","target":"graph","created_at":"2026-07-05T10:07:57Z","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/2501.19219/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Differentiable economics, which uses neural networks as function approximators and gradient-based optimization in automated mechanism design (AMD), marked a significant breakthrough with the introduction of RegretNet \\citep{regretnet_paper}. It combines the flexibility of deep learning with a regret-based approach to relax incentive compatibility, allowing for approximations of revenue-maximizing auctions. However, applying these techniques to combinatorial auctions (CAs) - where bidders value bundles rather than individual items, capturing item interdependencies - remains a challenge, primari","authors_text":"Mai Pham, Peter Chin, Vikrant Vaze","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-01-31T15:27:29Z","title":"Advancing Differentiable Economics: A Neural Network Framework for Revenue-Maximizing Combinatorial Auction Mechanisms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.19219","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:4d755e822a947e4fcdb0b19d05a2e9521325d7bf2f829e86853cf7159573e03d","target":"record","created_at":"2026-07-05T10:07:57Z","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":"a2421a0fac23069f329f669bf1724699a5eebeb24ed867c556651ce5bf24f1ab","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-01-31T15:27:29Z","title_canon_sha256":"cf7311afac57c43d9170d6092056cecc8e0c94b01d6a2c05520e60caad43294e"},"schema_version":"1.0","source":{"id":"2501.19219","kind":"arxiv","version":1}},"canonical_sha256":"a4ed378b612c8b61114c05611cf22d6bceefe6273d9875a73bb0c3fcd64519e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4ed378b612c8b61114c05611cf22d6bceefe6273d9875a73bb0c3fcd64519e4","first_computed_at":"2026-07-05T10:07:57.951013Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:07:57.951013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Lx7CUkAgzSVDiVrnldlZTeANLmDZlJIh/E6ueM4Uow9eMybYXAOYNfHEP7QJnd+0QyAIXBByNeJobugkEhyCDg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:07:57.951517Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.19219","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d755e822a947e4fcdb0b19d05a2e9521325d7bf2f829e86853cf7159573e03d","sha256:d4ff5f6aec8870b75550146393cde091316ad7c928203f63f0a7069f60ca9f9b"],"state_sha256":"c247b436bdec8d854a7bca7d69ca169907e36dc3906b4864f15f8913bd54e6f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QgeS1YFTzr/d9t1SjFhTQHJjZTi4uclbSwUUr0Mw59wne0t8q64auj/HIMTuJTAljbhdQafOSDK7JCty9KCwAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T17:12:00.310642Z","bundle_sha256":"92c271384ad7c25a44e404ebbd4b27f8aa4aeb9bac8dd85b931bb6eed4435c6c"}}