{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3LYYXDQOGA4E4QJLWOTABB4E6Y","short_pith_number":"pith:3LYYXDQO","canonical_record":{"source":{"id":"1301.2276","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-01-10T16:24:02Z","cross_cats_sorted":[],"title_canon_sha256":"ec7c5b1f9dd7db9bc52b78c58d4a3d19d65f1ea63f7af03c6916b302b1759e5d","abstract_canon_sha256":"124788b28aa0d717eec48c986d95d7df5f9c7880637a0887784bf796ff08b06c"},"schema_version":"1.0"},"canonical_sha256":"daf18b8e0e30384e412bb3a6008784f63a243cd3107b7b95b08b0423e0141302","source":{"kind":"arxiv","id":"1301.2276","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2276","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2276v1","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2276","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"pith_short_12","alias_value":"3LYYXDQOGA4E","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3LYYXDQOGA4E4QJL","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3LYYXDQO","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3LYYXDQOGA4E4QJLWOTABB4E6Y","target":"record","payload":{"canonical_record":{"source":{"id":"1301.2276","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-01-10T16:24:02Z","cross_cats_sorted":[],"title_canon_sha256":"ec7c5b1f9dd7db9bc52b78c58d4a3d19d65f1ea63f7af03c6916b302b1759e5d","abstract_canon_sha256":"124788b28aa0d717eec48c986d95d7df5f9c7880637a0887784bf796ff08b06c"},"schema_version":"1.0"},"canonical_sha256":"daf18b8e0e30384e412bb3a6008784f63a243cd3107b7b95b08b0423e0141302","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:45.661698Z","signature_b64":"l6bqF4oRRe8rR0saR98OcqI7C4PN8/TFVvOV3GL0sRwHBY/Zsr2y4bGqW7oSs70JkRjgYzgmOHf0AYgf8+1KCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"daf18b8e0e30384e412bb3a6008784f63a243cd3107b7b95b08b0423e0141302","last_reissued_at":"2026-05-18T03:36:45.661123Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:45.661123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.2276","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-05-18T03:36:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AxiCBVXbfQtkEOWSF4AIrnUfxrXCuY064c2fkcQCYwT0sLZQ+Fc1/8bko5eWSV7vDYDVpjQ5zwaX8toQt40RAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T11:09:48.450959Z"},"content_sha256":"7c7964941982bcb1f31789c822467886b683ca5c1c0bb83d036a10fd990f3adf","schema_version":"1.0","event_id":"sha256:7c7964941982bcb1f31789c822467886b683ca5c1c0bb83d036a10fd990f3adf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3LYYXDQOGA4E4QJLWOTABB4E6Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Dynamic Programming Model for Determining Bidding Strategies in Sequential Auctions: Quasi-linear Utility and Budget Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Hiromitsu Hattori, Makoto Yokoo, Toramatsu Shintani, Yuko Sakurai","submitted_at":"2013-01-10T16:24:02Z","abstract_excerpt":"In this paper, we develop a new method for finding an optimal biddingstrategy in sequential auctions, using a dynamic programming technique. Theexisting method assumes that the utility of a user is represented in anadditive form. Thus, the remaining endowment of money must be explicitlyrepresented in each state, and the calculation of the optimal biddingstrategy becomes time-consuming when the initial endowment of money mbecomes large.In this paper, we develop a new problem formalization that avoids explicitlyrepresenting the remaining endowment, by assuming the utility of a user canbe represe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2276","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":""},"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-18T03:36:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w2pvhRkg+eR2Flb+Ggbv0sMdJYGhWMa7/gesifcuYXpXsGO7ltG9qUeoTTperS+zv3u86SpQxwNir04UaDT7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T11:09:48.451293Z"},"content_sha256":"76a32721fac43cfe60ca45c36d2f08f562f24ed7f5e1ea78efca237add0b426b","schema_version":"1.0","event_id":"sha256:76a32721fac43cfe60ca45c36d2f08f562f24ed7f5e1ea78efca237add0b426b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3LYYXDQOGA4E4QJLWOTABB4E6Y/bundle.json","state_url":"https://pith.science/pith/3LYYXDQOGA4E4QJLWOTABB4E6Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3LYYXDQOGA4E4QJLWOTABB4E6Y/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-30T11:09:48Z","links":{"resolver":"https://pith.science/pith/3LYYXDQOGA4E4QJLWOTABB4E6Y","bundle":"https://pith.science/pith/3LYYXDQOGA4E4QJLWOTABB4E6Y/bundle.json","state":"https://pith.science/pith/3LYYXDQOGA4E4QJLWOTABB4E6Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3LYYXDQOGA4E4QJLWOTABB4E6Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3LYYXDQOGA4E4QJLWOTABB4E6Y","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":"124788b28aa0d717eec48c986d95d7df5f9c7880637a0887784bf796ff08b06c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-01-10T16:24:02Z","title_canon_sha256":"ec7c5b1f9dd7db9bc52b78c58d4a3d19d65f1ea63f7af03c6916b302b1759e5d"},"schema_version":"1.0","source":{"id":"1301.2276","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2276","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2276v1","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2276","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"pith_short_12","alias_value":"3LYYXDQOGA4E","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3LYYXDQOGA4E4QJL","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3LYYXDQO","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:76a32721fac43cfe60ca45c36d2f08f562f24ed7f5e1ea78efca237add0b426b","target":"graph","created_at":"2026-05-18T03:36:45Z","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 this paper, we develop a new method for finding an optimal biddingstrategy in sequential auctions, using a dynamic programming technique. Theexisting method assumes that the utility of a user is represented in anadditive form. Thus, the remaining endowment of money must be explicitlyrepresented in each state, and the calculation of the optimal biddingstrategy becomes time-consuming when the initial endowment of money mbecomes large.In this paper, we develop a new problem formalization that avoids explicitlyrepresenting the remaining endowment, by assuming the utility of a user canbe represe","authors_text":"Hiromitsu Hattori, Makoto Yokoo, Toramatsu Shintani, Yuko Sakurai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-01-10T16:24:02Z","title":"A Dynamic Programming Model for Determining Bidding Strategies in Sequential Auctions: Quasi-linear Utility and Budget Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2276","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:7c7964941982bcb1f31789c822467886b683ca5c1c0bb83d036a10fd990f3adf","target":"record","created_at":"2026-05-18T03:36:45Z","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":"124788b28aa0d717eec48c986d95d7df5f9c7880637a0887784bf796ff08b06c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-01-10T16:24:02Z","title_canon_sha256":"ec7c5b1f9dd7db9bc52b78c58d4a3d19d65f1ea63f7af03c6916b302b1759e5d"},"schema_version":"1.0","source":{"id":"1301.2276","kind":"arxiv","version":1}},"canonical_sha256":"daf18b8e0e30384e412bb3a6008784f63a243cd3107b7b95b08b0423e0141302","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"daf18b8e0e30384e412bb3a6008784f63a243cd3107b7b95b08b0423e0141302","first_computed_at":"2026-05-18T03:36:45.661123Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:45.661123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l6bqF4oRRe8rR0saR98OcqI7C4PN8/TFVvOV3GL0sRwHBY/Zsr2y4bGqW7oSs70JkRjgYzgmOHf0AYgf8+1KCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:45.661698Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.2276","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c7964941982bcb1f31789c822467886b683ca5c1c0bb83d036a10fd990f3adf","sha256:76a32721fac43cfe60ca45c36d2f08f562f24ed7f5e1ea78efca237add0b426b"],"state_sha256":"2096ec7a0fe10c4705d43f3fb13be1837743e2189b7787eb4e9607e9bfb1f1ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ms6VTQoJvc6+HVk4GHTeNNtjGPQeP3oZfx9xtQfXfNDWEOGBkxS1VzaNaNiP+3xmGIKYHIqLERGH+BsrLTmDDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T11:09:48.453172Z","bundle_sha256":"fbc7e713a158a1ed5cd44b2881091d7fba679351ddc4b92d095e8118f5f86666"}}