{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RTO6WQSEGCHMPRJMLTVBSPVGFS","short_pith_number":"pith:RTO6WQSE","schema_version":"1.0","canonical_sha256":"8cddeb4244308ec7c52c5cea193ea62cbdd31cb323ddc38b7523a85d6f422557","source":{"kind":"arxiv","id":"2505.19752","version":1},"attestation_state":"computed","paper":{"title":"Discrete Markov Bridge","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Hengli Li, Song-Chun Zhu, Ying Nian Wu, Yuxuan Wang, Zilong Zheng","submitted_at":"2025-05-26T09:32:12Z","abstract_excerpt":"Discrete diffusion has recently emerged as a promising paradigm in discrete data modeling. However, existing methods typically rely on a fixed rate transition matrix during training, which not only limits the expressiveness of latent representations, a fundamental strength of variational methods, but also constrains the overall design space. To address these limitations, we propose Discrete Markov Bridge, a novel framework specifically designed for discrete representation learning. Our approach is built upon two key components: Matrix Learning and Score Learning. We conduct a rigorous theoreti"},"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":"2505.19752","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-26T09:32:12Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"db04825b676ba8700a56400599c59460faf63b61a5d7a7d43c548fcac6489654","abstract_canon_sha256":"60476ce7ada3ec626abfbc87ffdf7bad6cdbf244112108f92403a777652d6f8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:09:35.634306Z","signature_b64":"6J74NA2Y9cnSbzw5jNmrPyEFsASXLbkEcHP42oe3lX9HkK45vKp10R6E8+vJVggH8Mv5tzPchlQFx1LWalhmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cddeb4244308ec7c52c5cea193ea62cbdd31cb323ddc38b7523a85d6f422557","last_reissued_at":"2026-07-05T11:09:35.633803Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:09:35.633803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discrete Markov Bridge","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Hengli Li, Song-Chun Zhu, Ying Nian Wu, Yuxuan Wang, Zilong Zheng","submitted_at":"2025-05-26T09:32:12Z","abstract_excerpt":"Discrete diffusion has recently emerged as a promising paradigm in discrete data modeling. However, existing methods typically rely on a fixed rate transition matrix during training, which not only limits the expressiveness of latent representations, a fundamental strength of variational methods, but also constrains the overall design space. To address these limitations, we propose Discrete Markov Bridge, a novel framework specifically designed for discrete representation learning. Our approach is built upon two key components: Matrix Learning and Score Learning. We conduct a rigorous theoreti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.19752","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/2505.19752/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":"2505.19752","created_at":"2026-07-05T11:09:35.633869+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.19752v1","created_at":"2026-07-05T11:09:35.633869+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.19752","created_at":"2026-07-05T11:09:35.633869+00:00"},{"alias_kind":"pith_short_12","alias_value":"RTO6WQSEGCHM","created_at":"2026-07-05T11:09:35.633869+00:00"},{"alias_kind":"pith_short_16","alias_value":"RTO6WQSEGCHMPRJM","created_at":"2026-07-05T11:09:35.633869+00:00"},{"alias_kind":"pith_short_8","alias_value":"RTO6WQSE","created_at":"2026-07-05T11:09:35.633869+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/RTO6WQSEGCHMPRJMLTVBSPVGFS","json":"https://pith.science/pith/RTO6WQSEGCHMPRJMLTVBSPVGFS.json","graph_json":"https://pith.science/api/pith-number/RTO6WQSEGCHMPRJMLTVBSPVGFS/graph.json","events_json":"https://pith.science/api/pith-number/RTO6WQSEGCHMPRJMLTVBSPVGFS/events.json","paper":"https://pith.science/paper/RTO6WQSE"},"agent_actions":{"view_html":"https://pith.science/pith/RTO6WQSEGCHMPRJMLTVBSPVGFS","download_json":"https://pith.science/pith/RTO6WQSEGCHMPRJMLTVBSPVGFS.json","view_paper":"https://pith.science/paper/RTO6WQSE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.19752&json=true","fetch_graph":"https://pith.science/api/pith-number/RTO6WQSEGCHMPRJMLTVBSPVGFS/graph.json","fetch_events":"https://pith.science/api/pith-number/RTO6WQSEGCHMPRJMLTVBSPVGFS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RTO6WQSEGCHMPRJMLTVBSPVGFS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RTO6WQSEGCHMPRJMLTVBSPVGFS/action/storage_attestation","attest_author":"https://pith.science/pith/RTO6WQSEGCHMPRJMLTVBSPVGFS/action/author_attestation","sign_citation":"https://pith.science/pith/RTO6WQSEGCHMPRJMLTVBSPVGFS/action/citation_signature","submit_replication":"https://pith.science/pith/RTO6WQSEGCHMPRJMLTVBSPVGFS/action/replication_record"}},"created_at":"2026-07-05T11:09:35.633869+00:00","updated_at":"2026-07-05T11:09:35.633869+00:00"}