{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FDUQU7DHU5QGFAXINW2XDDO2PX","short_pith_number":"pith:FDUQU7DH","canonical_record":{"source":{"id":"1301.6682","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:57:07Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"2dfdf0d888eb8c9c2b76e95823f4bee18a1f6cd5e09b5f5c7171faccf3b1bc74","abstract_canon_sha256":"7c4a67a494c5665efcbf739d3aef2a8e94b0b7933ed1d1295f44212e131ce4b0"},"schema_version":"1.0"},"canonical_sha256":"28e90a7c67a7606282e86db5718dda7df6cb974b9bbe01d784160a6dafd845b4","source":{"kind":"arxiv","id":"1301.6682","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6682","created_at":"2026-05-18T03:35:13Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6682v1","created_at":"2026-05-18T03:35:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6682","created_at":"2026-05-18T03:35:13Z"},{"alias_kind":"pith_short_12","alias_value":"FDUQU7DHU5QG","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FDUQU7DHU5QGFAXI","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FDUQU7DH","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FDUQU7DHU5QGFAXINW2XDDO2PX","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6682","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:57:07Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"2dfdf0d888eb8c9c2b76e95823f4bee18a1f6cd5e09b5f5c7171faccf3b1bc74","abstract_canon_sha256":"7c4a67a494c5665efcbf739d3aef2a8e94b0b7933ed1d1295f44212e131ce4b0"},"schema_version":"1.0"},"canonical_sha256":"28e90a7c67a7606282e86db5718dda7df6cb974b9bbe01d784160a6dafd845b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:13.054890Z","signature_b64":"HlrWCqTQwYS3HEdforcbEq0VKPnmWsjcGn1B8JMo2oFxE5mm2o/r4VJlcGX5Qa3mHKhhWfpEcVnpEyOZUIbIBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28e90a7c67a7606282e86db5718dda7df6cb974b9bbe01d784160a6dafd845b4","last_reissued_at":"2026-05-18T03:35:13.054136Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:13.054136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6682","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:35:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lDgwo8W1X/qklZVxYbCQpo+3iNW9Z31oBr7C0vPemq7hXPLeBAB02rUWh0EX0bW/F0X2H5YGMRIJ6sgkcN31Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:33:00.710368Z"},"content_sha256":"2111db2ab6a9f5508c4cc45c9cc93095c8786e564b2ad34680a5e377bdd47055","schema_version":"1.0","event_id":"sha256:2111db2ab6a9f5508c4cc45c9cc93095c8786e564b2ad34680a5e377bdd47055"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FDUQU7DHU5QGFAXINW2XDDO2PX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Continuous Value Function Approximation for Sequential Bidding Policies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.AI","authors_text":"Bikash Sabata, Craig Boutilier, Moises Goldszmidt","submitted_at":"2013-01-23T15:57:07Z","abstract_excerpt":"Market-based mechanisms such as auctions are being studied as an appropriate means for resource allocation in distributed and mulitagent decision problems.  When agents value resources in combination rather than in isolation, they must often deliberate about appropriate bidding strategies for a sequence of auctions offering resources of interest.  We briefly describe a discrete dynamic programming model for constructing appropriate bidding policies for resources exhibiting both complementarities and substitutability.  We then introduce a continuous approximation of this model, assuming that mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6682","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:35:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RzvSTorVY3TA50hpDmOCy75EGNxy+utHi+Y7aNArNxORM+R0CJjW+8YyL1mUHZgPf9hlsqu/VidD0kzVzD8IAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:33:00.710723Z"},"content_sha256":"80c2a8d7e15f753f964efb920ea99418af216bdfcc05ac8e04f4d15dbd312f51","schema_version":"1.0","event_id":"sha256:80c2a8d7e15f753f964efb920ea99418af216bdfcc05ac8e04f4d15dbd312f51"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FDUQU7DHU5QGFAXINW2XDDO2PX/bundle.json","state_url":"https://pith.science/pith/FDUQU7DHU5QGFAXINW2XDDO2PX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FDUQU7DHU5QGFAXINW2XDDO2PX/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-08T13:33:00Z","links":{"resolver":"https://pith.science/pith/FDUQU7DHU5QGFAXINW2XDDO2PX","bundle":"https://pith.science/pith/FDUQU7DHU5QGFAXINW2XDDO2PX/bundle.json","state":"https://pith.science/pith/FDUQU7DHU5QGFAXINW2XDDO2PX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FDUQU7DHU5QGFAXINW2XDDO2PX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FDUQU7DHU5QGFAXINW2XDDO2PX","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":"7c4a67a494c5665efcbf739d3aef2a8e94b0b7933ed1d1295f44212e131ce4b0","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:57:07Z","title_canon_sha256":"2dfdf0d888eb8c9c2b76e95823f4bee18a1f6cd5e09b5f5c7171faccf3b1bc74"},"schema_version":"1.0","source":{"id":"1301.6682","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6682","created_at":"2026-05-18T03:35:13Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6682v1","created_at":"2026-05-18T03:35:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6682","created_at":"2026-05-18T03:35:13Z"},{"alias_kind":"pith_short_12","alias_value":"FDUQU7DHU5QG","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FDUQU7DHU5QGFAXI","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FDUQU7DH","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:80c2a8d7e15f753f964efb920ea99418af216bdfcc05ac8e04f4d15dbd312f51","target":"graph","created_at":"2026-05-18T03:35:13Z","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":"Market-based mechanisms such as auctions are being studied as an appropriate means for resource allocation in distributed and mulitagent decision problems.  When agents value resources in combination rather than in isolation, they must often deliberate about appropriate bidding strategies for a sequence of auctions offering resources of interest.  We briefly describe a discrete dynamic programming model for constructing appropriate bidding policies for resources exhibiting both complementarities and substitutability.  We then introduce a continuous approximation of this model, assuming that mo","authors_text":"Bikash Sabata, Craig Boutilier, Moises Goldszmidt","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:57:07Z","title":"Continuous Value Function Approximation for Sequential Bidding Policies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6682","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:2111db2ab6a9f5508c4cc45c9cc93095c8786e564b2ad34680a5e377bdd47055","target":"record","created_at":"2026-05-18T03:35:13Z","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":"7c4a67a494c5665efcbf739d3aef2a8e94b0b7933ed1d1295f44212e131ce4b0","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:57:07Z","title_canon_sha256":"2dfdf0d888eb8c9c2b76e95823f4bee18a1f6cd5e09b5f5c7171faccf3b1bc74"},"schema_version":"1.0","source":{"id":"1301.6682","kind":"arxiv","version":1}},"canonical_sha256":"28e90a7c67a7606282e86db5718dda7df6cb974b9bbe01d784160a6dafd845b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28e90a7c67a7606282e86db5718dda7df6cb974b9bbe01d784160a6dafd845b4","first_computed_at":"2026-05-18T03:35:13.054136Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:13.054136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HlrWCqTQwYS3HEdforcbEq0VKPnmWsjcGn1B8JMo2oFxE5mm2o/r4VJlcGX5Qa3mHKhhWfpEcVnpEyOZUIbIBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:13.054890Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6682","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2111db2ab6a9f5508c4cc45c9cc93095c8786e564b2ad34680a5e377bdd47055","sha256:80c2a8d7e15f753f964efb920ea99418af216bdfcc05ac8e04f4d15dbd312f51"],"state_sha256":"bf158bb0787dac1fdb6ec9ce269c1c625aa127697f9a0a9594fa37a07e019527"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OWBQsiGg5ait5W/tgZzJskvZ5ilvk8KAy1XUZw1+iL+QjOuuxTTwMdIluRsva+LxEYZnmqQ2+gb0P7Y+yKgLCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T13:33:00.712684Z","bundle_sha256":"a35799fbb1c9e5cf4fa1173a541d36caee86971e2e58dd92168a41173ec246da"}}