{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:3NTUYVWMEYIV6YVK2DMWUOMPQ5","short_pith_number":"pith:3NTUYVWM","canonical_record":{"source":{"id":"2602.21620","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-02-25T06:32:23Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"bc18e92c7206b312ef4b83d0e5f44409c48d78e6f7d2c03b8d2cfb29069e1a79","abstract_canon_sha256":"7b5cca7be03561e444cce32c65615f5893aec08ff37ab112c2d45d96a309c476"},"schema_version":"1.0"},"canonical_sha256":"db674c56cc26115f62aad0d96a398f875808f5c736a648a52efe1efa986ffa3d","source":{"kind":"arxiv","id":"2602.21620","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.21620","created_at":"2026-06-01T01:02:35Z"},{"alias_kind":"arxiv_version","alias_value":"2602.21620v2","created_at":"2026-06-01T01:02:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.21620","created_at":"2026-06-01T01:02:35Z"},{"alias_kind":"pith_short_12","alias_value":"3NTUYVWMEYIV","created_at":"2026-06-01T01:02:35Z"},{"alias_kind":"pith_short_16","alias_value":"3NTUYVWMEYIV6YVK","created_at":"2026-06-01T01:02:35Z"},{"alias_kind":"pith_short_8","alias_value":"3NTUYVWM","created_at":"2026-06-01T01:02:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:3NTUYVWMEYIV6YVK2DMWUOMPQ5","target":"record","payload":{"canonical_record":{"source":{"id":"2602.21620","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-02-25T06:32:23Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"bc18e92c7206b312ef4b83d0e5f44409c48d78e6f7d2c03b8d2cfb29069e1a79","abstract_canon_sha256":"7b5cca7be03561e444cce32c65615f5893aec08ff37ab112c2d45d96a309c476"},"schema_version":"1.0"},"canonical_sha256":"db674c56cc26115f62aad0d96a398f875808f5c736a648a52efe1efa986ffa3d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T01:02:35.643781Z","signature_b64":"cC9gmvkq3AEvEUXYNcAwXl9L1sj4S+XDA4NO6aJL4cbzoDLVmEMH5OatJQV/IBdrA6c0XUobNB1RlLfXzTXoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db674c56cc26115f62aad0d96a398f875808f5c736a648a52efe1efa986ffa3d","last_reissued_at":"2026-06-01T01:02:35.642790Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T01:02:35.642790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2602.21620","source_version":2,"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-06-01T01:02:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ALGG9nJ9RuJsd+D3o2vNjQzWyiV6xAMsc/zs67d4qrkz2S0hLS7+cDT8aos8DO4x+yw92Ba9BwHc2lO4FSpHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T11:10:42.203353Z"},"content_sha256":"1fb11ed6f6bac101f5c9d2d4b96ef1fe6627e941fc48b076b973b41aa298cf31","schema_version":"1.0","event_id":"sha256:1fb11ed6f6bac101f5c9d2d4b96ef1fe6627e941fc48b076b973b41aa298cf31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:3NTUYVWMEYIV6YVK2DMWUOMPQ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Revisiting the Bertrand Paradox via Equilibrium Analysis of No-regret Learners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.GT","authors_text":"Arnab Maiti, Junyan Liu, Kevin Jamieson, Lillian J. Ratliff","submitted_at":"2026-02-25T06:32:23Z","abstract_excerpt":"We study the discrete Bertrand pricing game with a non-increasing demand function. The game has $n \\ge 2$ players who simultaneously choose prices from the set $\\{1/k, 2/k, \\ldots, 1\\}$, where $k\\in\\mathbb{N}$. The player who sets the lowest price captures the entire demand; if multiple players tie for the lowest price, they split the demand equally.\n  We study the Bertrand paradox, where classical theory predicts low prices, yet real markets often sustain high prices. To understand this gap, we analyze a repeated-game model in which firms set prices using no-regret learners. Our goal is to ch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.21620","kind":"arxiv","version":2},"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/2602.21620/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-06-01T01:02:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OJ8KgQFwT+V9RJ0ooYfYY92m54nqA2Fwyl2ve06fjEsaePwejbDYEpZIRRtLgwV9hzSqJatBAOMTzbSatvnNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T11:10:42.203753Z"},"content_sha256":"6eeeed2bb4c07ef64fffb5722a351eea6a6984c83ae74a2620c87d3831217a38","schema_version":"1.0","event_id":"sha256:6eeeed2bb4c07ef64fffb5722a351eea6a6984c83ae74a2620c87d3831217a38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3NTUYVWMEYIV6YVK2DMWUOMPQ5/bundle.json","state_url":"https://pith.science/pith/3NTUYVWMEYIV6YVK2DMWUOMPQ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3NTUYVWMEYIV6YVK2DMWUOMPQ5/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-04T11:10:42Z","links":{"resolver":"https://pith.science/pith/3NTUYVWMEYIV6YVK2DMWUOMPQ5","bundle":"https://pith.science/pith/3NTUYVWMEYIV6YVK2DMWUOMPQ5/bundle.json","state":"https://pith.science/pith/3NTUYVWMEYIV6YVK2DMWUOMPQ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3NTUYVWMEYIV6YVK2DMWUOMPQ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:3NTUYVWMEYIV6YVK2DMWUOMPQ5","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":"7b5cca7be03561e444cce32c65615f5893aec08ff37ab112c2d45d96a309c476","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-02-25T06:32:23Z","title_canon_sha256":"bc18e92c7206b312ef4b83d0e5f44409c48d78e6f7d2c03b8d2cfb29069e1a79"},"schema_version":"1.0","source":{"id":"2602.21620","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.21620","created_at":"2026-06-01T01:02:35Z"},{"alias_kind":"arxiv_version","alias_value":"2602.21620v2","created_at":"2026-06-01T01:02:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.21620","created_at":"2026-06-01T01:02:35Z"},{"alias_kind":"pith_short_12","alias_value":"3NTUYVWMEYIV","created_at":"2026-06-01T01:02:35Z"},{"alias_kind":"pith_short_16","alias_value":"3NTUYVWMEYIV6YVK","created_at":"2026-06-01T01:02:35Z"},{"alias_kind":"pith_short_8","alias_value":"3NTUYVWM","created_at":"2026-06-01T01:02:35Z"}],"graph_snapshots":[{"event_id":"sha256:6eeeed2bb4c07ef64fffb5722a351eea6a6984c83ae74a2620c87d3831217a38","target":"graph","created_at":"2026-06-01T01:02:35Z","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/2602.21620/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the discrete Bertrand pricing game with a non-increasing demand function. The game has $n \\ge 2$ players who simultaneously choose prices from the set $\\{1/k, 2/k, \\ldots, 1\\}$, where $k\\in\\mathbb{N}$. The player who sets the lowest price captures the entire demand; if multiple players tie for the lowest price, they split the demand equally.\n  We study the Bertrand paradox, where classical theory predicts low prices, yet real markets often sustain high prices. To understand this gap, we analyze a repeated-game model in which firms set prices using no-regret learners. Our goal is to ch","authors_text":"Arnab Maiti, Junyan Liu, Kevin Jamieson, Lillian J. Ratliff","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-02-25T06:32:23Z","title":"Revisiting the Bertrand Paradox via Equilibrium Analysis of No-regret Learners"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.21620","kind":"arxiv","version":2},"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:1fb11ed6f6bac101f5c9d2d4b96ef1fe6627e941fc48b076b973b41aa298cf31","target":"record","created_at":"2026-06-01T01:02:35Z","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":"7b5cca7be03561e444cce32c65615f5893aec08ff37ab112c2d45d96a309c476","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-02-25T06:32:23Z","title_canon_sha256":"bc18e92c7206b312ef4b83d0e5f44409c48d78e6f7d2c03b8d2cfb29069e1a79"},"schema_version":"1.0","source":{"id":"2602.21620","kind":"arxiv","version":2}},"canonical_sha256":"db674c56cc26115f62aad0d96a398f875808f5c736a648a52efe1efa986ffa3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db674c56cc26115f62aad0d96a398f875808f5c736a648a52efe1efa986ffa3d","first_computed_at":"2026-06-01T01:02:35.642790Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-01T01:02:35.642790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cC9gmvkq3AEvEUXYNcAwXl9L1sj4S+XDA4NO6aJL4cbzoDLVmEMH5OatJQV/IBdrA6c0XUobNB1RlLfXzTXoAg==","signature_status":"signed_v1","signed_at":"2026-06-01T01:02:35.643781Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.21620","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1fb11ed6f6bac101f5c9d2d4b96ef1fe6627e941fc48b076b973b41aa298cf31","sha256:6eeeed2bb4c07ef64fffb5722a351eea6a6984c83ae74a2620c87d3831217a38"],"state_sha256":"ebe71702dd431524ac934582d4bf3cad9900071534d0cdc5f042e888c6eb5c3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vdxtpG0zQWZl/6rXZONjm6WMDctjP87GZHQWqfR1g77QTYvTC9LMklkCtru8aMDUYqgo4oayKRMbdOtIxUnkAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T11:10:42.205851Z","bundle_sha256":"bd171fe1ef0e4a78eb05cdb201a98ab5909edb13aa480f6eddf597773a8a409d"}}