{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PIIX4AKB2CDJV6ZZZVRI7CW4MM","short_pith_number":"pith:PIIX4AKB","schema_version":"1.0","canonical_sha256":"7a117e0141d0869afb39cd628f8adc6314aaa6619303091c48320941a727d997","source":{"kind":"arxiv","id":"2308.16212","version":2},"attestation_state":"computed","paper":{"title":"RetroBridge: Modeling Retrosynthesis with Markov Bridges","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG","q-bio.BM"],"primary_cat":"q-bio.QM","authors_text":"Arne Schneuing, Bruno Correia, Ilia Igashov, Marwin Segler, Michael Bronstein","submitted_at":"2023-08-30T15:09:22Z","abstract_excerpt":"Retrosynthesis planning is a fundamental challenge in chemistry which aims at designing reaction pathways from commercially available starting materials to a target molecule. Each step in multi-step retrosynthesis planning requires accurate prediction of possible precursor molecules given the target molecule and confidence estimates to guide heuristic search algorithms. We model single-step retrosynthesis planning as a distribution learning problem in a discrete state space. First, we introduce the Markov Bridge Model, a generative framework aimed to approximate the dependency between two intr"},"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":"2308.16212","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"q-bio.QM","submitted_at":"2023-08-30T15:09:22Z","cross_cats_sorted":["cs.LG","q-bio.BM"],"title_canon_sha256":"e2d502e096094ea53549734407f385d45e0e9d2ac3f3c088d90c7a7929ca540e","abstract_canon_sha256":"e4234f55a024d4979e1251840a37bac258f79bc9940e22d82bf0fad29b38283f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:00:35.434355Z","signature_b64":"i7+f2sjzLo34F/cf5Hhf6I8ZA9zlkCgQQvEJ5G0PomuGAuI1uYaT8jbYHqF4Rb8BhE3DLXH2TFFXZVUbTuFSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a117e0141d0869afb39cd628f8adc6314aaa6619303091c48320941a727d997","last_reissued_at":"2026-07-05T08:00:35.433776Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:00:35.433776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RetroBridge: Modeling Retrosynthesis with Markov Bridges","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG","q-bio.BM"],"primary_cat":"q-bio.QM","authors_text":"Arne Schneuing, Bruno Correia, Ilia Igashov, Marwin Segler, Michael Bronstein","submitted_at":"2023-08-30T15:09:22Z","abstract_excerpt":"Retrosynthesis planning is a fundamental challenge in chemistry which aims at designing reaction pathways from commercially available starting materials to a target molecule. Each step in multi-step retrosynthesis planning requires accurate prediction of possible precursor molecules given the target molecule and confidence estimates to guide heuristic search algorithms. We model single-step retrosynthesis planning as a distribution learning problem in a discrete state space. First, we introduce the Markov Bridge Model, a generative framework aimed to approximate the dependency between two intr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.16212","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/2308.16212/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":"2308.16212","created_at":"2026-07-05T08:00:35.433839+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.16212v2","created_at":"2026-07-05T08:00:35.433839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.16212","created_at":"2026-07-05T08:00:35.433839+00:00"},{"alias_kind":"pith_short_12","alias_value":"PIIX4AKB2CDJ","created_at":"2026-07-05T08:00:35.433839+00:00"},{"alias_kind":"pith_short_16","alias_value":"PIIX4AKB2CDJV6ZZ","created_at":"2026-07-05T08:00:35.433839+00:00"},{"alias_kind":"pith_short_8","alias_value":"PIIX4AKB","created_at":"2026-07-05T08:00:35.433839+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.24428","citing_title":"Representation-Guided Discrete Molecular Graph Retrosynthesis","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2510.12916","citing_title":"Efficient Inference for Coupled Hidden Markov Models in Continuous Time and Discrete Space","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PIIX4AKB2CDJV6ZZZVRI7CW4MM","json":"https://pith.science/pith/PIIX4AKB2CDJV6ZZZVRI7CW4MM.json","graph_json":"https://pith.science/api/pith-number/PIIX4AKB2CDJV6ZZZVRI7CW4MM/graph.json","events_json":"https://pith.science/api/pith-number/PIIX4AKB2CDJV6ZZZVRI7CW4MM/events.json","paper":"https://pith.science/paper/PIIX4AKB"},"agent_actions":{"view_html":"https://pith.science/pith/PIIX4AKB2CDJV6ZZZVRI7CW4MM","download_json":"https://pith.science/pith/PIIX4AKB2CDJV6ZZZVRI7CW4MM.json","view_paper":"https://pith.science/paper/PIIX4AKB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.16212&json=true","fetch_graph":"https://pith.science/api/pith-number/PIIX4AKB2CDJV6ZZZVRI7CW4MM/graph.json","fetch_events":"https://pith.science/api/pith-number/PIIX4AKB2CDJV6ZZZVRI7CW4MM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PIIX4AKB2CDJV6ZZZVRI7CW4MM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PIIX4AKB2CDJV6ZZZVRI7CW4MM/action/storage_attestation","attest_author":"https://pith.science/pith/PIIX4AKB2CDJV6ZZZVRI7CW4MM/action/author_attestation","sign_citation":"https://pith.science/pith/PIIX4AKB2CDJV6ZZZVRI7CW4MM/action/citation_signature","submit_replication":"https://pith.science/pith/PIIX4AKB2CDJV6ZZZVRI7CW4MM/action/replication_record"}},"created_at":"2026-07-05T08:00:35.433839+00:00","updated_at":"2026-07-05T08:00:35.433839+00:00"}