{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:4UBO4OFWBNFWQZPKJIPJJWDY2S","short_pith_number":"pith:4UBO4OFW","canonical_record":{"source":{"id":"2605.15411","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-14T20:53:23Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"e79ebfe63e42145a850c015dc15b97c140245c16344fac9caf43e04d89bb80c3","abstract_canon_sha256":"3d59096f3bd29415ea9a139d7bff9f83170fdc8514151c3ba6eabfd7d9e546d1"},"schema_version":"1.0"},"canonical_sha256":"e502ee38b60b4b6865ea4a1e94d878d4a63f13df9b0ebb116a3d6d44f3911a67","source":{"kind":"arxiv","id":"2605.15411","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15411","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15411v1","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15411","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"pith_short_12","alias_value":"4UBO4OFWBNFW","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"pith_short_16","alias_value":"4UBO4OFWBNFWQZPK","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"pith_short_8","alias_value":"4UBO4OFW","created_at":"2026-05-20T00:00:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:4UBO4OFWBNFWQZPKJIPJJWDY2S","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15411","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-14T20:53:23Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"e79ebfe63e42145a850c015dc15b97c140245c16344fac9caf43e04d89bb80c3","abstract_canon_sha256":"3d59096f3bd29415ea9a139d7bff9f83170fdc8514151c3ba6eabfd7d9e546d1"},"schema_version":"1.0"},"canonical_sha256":"e502ee38b60b4b6865ea4a1e94d878d4a63f13df9b0ebb116a3d6d44f3911a67","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:57.211409Z","signature_b64":"XmZALDpNi1Ez/0cKA26NSyC8QYyjRwSTYZe6OGKdWNNbDWqgWynh7l6FNzszcEzIvT3iRIMDOJHnQq/9nOFKAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e502ee38b60b4b6865ea4a1e94d878d4a63f13df9b0ebb116a3d6d44f3911a67","last_reissued_at":"2026-05-20T00:00:57.210540Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:57.210540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15411","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-20T00:00:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rt3TM+XAQReZH1JSzqy7xh/+rccx4ErLg6SpW9t0e/40wTE8hMMhBo2qUWHjFYh6nGJJiFFGEVAeEh0TFRgXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:00:33.614270Z"},"content_sha256":"9f99a83d10194ba20c3ea5af47ead2701dbdd91384a18acb06afa88ee2bb774d","schema_version":"1.0","event_id":"sha256:9f99a83d10194ba20c3ea5af47ead2701dbdd91384a18acb06afa88ee2bb774d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:4UBO4OFWBNFWQZPKJIPJJWDY2S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Harnessing Unimodality in Semiparametric Contextual Pricing via Oracle Price Map Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"In semiparametric contextual pricing, a scalar-index pilot reduces the problem to learning a one-dimensional smooth oracle price map whose nonparametric cost is minimax sharp.","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Jinchi Lv, Xiaocong Xu, Yingying Fan, Yuxuan Han, Zhengyuan Zhou","submitted_at":"2026-05-14T20:53:23Z","abstract_excerpt":"We study contextual dynamic pricing in a semiparametric scalar-index valuation model where the latent value is $v_t=\\mu_\\ast(\\mathsf c_t)+\\xi_t$, with an unknown utility map $\\mu_\\ast$ and an unknown additive noise distribution. The key decision object is the one-dimensional oracle price map $u\\mapsto p^\\ast(u)$ induced by the scalar index $u=\\mu_\\ast(\\mathsf c)$ and the noise tail. Under the $\\beta$-H\\\"older smoothness of the tail function for $\\beta\\geq 2$ and a revenue-geometry condition that gives a unique, stable, interior maximizer, this oracle map is itself $(\\beta-1)$-smooth. We exploi"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The resulting policy achieves regret Õ(T^{(2β-1)/(4β-3)} + √(dT)). For fixed d, we establish a matching lower bound in the horizon dependence, unveiling that the nonparametric oracle-map learning term is minimax sharp.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The revenue-geometry condition that gives a unique, stable, interior maximizer of the expected revenue function for each scalar index u (invoked to guarantee that the oracle price map is well-defined and (β-1)-smooth).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"ORBIT learns the (β-1)-smooth oracle price map via local polynomial approximation and bandit convex optimization in a semiparametric contextual pricing model, achieving regret Õ(T^{(2β-1)/(4β-3)} + √(dT)) with a matching lower bound for fixed d.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"In semiparametric contextual pricing, a scalar-index pilot reduces the problem to learning a one-dimensional smooth oracle price map whose nonparametric cost is minimax sharp.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"d35d7ce6e354ce026ce1c05fbad854bd071ce169fd87e6b014b4fb75eec128ab"},"source":{"id":"2605.15411","kind":"arxiv","version":1},"verdict":{"id":"6b10b5c9-841a-4362-bd21-12eb064469a2","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T15:15:31.851902Z","strongest_claim":"The resulting policy achieves regret Õ(T^{(2β-1)/(4β-3)} + √(dT)). For fixed d, we establish a matching lower bound in the horizon dependence, unveiling that the nonparametric oracle-map learning term is minimax sharp.","one_line_summary":"ORBIT learns the (β-1)-smooth oracle price map via local polynomial approximation and bandit convex optimization in a semiparametric contextual pricing model, achieving regret Õ(T^{(2β-1)/(4β-3)} + √(dT)) with a matching lower bound for fixed d.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The revenue-geometry condition that gives a unique, stable, interior maximizer of the expected revenue function for each scalar index u (invoked to guarantee that the oracle price map is well-defined and (β-1)-smooth).","pith_extraction_headline":"In semiparametric contextual pricing, a scalar-index pilot reduces the problem to learning a one-dimensional smooth oracle price map whose nonparametric cost is minimax sharp."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15411/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"cited_work_retraction","ran_at":"2026-05-19T16:23:38.500435Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T15:50:47.046163Z","status":"completed","version":"0.1.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T15:31:17.809540Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T15:21:50.729399Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.151793Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.710623Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"a98d6834a08e72498c7e2ea78017d30c1bfc1a8ebad9b31fdb008a3decf4287b"},"references":{"count":56,"sample":[{"doi":"","year":1995,"title":"Proceedings of IEEE 36th Annual Foundations of Computer Science , pages=","work_id":"3c2cc0d0-f984-4881-8e32-dc965235e5bf","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"SIAM Journal on Computing , volume=","work_id":"b21af1d3-4acd-41ab-86a6-3c4f1b8bf812","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Revenue Maximization Under Sequential Price Competition Via The Estimation Of s-Concave Demand Functions","work_id":"f8539a7c-eacb-4fda-9db1-47d4519caa1f","ref_index":3,"cited_arxiv_id":"2503.16737","is_internal_anchor":true},{"doi":"","year":null,"title":"A Distribution-Free Theory of Nonparametric Regression , publisher =","work_id":"4a13409c-4581-45f7-a3fc-89e512ddd1a6","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"arXiv preprint arXiv:2405.06866 , year=","work_id":"0ceff58f-f03e-4bb4-aa5e-77276bcdfd0c","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":56,"snapshot_sha256":"650e6010060e5d0f6f6abe00149853ddb9f1b07a760eed381b9183440423089c","internal_anchors":1},"formal_canon":{"evidence_count":2,"snapshot_sha256":"9c3ac660644b1797fce0bfa3338c91c79d123057a33521f0c80caba98914b73c"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"6b10b5c9-841a-4362-bd21-12eb064469a2"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:00:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Tdi2Gz20RSGCGv59DssdqHFV6sbSGrh15Ce3/Dy+zuyeQp0Ttl03yTdPTnL2DG7xKwsIGtG4p7hXeKUWD+zCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:00:33.615628Z"},"content_sha256":"83eba8c104a5af6a342cfe5f3912c05ed5cf7b71baa066ec56584763d812eab8","schema_version":"1.0","event_id":"sha256:83eba8c104a5af6a342cfe5f3912c05ed5cf7b71baa066ec56584763d812eab8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4UBO4OFWBNFWQZPKJIPJJWDY2S/bundle.json","state_url":"https://pith.science/pith/4UBO4OFWBNFWQZPKJIPJJWDY2S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4UBO4OFWBNFWQZPKJIPJJWDY2S/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-05-26T22:00:33Z","links":{"resolver":"https://pith.science/pith/4UBO4OFWBNFWQZPKJIPJJWDY2S","bundle":"https://pith.science/pith/4UBO4OFWBNFWQZPKJIPJJWDY2S/bundle.json","state":"https://pith.science/pith/4UBO4OFWBNFWQZPKJIPJJWDY2S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4UBO4OFWBNFWQZPKJIPJJWDY2S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4UBO4OFWBNFWQZPKJIPJJWDY2S","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":"3d59096f3bd29415ea9a139d7bff9f83170fdc8514151c3ba6eabfd7d9e546d1","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-14T20:53:23Z","title_canon_sha256":"e79ebfe63e42145a850c015dc15b97c140245c16344fac9caf43e04d89bb80c3"},"schema_version":"1.0","source":{"id":"2605.15411","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15411","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15411v1","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15411","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"pith_short_12","alias_value":"4UBO4OFWBNFW","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"pith_short_16","alias_value":"4UBO4OFWBNFWQZPK","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"pith_short_8","alias_value":"4UBO4OFW","created_at":"2026-05-20T00:00:57Z"}],"graph_snapshots":[{"event_id":"sha256:83eba8c104a5af6a342cfe5f3912c05ed5cf7b71baa066ec56584763d812eab8","target":"graph","created_at":"2026-05-20T00:00:57Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"The resulting policy achieves regret Õ(T^{(2β-1)/(4β-3)} + √(dT)). For fixed d, we establish a matching lower bound in the horizon dependence, unveiling that the nonparametric oracle-map learning term is minimax sharp."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The revenue-geometry condition that gives a unique, stable, interior maximizer of the expected revenue function for each scalar index u (invoked to guarantee that the oracle price map is well-defined and (β-1)-smooth)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"ORBIT learns the (β-1)-smooth oracle price map via local polynomial approximation and bandit convex optimization in a semiparametric contextual pricing model, achieving regret Õ(T^{(2β-1)/(4β-3)} + √(dT)) with a matching lower bound for fixed d."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"In semiparametric contextual pricing, a scalar-index pilot reduces the problem to learning a one-dimensional smooth oracle price map whose nonparametric cost is minimax sharp."}],"snapshot_sha256":"d35d7ce6e354ce026ce1c05fbad854bd071ce169fd87e6b014b4fb75eec128ab"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"9c3ac660644b1797fce0bfa3338c91c79d123057a33521f0c80caba98914b73c"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T16:23:38.500435Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T15:50:47.046163Z","status":"completed","version":"0.1.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T15:31:17.809540Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T15:21:50.729399Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.151793Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.710623Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15411/integrity.json","findings":[],"snapshot_sha256":"a98d6834a08e72498c7e2ea78017d30c1bfc1a8ebad9b31fdb008a3decf4287b","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study contextual dynamic pricing in a semiparametric scalar-index valuation model where the latent value is $v_t=\\mu_\\ast(\\mathsf c_t)+\\xi_t$, with an unknown utility map $\\mu_\\ast$ and an unknown additive noise distribution. The key decision object is the one-dimensional oracle price map $u\\mapsto p^\\ast(u)$ induced by the scalar index $u=\\mu_\\ast(\\mathsf c)$ and the noise tail. Under the $\\beta$-H\\\"older smoothness of the tail function for $\\beta\\geq 2$ and a revenue-geometry condition that gives a unique, stable, interior maximizer, this oracle map is itself $(\\beta-1)$-smooth. We exploi","authors_text":"Jinchi Lv, Xiaocong Xu, Yingying Fan, Yuxuan Han, Zhengyuan Zhou","cross_cats":["cs.LG","math.OC"],"headline":"In semiparametric contextual pricing, a scalar-index pilot reduces the problem to learning a one-dimensional smooth oracle price map whose nonparametric cost is minimax sharp.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-14T20:53:23Z","title":"Harnessing Unimodality in Semiparametric Contextual Pricing via Oracle Price Map Learning"},"references":{"count":56,"internal_anchors":1,"resolved_work":56,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Proceedings of IEEE 36th Annual Foundations of Computer Science , pages=","work_id":"3c2cc0d0-f984-4881-8e32-dc965235e5bf","year":1995},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"SIAM Journal on Computing , volume=","work_id":"b21af1d3-4acd-41ab-86a6-3c4f1b8bf812","year":null},{"cited_arxiv_id":"2503.16737","doi":"","is_internal_anchor":true,"ref_index":3,"title":"Revenue Maximization Under Sequential Price Competition Via The Estimation Of s-Concave Demand Functions","work_id":"f8539a7c-eacb-4fda-9db1-47d4519caa1f","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"A Distribution-Free Theory of Nonparametric Regression , publisher =","work_id":"4a13409c-4581-45f7-a3fc-89e512ddd1a6","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"arXiv preprint arXiv:2405.06866 , year=","work_id":"0ceff58f-f03e-4bb4-aa5e-77276bcdfd0c","year":null}],"snapshot_sha256":"650e6010060e5d0f6f6abe00149853ddb9f1b07a760eed381b9183440423089c"},"source":{"id":"2605.15411","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T15:15:31.851902Z","id":"6b10b5c9-841a-4362-bd21-12eb064469a2","model_set":{"reader":"grok-4.3"},"one_line_summary":"ORBIT learns the (β-1)-smooth oracle price map via local polynomial approximation and bandit convex optimization in a semiparametric contextual pricing model, achieving regret Õ(T^{(2β-1)/(4β-3)} + √(dT)) with a matching lower bound for fixed d.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"In semiparametric contextual pricing, a scalar-index pilot reduces the problem to learning a one-dimensional smooth oracle price map whose nonparametric cost is minimax sharp.","strongest_claim":"The resulting policy achieves regret Õ(T^{(2β-1)/(4β-3)} + √(dT)). For fixed d, we establish a matching lower bound in the horizon dependence, unveiling that the nonparametric oracle-map learning term is minimax sharp.","weakest_assumption":"The revenue-geometry condition that gives a unique, stable, interior maximizer of the expected revenue function for each scalar index u (invoked to guarantee that the oracle price map is well-defined and (β-1)-smooth)."}},"verdict_id":"6b10b5c9-841a-4362-bd21-12eb064469a2"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9f99a83d10194ba20c3ea5af47ead2701dbdd91384a18acb06afa88ee2bb774d","target":"record","created_at":"2026-05-20T00:00:57Z","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":"3d59096f3bd29415ea9a139d7bff9f83170fdc8514151c3ba6eabfd7d9e546d1","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-14T20:53:23Z","title_canon_sha256":"e79ebfe63e42145a850c015dc15b97c140245c16344fac9caf43e04d89bb80c3"},"schema_version":"1.0","source":{"id":"2605.15411","kind":"arxiv","version":1}},"canonical_sha256":"e502ee38b60b4b6865ea4a1e94d878d4a63f13df9b0ebb116a3d6d44f3911a67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e502ee38b60b4b6865ea4a1e94d878d4a63f13df9b0ebb116a3d6d44f3911a67","first_computed_at":"2026-05-20T00:00:57.210540Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:57.210540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XmZALDpNi1Ez/0cKA26NSyC8QYyjRwSTYZe6OGKdWNNbDWqgWynh7l6FNzszcEzIvT3iRIMDOJHnQq/9nOFKAw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:57.211409Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15411","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f99a83d10194ba20c3ea5af47ead2701dbdd91384a18acb06afa88ee2bb774d","sha256:83eba8c104a5af6a342cfe5f3912c05ed5cf7b71baa066ec56584763d812eab8"],"state_sha256":"bc424d2f6caac1a7cfc0774c9177610e8d79f4dbfdb90e3720e09e5cb1234b3e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Q636P2Momd0gYxHGmdU0TZr16IGLtxxh1uiru+aZXFtJn37U38qU5xxrH+GdWwTQ2v/R0wd5e8JM/6+EiueAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:00:33.620859Z","bundle_sha256":"1ca487a60cef6c0478f092d125ae445db7afaf3236d6eae5595d75820531d824"}}