{"as_of":"2026-08-07T18:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:184a42f24a7467ae777bca522aff6a47439905ca688ca35f00f50e8214c88c7a","coverage":[{"denominator":50,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":50,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:58:52.471129Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T16:07:37.554602Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-25T02:46:33.473498Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.00925","snapshot_observed_at":"2026-08-03T16:07:37.554602Z","title":"Protinvtree: Deliberate protein inverse folding with reward-guided tree search.arXiv preprint arXiv:2506.00925,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.15133","last_updated":"2026-06-11T09:01:01Z","snapshot_observed_at":"2026-08-04T17:45:40.551452Z","submitted_at":"2025-12-17T06:46:27Z","title":"HD-Prot: A Protein Language Model for Joint Sequence-Structure Modeling with Continuous Structure Tokens","version":3},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-03T16:07:37.554602Z"},"links":{"cited_paper":"/paper/2506.00925","citing_paper":"/paper/2512.15133"},"observation_digest":"sha256:f694e7c2125941e11ab58a170c7d6bd0382d77eb06d73a6ea453a64381539938","observation_id":"bccdb030-20b2-4656-b075-5c37228827c1","resolution":{"observed_at":"2026-08-03T16:07:37.554602Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"cited_work":{"arxiv_id":"2506.00925","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.00925","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Protinvtree: Deliberate protein inverse folding with reward-guided tree search.arXiv preprint arXiv:2506.00925","venue":null,"work_id":"6c0ff1a5-fbec-43e4-a68c-7321809b9193","year":2025},"citing_paper":{"arxiv_id":"2605.05829","last_updated":"2026-05-07T08:04:16Z","snapshot_observed_at":"2026-07-06T23:18:22.301347Z","submitted_at":"2026-05-07T08:04:16Z","title":"MP2D: Constrained Monte Carlo Tree-Guided Diffusion for Multi-Objective Protein Sequence Design","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-08T03:12:06.824737Z"},"links":{"cited_paper":"/paper/2506.00925","citing_paper":"/paper/2605.05829"},"observation_digest":"sha256:08ba20e5f8e7df33ab89dc9e9b7cbc91da87da6d642b269269e95f10d95d833e","observation_id":"87612d70-13f4-49cf-a831-d1b84c1ae824","resolution":{"observed_at":"2026-05-11T22:16:13.352416Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"cited_work":{"arxiv_id":"2506.00925","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.00925","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Protinvtree: Deliberate protein inverse folding with reward-guided tree search.arXiv preprint arXiv:2506.00925","venue":null,"work_id":"6c0ff1a5-fbec-43e4-a68c-7321809b9193","year":2025},"citing_paper":{"arxiv_id":"2605.23407","last_updated":"2026-05-22T09:17:11Z","snapshot_observed_at":"2026-07-31T22:28:17.481344Z","submitted_at":"2026-05-22T09:17:11Z","title":"GeoCycler: Reward-Aligned 3D Diffusion for Constraint-Conditioned Cyclic Peptide Design","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-05-25T02:46:03.894997Z"},"links":{"cited_paper":"/paper/2506.00925","citing_paper":"/paper/2605.23407"},"observation_digest":"sha256:545623874bbf5e7e0bac3c9e4665143f9890b2bde551e9c98c0317b374b39f0b","observation_id":"3f4fd830-8ffc-4034-9503-55d014eea803","resolution":{"observed_at":"2026-05-25T02:46:33.478794Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.00925/citation-record","integrity":"/paper/2506.00925/integrity","json":"/paper/2506.00925/citation-record.json","paper":"/paper/2506.00925"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:46.571281Z","title":"Accurate structure prediction of biomolecular interactions with alphafold 3.Nature, pages 1–3, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:46.571281Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:11455441318dc6714f98bf5f312ed0eb0ddb7a096453af3510f25155e3f52ce3","observation_id":"1302ae26-3727-48f2-aad1-5dd474ff0034","resolution":{"observed_at":"2026-08-07T11:58:46.571281Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:46.670877Z","title":"Accurate prediction of protein structures and interactions using a three-track neural network.Science, 373(6557):871–876, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:46.670877Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:4d485b30a3a295de04602679c5dd50f5f95483b5f09b4cde4d88df1c515e5b22","observation_id":"a37fd9b8-2708-4ab2-a3ba-12b7f6052259","resolution":{"observed_at":"2026-08-07T11:58:46.670877Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21787","last_updated":"2024-12-30T19:03:24Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:57:25Z","title":"Large Language Monkeys: Scaling Inference Compute with Repeated Sampling","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21787","snapshot_observed_at":"2026-08-07T11:58:46.790059Z","title":"Large language monkeys: Scaling inference compute with repeated sampling.arXiv preprint arXiv:2407.21787, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:46.790059Z"},"links":{"cited_paper":"/paper/2407.21787","citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:3740a1c68238047e6056a2156dbcec809ed3086bb604a51b3b86a9ac2fe5fa76","observation_id":"417c4fb2-705e-4363-a4b4-7f3569c8f6da","resolution":{"observed_at":"2026-08-07T11:58:46.790059Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:58.687569Z","title":"Protein design: a hierarchic approach.Science, 270(5238):935– 941, 1995","venue":null,"work_id":"d43afb29-e722-4d7f-8ef6-28b33b849828","year":1995},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:46.908127Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:de346de32e0f0cb3d3783ae00d8d5f438e3f51c303d675907475e4ba5be91948","observation_id":"c3d97612-6c91-4c15-9973-0149fd086001","resolution":{"observed_at":"2026-08-07T11:58:58.822372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:58.440929Z","title":"How root-mean-square distance (rmsd) values depend on the resolution of protein structures that are compared.Applied Crystallography, 36(1):125–128, 2003","venue":null,"work_id":"8fef4c16-1de1-4d7c-99fc-d9c7abb447b0","year":2003},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:47.006738Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:1c224b59d2ad46dba8e31fa62a440857ea3ba4e65716f59f6986d8a9a14fb6e8","observation_id":"7514acf6-9110-4fcb-9d7c-dd79ff7f85dc","resolution":{"observed_at":"2026-08-07T11:58:58.536419Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:58.221706Z","title":"Sparks of function by de novo protein design","venue":null,"work_id":"e04ad2f3-4f0e-4b8b-baa0-a66589f3f557","year":2024},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:47.133098Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:e28c925fb4dcad9dc1e2ed451cf157b842f956ed55c53fcf3fae1a3210dd80cb","observation_id":"1b05fd21-2627-4ba8-b97b-20e7fc09effc","resolution":{"observed_at":"2026-08-07T11:58:58.306298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:47.257139Z","title":"Efficient selectivity and backup operators in monte-carlo tree search","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:47.257139Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:d384433ffab937036d9e3bed5410cf292a626095787524664bf6c661fbf7e195","observation_id":"414e764d-3fb7-4d28-a1cd-99f45453eb76","resolution":{"observed_at":"2026-08-07T11:58:47.257139Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:47.380243Z","title":"Robust deep learning–based protein sequence design using proteinmpnn.Science, 378(6615):49–56, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:47.380243Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:7c7d41b1a907d3d17c96d90cd84cbbfdd1b3c872416b18774c96956a783770c6","observation_id":"7f5bab0f-311b-47e5-a84c-e6d8b24d6464","resolution":{"observed_at":"2026-08-07T11:58:47.380243Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:47.513458Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:47.513458Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:38fdc6693df2b6292b7c90b1feb76495ec1d5591550a9b7c9db3457541d26157","observation_id":"bbb73966-c1c0-49ab-be82-8a72015e34b0","resolution":{"observed_at":"2026-08-07T11:58:47.513458Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.01079","last_updated":"2022-02-12T00:55:09Z","snapshot_observed_at":"2026-08-07T17:17:43.723626Z","submitted_at":"2022-02-01T08:28:24Z","title":"AlphaDesign: A graph protein design method and benchmark on AlphaFoldDB","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.01079","snapshot_observed_at":"2026-08-07T11:58:47.622747Z","title":"Alphadesign: A graph protein design method and benchmark on alphafolddb.arXiv preprint arXiv:2202.01079, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:47.622747Z"},"links":{"cited_paper":"/paper/2202.01079","citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:e88efcc92a13e0fcff4c0bef7533b813c982d89de7d60b64ca2be1af22a7bd94","observation_id":"01f0ae8f-a50f-4743-94c9-baab7721c7cd","resolution":{"observed_at":"2026-08-07T11:58:47.622747Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:57.994211Z","title":null,"venue":null,"work_id":"c84386c9-790b-41a0-bb55-e5b818b2e197","year":2023},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:47.748147Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:4dafc3e9a50671af6138cdbe2b0bde23a4cf9729ddab226caf14c9e02ec064f9","observation_id":"bb22ab4b-2b4d-479e-915d-63651ce2e707","resolution":{"observed_at":"2026-08-07T11:58:58.085436Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:57.730593Z","title":null,"venue":null,"work_id":"97e85a1d-8667-499f-8415-f3142d302e86","year":2023},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:47.858606Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:c8bdd717384f8b6aedeb47e5d532b76deea9d23830822f8cd6821f901f7d1efe","observation_id":"d5f9281c-6a6c-40d4-b4ea-c6b21fd4caa6","resolution":{"observed_at":"2026-08-07T11:58:57.846851Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:57.476723Z","title":"Uniif: Unified molecule inverse folding.Advances in Neural Information Processing Systems, 37:135843–135860, 2024","venue":null,"work_id":"c3d997f9-bc31-4280-8c73-0bdbf3585ac4","year":2024},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:47.985285Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:65cb3a500a30f0b26ac79aa4472b461edee3dbeb6d35889f14b483191b2a4a7d","observation_id":"5f69b335-9113-43b2-98b3-378cd2243ceb","resolution":{"observed_at":"2026-08-07T11:58:57.585725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:57.241398Z","title":"Protein remote homology detection and structural alignment using deep learning","venue":null,"work_id":"5134a11a-50a0-4732-b9e1-c0cd905301d9","year":2023},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:48.107534Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:d9952c99175b04ea60be0f78d56c3c66d55cc29a79cee0535bed36d26c27b949","observation_id":"20c0a082-414f-465c-8a03-d550b4f6f8c2","resolution":{"observed_at":"2026-08-07T11:58:57.350183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.14992","last_updated":"2023-10-23T07:24:28Z","snapshot_observed_at":"2026-07-06T15:32:25.931739Z","submitted_at":"2023-05-24T10:28:28Z","title":"Reasoning with Language Model is Planning with World Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.14992","snapshot_observed_at":"2026-08-07T11:58:48.207669Z","title":"Reasoning with language model is planning with world model.arXiv preprint arXiv:2305.14992, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:48.207669Z"},"links":{"cited_paper":"/paper/2305.14992","citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:81399d275b8f7bd63edff07053c82cd58c7bebd3497ab2870d3c382a233bd776","observation_id":"bd3b602a-ecb2-45be-9a07-04de584ce4aa","resolution":{"observed_at":"2026-08-07T11:58:48.207669Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:56.989492Z","title":"Simulating 500 million years of evolution with a language model.Science, page eads0018, 2025","venue":null,"work_id":"47fdb1f4-39fa-42cb-9151-ad283ed422b3","year":2025},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:48.319215Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:1ca4ccb2bbca56fc75d4d88719623721baefe76e0f83716c0bd8912e51084304","observation_id":"dd8443b6-644f-4bb7-9476-ae1c929fe7de","resolution":{"observed_at":"2026-08-07T11:58:57.118774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:48.434164Z","title":"Learning inverse folding from millions of predicted structures","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:48.434164Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:4474944bc1ff0917c0f55d3ae7dee533fb46a734f30dfae2f17ce184fccd159e","observation_id":"b040802e-acca-44dd-8efe-039b5c16b3b8","resolution":{"observed_at":"2026-08-07T11:58:48.434164Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:56.763701Z","title":"The coming of age of de novo protein design","venue":null,"work_id":"c01fc435-8f7c-4861-9149-348fb9c6a6f5","year":2016},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:48.553252Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:3a08bd63f0954cb3f4a1998a16bc543eb09f7fe4ad8c00cd92ba50cb3e3a1580","observation_id":"32e0a02c-28de-4887-9207-5623bcd2f6bc","resolution":{"observed_at":"2026-08-07T11:58:56.875746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:48.665289Z","title":"Generative models for graph-based protein design.Advances in neural information processing systems, 32, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:48.665289Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:e5b07dc79d82bf934e6081a503fb5f871f9ab1e64e7b37f223a32c3ea00c637e","observation_id":"99d20e5e-cb6a-46c7-b63a-28a8cfd23ac1","resolution":{"observed_at":"2026-08-07T11:58:48.665289Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:56.531153Z","title":"Learning from protein structure with geometric vector perceptrons","venue":null,"work_id":"57dbecc6-ab1d-46e5-9f85-ff1b74d38f7d","year":null},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:48.809726Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:6ba4174075da35689d99f19d6f2f8c86cb2a94152b8e9ce56dad245704a40c41","observation_id":"c0c85c74-f74d-4008-ab15-ab8ccd039052","resolution":{"observed_at":"2026-08-07T11:58:56.633714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:56.246772Z","title":"Learning from protein structure with geometric vector perceptrons","venue":null,"work_id":"be515dde-282e-4f99-b224-1f6d7081f092","year":2021},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:48.948466Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:a2efe3bf9a631de6d2a3791522cffd4f429a473e5440696e351622c7bc7a6be0","observation_id":"a05e6b2c-e6dd-4678-8317-159f2d7e0d48","resolution":{"observed_at":"2026-08-07T11:58:56.382993Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:55.975636Z","title":"Representativeness revisited: Attribute substitution in intuitive judgment.Heuristics and biases: The psychology of intuitive judgment, 49(49-81):74, 2002","venue":null,"work_id":"e59b1dcc-746d-4266-91ea-a32f20ac971a","year":2002},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:49.054577Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:d0a7596bcd7999731a0a1ae4bd648ec6280ce9753ede9af671afc9e01e8aa3f3","observation_id":"6a7e8a8f-3475-4436-accb-42db00e085bd","resolution":{"observed_at":"2026-08-07T11:58:56.107867Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16265","last_updated":"2024-06-26T14:01:15Z","snapshot_observed_at":"2026-08-01T16:15:24.164308Z","submitted_at":"2024-05-25T15:07:33Z","title":"MindStar: Enhancing Math Reasoning in Pre-trained LLMs at Inference Time","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16265","snapshot_observed_at":"2026-08-07T11:58:49.175539Z","title":"Mindstar: Enhancing math reasoning in pre-trained llms at inference time.arXiv preprint arXiv:2405.16265, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:49.175539Z"},"links":{"cited_paper":"/paper/2405.16265","citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:50ca3fd12a6bf19d88a6ce89d642b18f5d42d467f0be03891dce5c5b272de243","observation_id":"1a48eb8a-51ab-481c-8ba2-ac3329d5edcd","resolution":{"observed_at":"2026-08-07T11:58:49.175539Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:55.687569Z","title":"A new age in protein design empowered by deep learning.Cell Systems, 14(11):925–939, 2023","venue":null,"work_id":"e7dab2e5-058f-4031-86a4-a125e5098d3d","year":2023},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:49.302591Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:cd107d72e9ad4e3cfe91041f04ce79a4c3b7d9700ee4f3c9cb4cd0baaedec66e","observation_id":"c9287193-e0f8-4ad0-b65d-3905e0932b44","resolution":{"observed_at":"2026-08-07T11:58:55.850220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:55.498614Z","title":"Bandit based monte-carlo planning","venue":null,"work_id":"392dadb0-0623-49c2-8c69-7ef40ec5e0f5","year":2006},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:49.425484Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:b0342cd449d166a580b366a85407fd6c30203aac18578517148afe03fa18c4ab","observation_id":"b4b2eb6f-e6d7-4a81-9bab-bde07c135257","resolution":{"observed_at":"2026-08-07T11:58:55.579818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:49.580827Z","title":"Language models of protein sequences at the scale of evolution enable accurate structure prediction.BioRxiv, 2022:500902, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:49.580827Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:789ab8dade61813dbdd6257b90a569a7a50bf3e4f0888bc38ddf67f90a971d02","observation_id":"65d49feb-333f-4fbf-9b3e-f52ec15a0b01","resolution":{"observed_at":"2026-08-07T11:58:49.580827Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:49.690864Z","title":"De novo protein design using geometric vector field networks","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:49.690864Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:f6f940f4846de45c91604560296b7689fa579fa21dab95d4b11c915ca7399bf5","observation_id":"9316f80d-6475-4177-9357-b1543a7f80b2","resolution":{"observed_at":"2026-08-07T11:58:49.690864Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:55.267672Z","title":"Increasing sequence diversity with flexible backbone protein design: the complete redesign of a protein hydrophobic core.Structure, 20(6):1086–1096, 2012","venue":null,"work_id":"e7571420-f667-413e-8e0f-e748e9d77d64","year":2012},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:49.864501Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:d2d2ee0761f694234851bdc6f045d9816c44709a9f8ad06894f8d87d001a4f88","observation_id":"498af2ba-9aba-45fe-a17a-5d6337e010e3","resolution":{"observed_at":"2026-08-07T11:58:55.340048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:49.985237Z","title":"Cath–a hierarchic classification of protein domain structures.Structure, 5(8):1093–1109, 1997","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:49.985237Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:d161350f0cd07cf3a6957361cf7dc7b4f8d4fc3bf320e6e8ed188cc45f01f52a","observation_id":"9e475445-64ec-4efc-ac7f-75b6c0e3730b","resolution":{"observed_at":"2026-08-07T11:58:49.985237Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06195","last_updated":"2024-08-12T14:42:13Z","snapshot_observed_at":"2026-07-31T21:52:59.633187Z","submitted_at":"2024-08-12T14:42:13Z","title":"Mutual Reasoning Makes Smaller LLMs Stronger Problem-Solvers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.06195","snapshot_observed_at":"2026-08-07T11:58:50.105199Z","title":"Mutual reasoning makes smaller llms stronger problem-solvers.arXiv preprint arXiv:2408.06195, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:50.105199Z"},"links":{"cited_paper":"/paper/2408.06195","citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:d9ab0b22919f2ea2f9129512891d324bd2df962a4a4c89cf3d079d6393af6b45","observation_id":"401ebe53-9236-41fc-aa5b-9ba4c81c56e5","resolution":{"observed_at":"2026-08-07T11:58:50.105199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:55.023412Z","title":"Fast uncovering of protein sequence diversity from structure","venue":null,"work_id":"7beff9d4-adc9-404e-a396-8679f2a31cf8","year":2025},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:50.225030Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:f9c6f5766fe163e62b19b0f598134c7ddfd747015139bdf99a115a69d4652e5b","observation_id":"a9efcf04-b352-4baf-ba11-79db557b3964","resolution":{"observed_at":"2026-08-07T11:58:55.110643Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:54.743122Z","title":"Mas- tering the game of go with deep neural networks and tree search.nature, 529(7587):484–489, 2016","venue":null,"work_id":"32262cf2-754b-4b13-b0e7-0806112656fb","year":2016},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:50.355034Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:9e06333001f89910330dd7c658472b8754230d23fe4d0a713e2dc6d89f8c7561","observation_id":"748f6f3a-e81d-49ee-9384-e59ccee20e61","resolution":{"observed_at":"2026-08-07T11:58:54.867211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:54.533083Z","title":"The empirical case for two systems of reasoning.Psychological bulletin, 119(1):3, 1996","venue":null,"work_id":"cb95222a-30e6-423c-857d-1eeab619b52a","year":1996},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:50.460988Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:73b34507450696ca99327ff6ec6e9f3af3557d4b8b3f2b3164c4c53fcb1deb71","observation_id":"bea9356c-acc1-4353-87d3-d9614b53b0fa","resolution":{"observed_at":"2026-08-07T11:58:54.621083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.03314","last_updated":"2024-08-06T17:35:05Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-08-06T17:35:05Z","title":"Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.03314","snapshot_observed_at":"2026-08-07T11:58:50.550308Z","title":"Scaling llm test-time compute opti- mally can be more effective than scaling model parameters.arXiv preprint arXiv:2408.03314, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:50.550308Z"},"links":{"cited_paper":"/paper/2408.03314","citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:a0f11d759e7224ab672500386c3edcc7591e498ddf105d2cdd085fd4ab9dabb8","observation_id":"f8992498-a91f-4405-a47e-3fe70058b5ba","resolution":{"observed_at":"2026-08-07T11:58:50.550308Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:54.350522Z","title":"Psychology Press, 1999","venue":null,"work_id":"ae24285f-dba8-4bb1-877c-99756816d8e4","year":1999},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:50.643014Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:fc78361e0e1078850eb1aa5f5cb865189131e4930e32ace0bf5010346c8fe88d","observation_id":"7726afda-4d45-4668-bd80-49178a49cad6","resolution":{"observed_at":"2026-08-07T11:58:54.456254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2204.10673","last_updated":"2023-02-21T02:57:41Z","snapshot_observed_at":"2026-07-06T13:02:49.034260Z","submitted_at":"2022-04-21T02:55:01Z","title":"Generative De Novo Protein Design with Global Context","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.10673","snapshot_observed_at":"2026-08-07T11:58:50.749902Z","title":"Generative de novo protein design with global context.arXiv preprint arXiv:2204.10673, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:50.749902Z"},"links":{"cited_paper":"/paper/2204.10673","citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:cfea19beaf18d76ca631ef2c3ec356a6c10fcc3633c078d56c61045ba1b6f723","observation_id":"f3bf857b-98fe-4913-8741-1592b15742e4","resolution":{"observed_at":"2026-08-07T11:58:50.749902Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:50.896709Z","title":"Global-context aware generative protein design","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:50.896709Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:92611059c3d2649f9d7c25d3824e62accac15618666ab49ac5fa89d1ca6e33c1","observation_id":"8432a0c0-1246-4082-bc1a-da27c0960471","resolution":{"observed_at":"2026-08-07T11:58:50.896709Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:54.041939Z","title":"Q*: Improving multi-step reasoning for llms with deliberative planning, 2024","venue":null,"work_id":"5ad9ae46-27dd-497e-ad4e-8a0f850487dc","year":2024},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:51.041986Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:d48e733153219e9f35d932e834e8b4884627daf35d6dda1f93dcf25b23d98814","observation_id":"8a8e96c9-160b-44ce-9825-efd9635dc47b","resolution":{"observed_at":"2026-08-07T11:58:54.196276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:51.154911Z","title":"Chi, Sharan Narang, Aakanksha Chowdhery, and Denny Zhou","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:51.154911Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:ba73f013dc236fd0cb5c40fe99c9786dd43f3d21a60886e98d863599bbcad327","observation_id":"a4bfbd24-fea7-43cc-b451-e26ab6f9906e","resolution":{"observed_at":"2026-08-07T11:58:51.154911Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:51.277296Z","title":"High-resolution de novo structure prediction from primary sequence.BioRxiv, pages 2022–07, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:51.277296Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:291d3b0bd0861af11620a167b02d17dc65dda9472d52b93806672a07c3ede253","observation_id":"255c046e-bcb2-42ac-87cd-9e543717e34c","resolution":{"observed_at":"2026-08-07T11:58:51.277296Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.00724","last_updated":"2025-03-03T07:53:32Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-08-01T17:16:04Z","title":"Inference Scaling Laws: An Empirical Analysis of Compute-Optimal Inference for Problem-Solving with Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.00724","snapshot_observed_at":"2026-08-07T11:58:51.424723Z","title":"An empirical analysis of compute-optimal inference for problem-solving with language models.arXiv preprint arXiv:2408.00724, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:51.424723Z"},"links":{"cited_paper":"/paper/2408.00724","citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:d4c7b3449f179048063db225dbb016b1d9d7455eb3c1f787a0f664b047312949","observation_id":"feb16f13-e5b0-4c5d-83df-09a59c102902","resolution":{"observed_at":"2026-08-07T11:58:51.424723Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.02447","last_updated":"2023-12-05T02:57:42Z","snapshot_observed_at":"2026-07-06T16:56:57.763886Z","submitted_at":"2023-12-05T02:57:42Z","title":"Fast non-autoregressive inverse folding with discrete diffusion","version":1},"cited_work":{"arxiv_id":"2312.02447","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.02447","snapshot_observed_at":"2026-08-07T11:58:52.795026Z","title":"Fast non-autoregressive inverse folding with discrete diffusion","venue":"q-bio.BM","work_id":"c13c5d0d-bb56-4d25-a516-5bf8f7464ba5","year":2023},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:51.582107Z"},"links":{"cited_paper":"/paper/2312.02447","citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:6f73ca7e7b32f5e6edb2c658196a9f56ccba1a6656315ac6d8167f57c802e156","observation_id":"69432565-24bc-43ea-a459-8639dcd96189","resolution":{"observed_at":"2026-08-07T11:58:52.907883Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:51.713919Z","title":"Tree of thoughts: Deliberate problem solving with large language models.Ad- vances in Neural Information Processing Systems, 36, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:51.713919Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:03b548abf958eda3a88ddd8aea48457902c1b9debadf5428ece73e3858cef868","observation_id":"103ca4f9-23b4-4079-850e-12cac988171f","resolution":{"observed_at":"2026-08-07T11:58:51.713919Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:53.794223Z","title":"Graph denoising diffusion for inverse protein folding","venue":null,"work_id":"37a68bf3-b5e6-4081-a486-f55575932a98","year":2023},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:51.838442Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:513cdc76c5697ce678573e9fb7794fa1f898760e319105c5fa1d3a84499aeed2","observation_id":"436c4b7f-34ce-4235-9ebc-7842feaedcdd","resolution":{"observed_at":"2026-08-07T11:58:53.920552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:53.612581Z","title":"Inverse protein folding problem: designing polymer sequences","venue":null,"work_id":"ded4694d-4766-4a2b-98a5-71a750f706f7","year":1992},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:51.953139Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:30372e2c9077d4e0b4e71d28035a87bd353a2f9791211d1a408ce9219c86726c","observation_id":"d8632ed7-de4d-4b98-84c2-57d2a669e2a9","resolution":{"observed_at":"2026-08-07T11:58:53.685959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.07394","last_updated":"2024-06-13T07:19:06Z","snapshot_observed_at":"2026-07-06T18:29:00.001236Z","submitted_at":"2024-06-11T16:01:07Z","title":"Accessing GPT-4 level Mathematical Olympiad Solutions via Monte Carlo Tree Self-refine with LLaMa-3 8B","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.07394","snapshot_observed_at":"2026-08-07T11:58:52.056824Z","title":"Accessing gpt-4 level mathematical olympiad solutions via monte carlo tree self-refine with llama-3 8b.arXiv preprint arXiv:2406.07394, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:52.056824Z"},"links":{"cited_paper":"/paper/2406.07394","citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:c78f44dcd35b6e3b6a807d77e2ca1fb953eb411974ca0ac331ee0f342a789472","observation_id":"94c2f9b8-4880-4b5e-b3bb-67c0bf3dd9ec","resolution":{"observed_at":"2026-08-07T11:58:52.056824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:52.150614Z","title":"Tm-align: a protein structure alignment algorithm based on the tm-score.Nucleic acids research, 33(7):2302–2309, 2005","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:52.150614Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:5dd9ac42fa9af264662f6de5f2e417e69cb03788a26ec1e897fb62ac3162fe96","observation_id":"3914f7a3-cb63-4517-b053-8ec441994e22","resolution":{"observed_at":"2026-08-07T11:58:52.150614Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:53.352402Z","title":"Structure- informed language models are protein designers","venue":null,"work_id":"f785be74-a948-41aa-81bd-19d9e8fc7417","year":2023},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:52.286643Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:81f590cfd7ba433b606a2323575b02cc9a4296edab424104650d070dfa45632d","observation_id":"d27c396e-1bc8-465e-92e4-1598e99c74de","resolution":{"observed_at":"2026-08-07T11:58:53.518112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.10516","last_updated":"2024-02-16T09:05:02Z","snapshot_observed_at":"2026-07-06T17:31:04.675896Z","submitted_at":"2024-02-16T09:05:02Z","title":"Generative AI for Controllable Protein Sequence Design: A Survey","version":1},"cited_work":{"arxiv_id":"2402.10516","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.10516","snapshot_observed_at":"2026-08-07T11:58:52.592653Z","title":"Generative AI for Controllable Protein Sequence Design: A Survey","venue":"q-bio.BM","work_id":"daf12c9b-b371-4121-8e4a-1d0887d352e5","year":2024},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:52.374100Z"},"links":{"cited_paper":"/paper/2402.10516","citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:4af4e0a1babfacd6ee6f30c465f4c8a2331b2a7ca2fb59b4235bed22c5782a29","observation_id":"b902b7b5-5884-4e40-93fb-fd728ccaa1f3","resolution":{"observed_at":"2026-08-07T11:58:52.683940Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:58:53.148728Z","title":"Bridge-if: Learning inverse protein folding with markov bridges","venue":null,"work_id":"64a220f5-0468-4fac-8ab0-addd9662f201","year":null},"citing_paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T11:58:52.471129Z"},"links":{"citing_paper":"/paper/2506.00925"},"observation_digest":"sha256:4861ff9add56223a7a81ad56bfaacfa3af309e04d63fc2ffcbeee53c68e528de","observation_id":"246dd1ca-f324-436a-8a00-2d04c7b5a189","resolution":{"observed_at":"2026-08-07T11:58:53.246995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.00925","last_updated":"2025-06-01T09:34:20Z","latest_version":1,"primary_category":"q-bio.BM","snapshot_observed_at":"2026-08-07T11:52:22.365690Z","submitted_at":"2025-06-01T09:34:20Z","title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search"},"reference_resolution":{"displayed":50,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":26,"verified_exact":2,"verified_fuzzy":22},"total_outbound_references":50},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 50 of 50 outbound references and 3 inbound Pith citation observations for arXiv:2506.00925."}