{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SA2LOMKB3AVNSL23TFSSUQJFXJ","short_pith_number":"pith:SA2LOMKB","schema_version":"1.0","canonical_sha256":"9034b73141d82ad92f5b99652a4125ba4c103442b02376807c58f84d4c6c7deb","source":{"kind":"arxiv","id":"1901.02523","version":1},"attestation_state":"computed","paper":{"title":"Construction and Analysis of Posterior Matching in Arbitrary Dimensions via Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Diego A. Mesa, Rui Ma, Siva K. Gorantla, Todd P. Coleman","submitted_at":"2019-01-08T21:23:22Z","abstract_excerpt":"The posterior matching scheme, for feedback encoding of a message point lying on the unit interval over memoryless channels, maximizes mutual information for an arbitrary number of channel uses. However, it in general does not always achieve any positive rate; so far, elaborate analyses have been required to show that it achieves any positive rate below capacity. More recent efforts have introduced a random \"dither\" shared by the encoder and decoder to the problem formulation, to simplify analyses and guarantee that the randomized scheme achieves any rate below capacity. Motivated by applicati"},"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":"1901.02523","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-08T21:23:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9ca17985b15470e8c87dee77e910025567e2c19374e3e9966f7bdf96c2bf72ee","abstract_canon_sha256":"02cd4d4b8e663a93a1c4b04eae371acf8acc33e13cebf6de632490220685a8df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:40.301112Z","signature_b64":"mRFMJdCcAVBeue2zDbRCBtRyLidfmX2JdBlthcpHMJeALhGfDBvb/9bH03mSkZ53wQuekreKnCzVmJ4LwQafAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9034b73141d82ad92f5b99652a4125ba4c103442b02376807c58f84d4c6c7deb","last_reissued_at":"2026-05-17T23:56:40.300442Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:40.300442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Construction and Analysis of Posterior Matching in Arbitrary Dimensions via Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Diego A. Mesa, Rui Ma, Siva K. Gorantla, Todd P. Coleman","submitted_at":"2019-01-08T21:23:22Z","abstract_excerpt":"The posterior matching scheme, for feedback encoding of a message point lying on the unit interval over memoryless channels, maximizes mutual information for an arbitrary number of channel uses. However, it in general does not always achieve any positive rate; so far, elaborate analyses have been required to show that it achieves any positive rate below capacity. More recent efforts have introduced a random \"dither\" shared by the encoder and decoder to the problem formulation, to simplify analyses and guarantee that the randomized scheme achieves any rate below capacity. Motivated by applicati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02523","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":"1901.02523","created_at":"2026-05-17T23:56:40.300555+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.02523v1","created_at":"2026-05-17T23:56:40.300555+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02523","created_at":"2026-05-17T23:56:40.300555+00:00"},{"alias_kind":"pith_short_12","alias_value":"SA2LOMKB3AVN","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SA2LOMKB3AVNSL23","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SA2LOMKB","created_at":"2026-05-18T12:33:27.125529+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/SA2LOMKB3AVNSL23TFSSUQJFXJ","json":"https://pith.science/pith/SA2LOMKB3AVNSL23TFSSUQJFXJ.json","graph_json":"https://pith.science/api/pith-number/SA2LOMKB3AVNSL23TFSSUQJFXJ/graph.json","events_json":"https://pith.science/api/pith-number/SA2LOMKB3AVNSL23TFSSUQJFXJ/events.json","paper":"https://pith.science/paper/SA2LOMKB"},"agent_actions":{"view_html":"https://pith.science/pith/SA2LOMKB3AVNSL23TFSSUQJFXJ","download_json":"https://pith.science/pith/SA2LOMKB3AVNSL23TFSSUQJFXJ.json","view_paper":"https://pith.science/paper/SA2LOMKB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.02523&json=true","fetch_graph":"https://pith.science/api/pith-number/SA2LOMKB3AVNSL23TFSSUQJFXJ/graph.json","fetch_events":"https://pith.science/api/pith-number/SA2LOMKB3AVNSL23TFSSUQJFXJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SA2LOMKB3AVNSL23TFSSUQJFXJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SA2LOMKB3AVNSL23TFSSUQJFXJ/action/storage_attestation","attest_author":"https://pith.science/pith/SA2LOMKB3AVNSL23TFSSUQJFXJ/action/author_attestation","sign_citation":"https://pith.science/pith/SA2LOMKB3AVNSL23TFSSUQJFXJ/action/citation_signature","submit_replication":"https://pith.science/pith/SA2LOMKB3AVNSL23TFSSUQJFXJ/action/replication_record"}},"created_at":"2026-05-17T23:56:40.300555+00:00","updated_at":"2026-05-17T23:56:40.300555+00:00"}