{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EA5QQGUHPXYIKQGNC2TIR63E47","short_pith_number":"pith:EA5QQGUH","canonical_record":{"source":{"id":"1401.1061","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-06T12:42:47Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"0b4886799944921e7fe8b4dad71ce0f383cadd4c91adbfdd64f130856d1381db","abstract_canon_sha256":"62dcc1fb9f3f9d40c8c47c86e16f70dcc5f885b3ca4266f08a76e255f190623e"},"schema_version":"1.0"},"canonical_sha256":"203b081a877df08540cd16a688fb64e7c04557822589b2a596b657489e040f80","source":{"kind":"arxiv","id":"1401.1061","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.1061","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"arxiv_version","alias_value":"1401.1061v2","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1061","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"pith_short_12","alias_value":"EA5QQGUHPXYI","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EA5QQGUHPXYIKQGN","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EA5QQGUH","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EA5QQGUHPXYIKQGNC2TIR63E47","target":"record","payload":{"canonical_record":{"source":{"id":"1401.1061","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-06T12:42:47Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"0b4886799944921e7fe8b4dad71ce0f383cadd4c91adbfdd64f130856d1381db","abstract_canon_sha256":"62dcc1fb9f3f9d40c8c47c86e16f70dcc5f885b3ca4266f08a76e255f190623e"},"schema_version":"1.0"},"canonical_sha256":"203b081a877df08540cd16a688fb64e7c04557822589b2a596b657489e040f80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:26.583733Z","signature_b64":"nZw+fZI3B0pVtag6FTEDPeuhxy+NDL/H97I+OUQPQiimyD7AG9SYlxkl6LwCwQjeTQNW0iN0SCM+ty5uBDxYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"203b081a877df08540cd16a688fb64e7c04557822589b2a596b657489e040f80","last_reissued_at":"2026-05-18T00:03:26.583267Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:26.583267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.1061","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-05-18T00:03:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pq5fV962VrdwMTnYMJWV8OQ9wHLdbZU8mWFRIZ3ZbN7Lue0NvJt0W7XTM2u7ajsRvsYRIPjrPM+i2xaxn7KzBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:41:31.277906Z"},"content_sha256":"7edaffbe9f0fd43b99ecda8a4c2cfb03ca105e1f1f74774c1b16706df07f85a2","schema_version":"1.0","event_id":"sha256:7edaffbe9f0fd43b99ecda8a4c2cfb03ca105e1f1f74774c1b16706df07f85a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EA5QQGUHPXYIKQGNC2TIR63E47","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning optimization models in the presence of unknown relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.AI","authors_text":"Qing Chuan Ye, Sicco Verwer, Yingqian Zhang","submitted_at":"2014-01-06T12:42:47Z","abstract_excerpt":"In a sequential auction with multiple bidding agents, it is highly challenging to determine the ordering of the items to sell in order to maximize the revenue due to the fact that the autonomy and private information of the agents heavily influence the outcome of the auction.\n  The main contribution of this paper is two-fold. First, we demonstrate how to apply machine learning techniques to solve the optimal ordering problem in sequential auctions. We learn regression models from historical auctions, which are subsequently used to predict the expected value of orderings for new auctions. Given"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1061","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"},"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-05-18T00:03:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K4StRpTQGIwIJef0GMgTXWQf8AoxY17X6Ad1dtc8alD7dCmtRXOuGLCjfNIsVMsuCK4VFzqDYNJXfqcYOZCZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:41:31.279108Z"},"content_sha256":"f7ce9a77deb049ec26558c257643f30fd06f50be54e7b7387f12e59cbc838dea","schema_version":"1.0","event_id":"sha256:f7ce9a77deb049ec26558c257643f30fd06f50be54e7b7387f12e59cbc838dea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EA5QQGUHPXYIKQGNC2TIR63E47/bundle.json","state_url":"https://pith.science/pith/EA5QQGUHPXYIKQGNC2TIR63E47/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EA5QQGUHPXYIKQGNC2TIR63E47/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-06-12T03:41:31Z","links":{"resolver":"https://pith.science/pith/EA5QQGUHPXYIKQGNC2TIR63E47","bundle":"https://pith.science/pith/EA5QQGUHPXYIKQGNC2TIR63E47/bundle.json","state":"https://pith.science/pith/EA5QQGUHPXYIKQGNC2TIR63E47/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EA5QQGUHPXYIKQGNC2TIR63E47/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EA5QQGUHPXYIKQGNC2TIR63E47","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":"62dcc1fb9f3f9d40c8c47c86e16f70dcc5f885b3ca4266f08a76e255f190623e","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-06T12:42:47Z","title_canon_sha256":"0b4886799944921e7fe8b4dad71ce0f383cadd4c91adbfdd64f130856d1381db"},"schema_version":"1.0","source":{"id":"1401.1061","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.1061","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"arxiv_version","alias_value":"1401.1061v2","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1061","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"pith_short_12","alias_value":"EA5QQGUHPXYI","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EA5QQGUHPXYIKQGN","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EA5QQGUH","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:f7ce9a77deb049ec26558c257643f30fd06f50be54e7b7387f12e59cbc838dea","target":"graph","created_at":"2026-05-18T00:03:26Z","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"},"paper":{"abstract_excerpt":"In a sequential auction with multiple bidding agents, it is highly challenging to determine the ordering of the items to sell in order to maximize the revenue due to the fact that the autonomy and private information of the agents heavily influence the outcome of the auction.\n  The main contribution of this paper is two-fold. First, we demonstrate how to apply machine learning techniques to solve the optimal ordering problem in sequential auctions. We learn regression models from historical auctions, which are subsequently used to predict the expected value of orderings for new auctions. Given","authors_text":"Qing Chuan Ye, Sicco Verwer, Yingqian Zhang","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-06T12:42:47Z","title":"Learning optimization models in the presence of unknown relations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1061","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:7edaffbe9f0fd43b99ecda8a4c2cfb03ca105e1f1f74774c1b16706df07f85a2","target":"record","created_at":"2026-05-18T00:03:26Z","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":"62dcc1fb9f3f9d40c8c47c86e16f70dcc5f885b3ca4266f08a76e255f190623e","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-06T12:42:47Z","title_canon_sha256":"0b4886799944921e7fe8b4dad71ce0f383cadd4c91adbfdd64f130856d1381db"},"schema_version":"1.0","source":{"id":"1401.1061","kind":"arxiv","version":2}},"canonical_sha256":"203b081a877df08540cd16a688fb64e7c04557822589b2a596b657489e040f80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"203b081a877df08540cd16a688fb64e7c04557822589b2a596b657489e040f80","first_computed_at":"2026-05-18T00:03:26.583267Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:26.583267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nZw+fZI3B0pVtag6FTEDPeuhxy+NDL/H97I+OUQPQiimyD7AG9SYlxkl6LwCwQjeTQNW0iN0SCM+ty5uBDxYBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:26.583733Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.1061","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7edaffbe9f0fd43b99ecda8a4c2cfb03ca105e1f1f74774c1b16706df07f85a2","sha256:f7ce9a77deb049ec26558c257643f30fd06f50be54e7b7387f12e59cbc838dea"],"state_sha256":"05c4b99d5b10b364759188f73b4a7804cf9245957536ba8806b5421f471edf8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fU+hLmYK7DULMy/GVrdVFLtGUA9kbmzrA4Q+iLujU3sqvmeFWCgOrp4q59mnEZIQMxycBJXWs3071KtKf7LUDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T03:41:31.283026Z","bundle_sha256":"ce4717a9cc6b23e2700c48b05c025de7ca34d4192fa9679553a815c323fd124b"}}