{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:HTVDVPAY5JWJ5N2PWPHCXKCEDI","short_pith_number":"pith:HTVDVPAY","canonical_record":{"source":{"id":"1202.2112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-09T20:48:22Z","cross_cats_sorted":["cs.LG","cs.RO"],"title_canon_sha256":"00ba0ba00b294486de38391e0dfb27ae3a1c405e0bbe01675dbe1b1921cd7532","abstract_canon_sha256":"70a5af08413e7335574fafbc74653966d5ae8ebdf95b6af90409959b6d71dc9b"},"schema_version":"1.0"},"canonical_sha256":"3cea3abc18ea6c9eb74fb3ce2ba8441a1883da36e8a5cd45d5d7de8c67f5a5d1","source":{"kind":"arxiv","id":"1202.2112","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.2112","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"arxiv_version","alias_value":"1202.2112v1","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2112","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"pith_short_12","alias_value":"HTVDVPAY5JWJ","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HTVDVPAY5JWJ5N2P","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HTVDVPAY","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:HTVDVPAY5JWJ5N2PWPHCXKCEDI","target":"record","payload":{"canonical_record":{"source":{"id":"1202.2112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-09T20:48:22Z","cross_cats_sorted":["cs.LG","cs.RO"],"title_canon_sha256":"00ba0ba00b294486de38391e0dfb27ae3a1c405e0bbe01675dbe1b1921cd7532","abstract_canon_sha256":"70a5af08413e7335574fafbc74653966d5ae8ebdf95b6af90409959b6d71dc9b"},"schema_version":"1.0"},"canonical_sha256":"3cea3abc18ea6c9eb74fb3ce2ba8441a1883da36e8a5cd45d5d7de8c67f5a5d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:38.217754Z","signature_b64":"2gjfmnG4eSWq8cK9smz16YdLgtieyFv7fJqfKJIgdqNvCK86lX5B56jTMpd6/WIs/3Jv2LlkPlytttbM0rydBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cea3abc18ea6c9eb74fb3ce2ba8441a1883da36e8a5cd45d5d7de8c67f5a5d1","last_reissued_at":"2026-05-18T04:02:38.217121Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:38.217121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.2112","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-18T04:02:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X6XzQz7zFZA/5YA+cWmC8aSo/k0GrVyIRzn6FDw0KoQoEcW8Px1nolM0ejm+Wki7cFjoyzKE2ogeyR6PtND2Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T14:58:28.182563Z"},"content_sha256":"659dc3aa2fed9b130baceb93c8ee5bb0e262bb8421abc1b654a0f334f2d0b6f5","schema_version":"1.0","event_id":"sha256:659dc3aa2fed9b130baceb93c8ee5bb0e262bb8421abc1b654a0f334f2d0b6f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:HTVDVPAY5JWJ5N2PWPHCXKCEDI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Predicting Contextual Sequences via Submodular Function Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.RO"],"primary_cat":"cs.AI","authors_text":"Debadeepta Dey, J. Andrew Bagnell, Martial Hebert, Tian Yu Liu","submitted_at":"2012-02-09T20:48:22Z","abstract_excerpt":"Sequence optimization, where the items in a list are ordered to maximize some reward has many applications such as web advertisement placement, search, and control libraries in robotics. Previous work in sequence optimization produces a static ordering that does not take any features of the item or context of the problem into account. In this work, we propose a general approach to order the items within the sequence based on the context (e.g., perceptual information, environment description, and goals). We take a simple, efficient, reduction-based approach where the choice and order of the ite"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2112","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-18T04:02:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zRTEblIoTFpKxeLTaBiRDjwCrqWOZxVLn4SPAMnx+ZPiZC9ni2dJP1EziAFVD4GnD2gIdnlCoFqmo5QecJ86Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T14:58:28.182907Z"},"content_sha256":"efbaa995e2b637ae393a6047443a21b8e8100db98ad0de7fa20aa59527698471","schema_version":"1.0","event_id":"sha256:efbaa995e2b637ae393a6047443a21b8e8100db98ad0de7fa20aa59527698471"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HTVDVPAY5JWJ5N2PWPHCXKCEDI/bundle.json","state_url":"https://pith.science/pith/HTVDVPAY5JWJ5N2PWPHCXKCEDI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HTVDVPAY5JWJ5N2PWPHCXKCEDI/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-30T14:58:28Z","links":{"resolver":"https://pith.science/pith/HTVDVPAY5JWJ5N2PWPHCXKCEDI","bundle":"https://pith.science/pith/HTVDVPAY5JWJ5N2PWPHCXKCEDI/bundle.json","state":"https://pith.science/pith/HTVDVPAY5JWJ5N2PWPHCXKCEDI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HTVDVPAY5JWJ5N2PWPHCXKCEDI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:HTVDVPAY5JWJ5N2PWPHCXKCEDI","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":"70a5af08413e7335574fafbc74653966d5ae8ebdf95b6af90409959b6d71dc9b","cross_cats_sorted":["cs.LG","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-09T20:48:22Z","title_canon_sha256":"00ba0ba00b294486de38391e0dfb27ae3a1c405e0bbe01675dbe1b1921cd7532"},"schema_version":"1.0","source":{"id":"1202.2112","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.2112","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"arxiv_version","alias_value":"1202.2112v1","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2112","created_at":"2026-05-18T04:02:38Z"},{"alias_kind":"pith_short_12","alias_value":"HTVDVPAY5JWJ","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HTVDVPAY5JWJ5N2P","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HTVDVPAY","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:efbaa995e2b637ae393a6047443a21b8e8100db98ad0de7fa20aa59527698471","target":"graph","created_at":"2026-05-18T04:02:38Z","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":"Sequence optimization, where the items in a list are ordered to maximize some reward has many applications such as web advertisement placement, search, and control libraries in robotics. Previous work in sequence optimization produces a static ordering that does not take any features of the item or context of the problem into account. In this work, we propose a general approach to order the items within the sequence based on the context (e.g., perceptual information, environment description, and goals). We take a simple, efficient, reduction-based approach where the choice and order of the ite","authors_text":"Debadeepta Dey, J. Andrew Bagnell, Martial Hebert, Tian Yu Liu","cross_cats":["cs.LG","cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-09T20:48:22Z","title":"Predicting Contextual Sequences via Submodular Function Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2112","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:659dc3aa2fed9b130baceb93c8ee5bb0e262bb8421abc1b654a0f334f2d0b6f5","target":"record","created_at":"2026-05-18T04:02:38Z","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":"70a5af08413e7335574fafbc74653966d5ae8ebdf95b6af90409959b6d71dc9b","cross_cats_sorted":["cs.LG","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-09T20:48:22Z","title_canon_sha256":"00ba0ba00b294486de38391e0dfb27ae3a1c405e0bbe01675dbe1b1921cd7532"},"schema_version":"1.0","source":{"id":"1202.2112","kind":"arxiv","version":1}},"canonical_sha256":"3cea3abc18ea6c9eb74fb3ce2ba8441a1883da36e8a5cd45d5d7de8c67f5a5d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3cea3abc18ea6c9eb74fb3ce2ba8441a1883da36e8a5cd45d5d7de8c67f5a5d1","first_computed_at":"2026-05-18T04:02:38.217121Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:38.217121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2gjfmnG4eSWq8cK9smz16YdLgtieyFv7fJqfKJIgdqNvCK86lX5B56jTMpd6/WIs/3Jv2LlkPlytttbM0rydBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:38.217754Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.2112","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:659dc3aa2fed9b130baceb93c8ee5bb0e262bb8421abc1b654a0f334f2d0b6f5","sha256:efbaa995e2b637ae393a6047443a21b8e8100db98ad0de7fa20aa59527698471"],"state_sha256":"5385d063642e191463f4eabc5db9cf954dbd3aa054115ff20b74dff18acf096d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NzjtRVHGsFjzfbWg9cgKCGNAAEW+35r72g4rAXkXYFeynmEoIJll32lTMxMd0zSNDCYPe64VPTp266K6nOfSAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T14:58:28.184780Z","bundle_sha256":"49abe9ac3d7fff8ad6cfd31b086fdec8295de799ede593ae383d97e219786f3d"}}