{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VQVFLW6V4NBDYCPGYSTCGOSJ26","short_pith_number":"pith:VQVFLW6V","schema_version":"1.0","canonical_sha256":"ac2a55dbd5e3423c09e6c4a6233a49d78ef452ca9b811d3d57a67fe9baf787cb","source":{"kind":"arxiv","id":"2607.11210","version":1},"attestation_state":"computed","paper":{"title":"Decoupling Corruption and Horizon in Robust Contextual Pricing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Francesco Emanuele Stradi, Matteo Castiglioni","submitted_at":"2026-07-13T08:02:18Z","abstract_excerpt":"We study robust repeated contextual pricing, where valuations depends linearly on the features. At each round $t\\in[T]$, a seller observes a context, posts a price, and receives only a possibly corrupted binary sale feedback. The seller knows an upper bound $C$ on the number of corrupted rounds. We design an algorithm with regret $\\mathcal O(Cd+d^2\\log T)$, where $d$ is the context dimension. This is the first guarantee for robust contextual pricing that separates the dependence on the corruption budget $C$ from the horizon $T$, closing the problem left open by Gupta, Guruganesh, Paes Leme, an"},"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":"2607.11210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-07-13T08:02:18Z","cross_cats_sorted":[],"title_canon_sha256":"813092f099d32e9b225975098e4dd63f3f263c68568d39f96cc99e5f8d50e883","abstract_canon_sha256":"54ecf8eecc8c8b37df5c115dd945c6f8b2b5dc26efd3cedecb49e653e1bf816c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T01:22:22.565598Z","signature_b64":"zZGLEcbGtBwcNe4clfoCREdUUOFR2oH8IJgFNDyAc1P+5Fwi7YZLy7TAD7kfI5INpfuiJi4eKJAHFh5IuHusBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac2a55dbd5e3423c09e6c4a6233a49d78ef452ca9b811d3d57a67fe9baf787cb","last_reissued_at":"2026-07-14T01:22:22.564681Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T01:22:22.564681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decoupling Corruption and Horizon in Robust Contextual Pricing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Francesco Emanuele Stradi, Matteo Castiglioni","submitted_at":"2026-07-13T08:02:18Z","abstract_excerpt":"We study robust repeated contextual pricing, where valuations depends linearly on the features. At each round $t\\in[T]$, a seller observes a context, posts a price, and receives only a possibly corrupted binary sale feedback. The seller knows an upper bound $C$ on the number of corrupted rounds. We design an algorithm with regret $\\mathcal O(Cd+d^2\\log T)$, where $d$ is the context dimension. This is the first guarantee for robust contextual pricing that separates the dependence on the corruption budget $C$ from the horizon $T$, closing the problem left open by Gupta, Guruganesh, Paes Leme, an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.11210","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.11210/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.11210","created_at":"2026-07-14T01:22:22.565131+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.11210v1","created_at":"2026-07-14T01:22:22.565131+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.11210","created_at":"2026-07-14T01:22:22.565131+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQVFLW6V4NBD","created_at":"2026-07-14T01:22:22.565131+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQVFLW6V4NBDYCPG","created_at":"2026-07-14T01:22:22.565131+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQVFLW6V","created_at":"2026-07-14T01:22:22.565131+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/VQVFLW6V4NBDYCPGYSTCGOSJ26","json":"https://pith.science/pith/VQVFLW6V4NBDYCPGYSTCGOSJ26.json","graph_json":"https://pith.science/api/pith-number/VQVFLW6V4NBDYCPGYSTCGOSJ26/graph.json","events_json":"https://pith.science/api/pith-number/VQVFLW6V4NBDYCPGYSTCGOSJ26/events.json","paper":"https://pith.science/paper/VQVFLW6V"},"agent_actions":{"view_html":"https://pith.science/pith/VQVFLW6V4NBDYCPGYSTCGOSJ26","download_json":"https://pith.science/pith/VQVFLW6V4NBDYCPGYSTCGOSJ26.json","view_paper":"https://pith.science/paper/VQVFLW6V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.11210&json=true","fetch_graph":"https://pith.science/api/pith-number/VQVFLW6V4NBDYCPGYSTCGOSJ26/graph.json","fetch_events":"https://pith.science/api/pith-number/VQVFLW6V4NBDYCPGYSTCGOSJ26/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQVFLW6V4NBDYCPGYSTCGOSJ26/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQVFLW6V4NBDYCPGYSTCGOSJ26/action/storage_attestation","attest_author":"https://pith.science/pith/VQVFLW6V4NBDYCPGYSTCGOSJ26/action/author_attestation","sign_citation":"https://pith.science/pith/VQVFLW6V4NBDYCPGYSTCGOSJ26/action/citation_signature","submit_replication":"https://pith.science/pith/VQVFLW6V4NBDYCPGYSTCGOSJ26/action/replication_record"}},"created_at":"2026-07-14T01:22:22.565131+00:00","updated_at":"2026-07-14T01:22:22.565131+00:00"}