{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:7RBUEM3AS4DRHCCRQ35YE3FUJT","short_pith_number":"pith:7RBUEM3A","canonical_record":{"source":{"id":"2507.11419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-07-15T15:45:36Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"fde96121dd66f0695b844c518d8fde90bfd62ddcf04ae507db57d58b9b39f684","abstract_canon_sha256":"f3feac0a949bf0ceb065a24ac9a52325a84eaa418fe7ffacb6d1864cc45359bf"},"schema_version":"1.0"},"canonical_sha256":"fc43423360970713885186fb826cb44cf019cc3e6d3b23264e8727183ce69a94","source":{"kind":"arxiv","id":"2507.11419","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.11419","created_at":"2026-07-05T11:37:39Z"},{"alias_kind":"arxiv_version","alias_value":"2507.11419v1","created_at":"2026-07-05T11:37:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11419","created_at":"2026-07-05T11:37:39Z"},{"alias_kind":"pith_short_12","alias_value":"7RBUEM3AS4DR","created_at":"2026-07-05T11:37:39Z"},{"alias_kind":"pith_short_16","alias_value":"7RBUEM3AS4DRHCCR","created_at":"2026-07-05T11:37:39Z"},{"alias_kind":"pith_short_8","alias_value":"7RBUEM3A","created_at":"2026-07-05T11:37:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:7RBUEM3AS4DRHCCRQ35YE3FUJT","target":"record","payload":{"canonical_record":{"source":{"id":"2507.11419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-07-15T15:45:36Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"fde96121dd66f0695b844c518d8fde90bfd62ddcf04ae507db57d58b9b39f684","abstract_canon_sha256":"f3feac0a949bf0ceb065a24ac9a52325a84eaa418fe7ffacb6d1864cc45359bf"},"schema_version":"1.0"},"canonical_sha256":"fc43423360970713885186fb826cb44cf019cc3e6d3b23264e8727183ce69a94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:37:39.001608Z","signature_b64":"XLIVe08d8rrHGYe8oU+dGeawtyLeUtYY2lQ0wSGWYLBhr3kcXr16uoDaZGFujIrSeHdmjlW6QDHKS/TNfPlpCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc43423360970713885186fb826cb44cf019cc3e6d3b23264e8727183ce69a94","last_reissued_at":"2026-07-05T11:37:39.001060Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:37:39.001060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.11419","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-07-05T11:37:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+qOaq9LQ3kxe5OV9TrE1D49rcBCUUkckvhGNpI2cX3J00vkLAIKFQUPIdvanbqZ4MpDpUmvH5xdIQyz2ShZJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T17:56:04.181771Z"},"content_sha256":"754dd4981b5d417f5f015f632bfd0fe6ee1bc21f96f88718a67c90df3022e6b9","schema_version":"1.0","event_id":"sha256:754dd4981b5d417f5f015f632bfd0fe6ee1bc21f96f88718a67c90df3022e6b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:7RBUEM3AS4DRHCCRQ35YE3FUJT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Better Regret Rates in Bilateral Trade via Sublinear Budget Violation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.GT","authors_text":"Alberto Marchesi, Anna Lunghi, Matteo Castiglioni","submitted_at":"2025-07-15T15:45:36Z","abstract_excerpt":"Bilateral trade is a central problem in algorithmic economics, and recent work has explored how to design trading mechanisms using no-regret learning algorithms. However, no-regret learning is impossible when budget balance has to be enforced at each time step. Bernasconi et al. [Ber+24] show how this impossibility can be circumvented by relaxing the budget balance constraint to hold only globally over all time steps. In particular, they design an algorithm achieving regret of the order of $\\tilde O(T^{3/4})$ and provide a lower bound of $\\Omega(T^{5/7})$.\n  In this work, we interpolate betwee"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11419","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/2507.11419/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"},"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-07-05T11:37:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5qb6AuJG/0P3UL/dX2O5NWnOqIPyvTG3jTkWystWWKUhn8OeeBCv2jCLjtfZ+b/AY9C4dQ/sm9Z3aGXzatW4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T17:56:04.182274Z"},"content_sha256":"8eae41b87ee39c47c556ae486b75642e1b8362f3238dff291a560d089186d228","schema_version":"1.0","event_id":"sha256:8eae41b87ee39c47c556ae486b75642e1b8362f3238dff291a560d089186d228"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7RBUEM3AS4DRHCCRQ35YE3FUJT/bundle.json","state_url":"https://pith.science/pith/7RBUEM3AS4DRHCCRQ35YE3FUJT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7RBUEM3AS4DRHCCRQ35YE3FUJT/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-08-15T17:56:04Z","links":{"resolver":"https://pith.science/pith/7RBUEM3AS4DRHCCRQ35YE3FUJT","bundle":"https://pith.science/pith/7RBUEM3AS4DRHCCRQ35YE3FUJT/bundle.json","state":"https://pith.science/pith/7RBUEM3AS4DRHCCRQ35YE3FUJT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7RBUEM3AS4DRHCCRQ35YE3FUJT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7RBUEM3AS4DRHCCRQ35YE3FUJT","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":"f3feac0a949bf0ceb065a24ac9a52325a84eaa418fe7ffacb6d1864cc45359bf","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-07-15T15:45:36Z","title_canon_sha256":"fde96121dd66f0695b844c518d8fde90bfd62ddcf04ae507db57d58b9b39f684"},"schema_version":"1.0","source":{"id":"2507.11419","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.11419","created_at":"2026-07-05T11:37:39Z"},{"alias_kind":"arxiv_version","alias_value":"2507.11419v1","created_at":"2026-07-05T11:37:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11419","created_at":"2026-07-05T11:37:39Z"},{"alias_kind":"pith_short_12","alias_value":"7RBUEM3AS4DR","created_at":"2026-07-05T11:37:39Z"},{"alias_kind":"pith_short_16","alias_value":"7RBUEM3AS4DRHCCR","created_at":"2026-07-05T11:37:39Z"},{"alias_kind":"pith_short_8","alias_value":"7RBUEM3A","created_at":"2026-07-05T11:37:39Z"}],"graph_snapshots":[{"event_id":"sha256:8eae41b87ee39c47c556ae486b75642e1b8362f3238dff291a560d089186d228","target":"graph","created_at":"2026-07-05T11:37:39Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.11419/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Bilateral trade is a central problem in algorithmic economics, and recent work has explored how to design trading mechanisms using no-regret learning algorithms. However, no-regret learning is impossible when budget balance has to be enforced at each time step. Bernasconi et al. [Ber+24] show how this impossibility can be circumvented by relaxing the budget balance constraint to hold only globally over all time steps. In particular, they design an algorithm achieving regret of the order of $\\tilde O(T^{3/4})$ and provide a lower bound of $\\Omega(T^{5/7})$.\n  In this work, we interpolate betwee","authors_text":"Alberto Marchesi, Anna Lunghi, Matteo Castiglioni","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-07-15T15:45:36Z","title":"Better Regret Rates in Bilateral Trade via Sublinear Budget Violation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11419","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:754dd4981b5d417f5f015f632bfd0fe6ee1bc21f96f88718a67c90df3022e6b9","target":"record","created_at":"2026-07-05T11:37:39Z","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":"f3feac0a949bf0ceb065a24ac9a52325a84eaa418fe7ffacb6d1864cc45359bf","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-07-15T15:45:36Z","title_canon_sha256":"fde96121dd66f0695b844c518d8fde90bfd62ddcf04ae507db57d58b9b39f684"},"schema_version":"1.0","source":{"id":"2507.11419","kind":"arxiv","version":1}},"canonical_sha256":"fc43423360970713885186fb826cb44cf019cc3e6d3b23264e8727183ce69a94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc43423360970713885186fb826cb44cf019cc3e6d3b23264e8727183ce69a94","first_computed_at":"2026-07-05T11:37:39.001060Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:37:39.001060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XLIVe08d8rrHGYe8oU+dGeawtyLeUtYY2lQ0wSGWYLBhr3kcXr16uoDaZGFujIrSeHdmjlW6QDHKS/TNfPlpCw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:37:39.001608Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.11419","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:754dd4981b5d417f5f015f632bfd0fe6ee1bc21f96f88718a67c90df3022e6b9","sha256:8eae41b87ee39c47c556ae486b75642e1b8362f3238dff291a560d089186d228"],"state_sha256":"ab8c2f2c709ec695ea9d2736a812333e8c4259cd46618df631b780b6f60449a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iqVwjv+RG4MfrFeixipMphTwx/zMwXCbLYwCxnvueeDG71NJIWo1I5/nNhMXHWNBjrl2QQo5B9Y7Odu22g3fDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T17:56:04.185958Z","bundle_sha256":"fd9ae0dee0fbe2b70c4fd3236edb66fd1c4c44751ba19198293a2e82d09d96c0"}}