{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HTVDVPAY5JWJ5N2PWPHCXKCEDI","short_pith_number":"pith:HTVDVPAY","schema_version":"1.0","canonical_sha256":"3cea3abc18ea6c9eb74fb3ce2ba8441a1883da36e8a5cd45d5d7de8c67f5a5d1","source":{"kind":"arxiv","id":"1202.2112","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1202.2112","created_at":"2026-05-18T04:02:38.217219+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.2112v1","created_at":"2026-05-18T04:02:38.217219+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2112","created_at":"2026-05-18T04:02:38.217219+00:00"},{"alias_kind":"pith_short_12","alias_value":"HTVDVPAY5JWJ","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HTVDVPAY5JWJ5N2P","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HTVDVPAY","created_at":"2026-05-18T12:27:09.501522+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HTVDVPAY5JWJ5N2PWPHCXKCEDI","json":"https://pith.science/pith/HTVDVPAY5JWJ5N2PWPHCXKCEDI.json","graph_json":"https://pith.science/api/pith-number/HTVDVPAY5JWJ5N2PWPHCXKCEDI/graph.json","events_json":"https://pith.science/api/pith-number/HTVDVPAY5JWJ5N2PWPHCXKCEDI/events.json","paper":"https://pith.science/paper/HTVDVPAY"},"agent_actions":{"view_html":"https://pith.science/pith/HTVDVPAY5JWJ5N2PWPHCXKCEDI","download_json":"https://pith.science/pith/HTVDVPAY5JWJ5N2PWPHCXKCEDI.json","view_paper":"https://pith.science/paper/HTVDVPAY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.2112&json=true","fetch_graph":"https://pith.science/api/pith-number/HTVDVPAY5JWJ5N2PWPHCXKCEDI/graph.json","fetch_events":"https://pith.science/api/pith-number/HTVDVPAY5JWJ5N2PWPHCXKCEDI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HTVDVPAY5JWJ5N2PWPHCXKCEDI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HTVDVPAY5JWJ5N2PWPHCXKCEDI/action/storage_attestation","attest_author":"https://pith.science/pith/HTVDVPAY5JWJ5N2PWPHCXKCEDI/action/author_attestation","sign_citation":"https://pith.science/pith/HTVDVPAY5JWJ5N2PWPHCXKCEDI/action/citation_signature","submit_replication":"https://pith.science/pith/HTVDVPAY5JWJ5N2PWPHCXKCEDI/action/replication_record"}},"created_at":"2026-05-18T04:02:38.217219+00:00","updated_at":"2026-05-18T04:02:38.217219+00:00"}