{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:7B24OBOMDMC4SVJ2QJKG7SK3AT","short_pith_number":"pith:7B24OBOM","schema_version":"1.0","canonical_sha256":"f875c705cc1b05c9553a82546fc95b04d687d2733ddca682e8d0f3fe7a31e894","source":{"kind":"arxiv","id":"2310.19796","version":3},"attestation_state":"computed","paper":{"title":"Re-evaluating Retrosynthesis Algorithms with Syntheseus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","q-bio.QM"],"primary_cat":"cs.LG","authors_text":"Austin Tripp, Guoqing Liu, Krzysztof Maziarz, Marwin Segler, Megan Stanley, Philipp Seidl, Piotr Gai\\'nski, Shufang Xie","submitted_at":"2023-10-30T17:59:04Z","abstract_excerpt":"Automated Synthesis Planning has recently re-emerged as a research area at the intersection of chemistry and machine learning. Despite the appearance of steady progress, we argue that imperfect benchmarks and inconsistent comparisons mask systematic shortcomings of existing techniques, and unnecessarily hamper progress. To remedy this, we present a synthesis planning library with an extensive benchmarking framework, called syntheseus, which promotes best practice by default, enabling consistent meaningful evaluation of single-step models and multi-step planning algorithms. We demonstrate the c"},"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":"2310.19796","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-30T17:59:04Z","cross_cats_sorted":["cs.AI","q-bio.QM"],"title_canon_sha256":"e5e7cab91ca8cdf58f7a82ef9cc28d792de9af91c97c488845037f2e1beb45fb","abstract_canon_sha256":"5a041bb34c51e36c77fd417f8cfb1c3b057cd39469edcb5847b304d44c9dd9c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:03:48.448232Z","signature_b64":"A06TUP9rRgy7UDRGbbBtoCYHkwoPns2a0voP4b3SBss72Ro+xQQfQA+u5kRTvahe6m+YSd+SLmnK9oY8rxtbDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f875c705cc1b05c9553a82546fc95b04d687d2733ddca682e8d0f3fe7a31e894","last_reissued_at":"2026-07-05T09:03:48.447731Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:03:48.447731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Re-evaluating Retrosynthesis Algorithms with Syntheseus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","q-bio.QM"],"primary_cat":"cs.LG","authors_text":"Austin Tripp, Guoqing Liu, Krzysztof Maziarz, Marwin Segler, Megan Stanley, Philipp Seidl, Piotr Gai\\'nski, Shufang Xie","submitted_at":"2023-10-30T17:59:04Z","abstract_excerpt":"Automated Synthesis Planning has recently re-emerged as a research area at the intersection of chemistry and machine learning. Despite the appearance of steady progress, we argue that imperfect benchmarks and inconsistent comparisons mask systematic shortcomings of existing techniques, and unnecessarily hamper progress. To remedy this, we present a synthesis planning library with an extensive benchmarking framework, called syntheseus, which promotes best practice by default, enabling consistent meaningful evaluation of single-step models and multi-step planning algorithms. We demonstrate the c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.19796","kind":"arxiv","version":3},"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/2310.19796/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":"2310.19796","created_at":"2026-07-05T09:03:48.447787+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.19796v3","created_at":"2026-07-05T09:03:48.447787+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.19796","created_at":"2026-07-05T09:03:48.447787+00:00"},{"alias_kind":"pith_short_12","alias_value":"7B24OBOMDMC4","created_at":"2026-07-05T09:03:48.447787+00:00"},{"alias_kind":"pith_short_16","alias_value":"7B24OBOMDMC4SVJ2","created_at":"2026-07-05T09:03:48.447787+00:00"},{"alias_kind":"pith_short_8","alias_value":"7B24OBOM","created_at":"2026-07-05T09:03:48.447787+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.01061","citing_title":"Agentic generation of verifiable rules for deterministic, self-expanding reaction classification","ref_index":42,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7B24OBOMDMC4SVJ2QJKG7SK3AT","json":"https://pith.science/pith/7B24OBOMDMC4SVJ2QJKG7SK3AT.json","graph_json":"https://pith.science/api/pith-number/7B24OBOMDMC4SVJ2QJKG7SK3AT/graph.json","events_json":"https://pith.science/api/pith-number/7B24OBOMDMC4SVJ2QJKG7SK3AT/events.json","paper":"https://pith.science/paper/7B24OBOM"},"agent_actions":{"view_html":"https://pith.science/pith/7B24OBOMDMC4SVJ2QJKG7SK3AT","download_json":"https://pith.science/pith/7B24OBOMDMC4SVJ2QJKG7SK3AT.json","view_paper":"https://pith.science/paper/7B24OBOM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.19796&json=true","fetch_graph":"https://pith.science/api/pith-number/7B24OBOMDMC4SVJ2QJKG7SK3AT/graph.json","fetch_events":"https://pith.science/api/pith-number/7B24OBOMDMC4SVJ2QJKG7SK3AT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7B24OBOMDMC4SVJ2QJKG7SK3AT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7B24OBOMDMC4SVJ2QJKG7SK3AT/action/storage_attestation","attest_author":"https://pith.science/pith/7B24OBOMDMC4SVJ2QJKG7SK3AT/action/author_attestation","sign_citation":"https://pith.science/pith/7B24OBOMDMC4SVJ2QJKG7SK3AT/action/citation_signature","submit_replication":"https://pith.science/pith/7B24OBOMDMC4SVJ2QJKG7SK3AT/action/replication_record"}},"created_at":"2026-07-05T09:03:48.447787+00:00","updated_at":"2026-07-05T09:03:48.447787+00:00"}