{"as_of":"2026-08-13T17:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:41d1ad1d0d44b9ff552a7e94bc93727253da591d8395cc95e598aaec96ea10e4","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-13T06:32:02.005865+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-13T03:06:58.895460Z","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:3a55e9bf8f08b76c624340f25089367ec25a894a90a2e1e6e8863c33560e0576","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-13T03:06:58.895460Z","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-08-11T20:28:01.591218Z","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:d77d236e3bc8c4178fda407cc8053c775f4ccfeba2f06480ece2e17eaac412ca","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T03:06:58.895460Z","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:13ada327da6020aee04f9b3453951a6348d987d0fdcddb012d03f2f8db0c77dd","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T03:06:58.895460Z","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:3acca6b54325a2efb0a244e5fd7707831eb0769795f5e5d4519b25637ddfd6bf","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-13T03:06:58.895460Z","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:37b8dd58834fa227a4e27cd331b5dd8225f4af3d733046f41bb8808346f595ca","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-13T03:06:58.895460Z","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:1a61d418945b0d2ef73be36c721eaed7e63e87de62deedc9e7f3a4a1d95697f9","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-13T03:06:58.895460Z","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:33125d0df8a7d242ebe12a4d7466af1cfa54c982c686c29a8a4d0ef7c8ab9e09","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T03:06:58.895460Z","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:917fc5b62c1e395ef600429b30bf1be61a056c580d340dee3479163ec0f1515d","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T03:06:58.895460Z","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:419d7fa7398d2efd83ce99b65714aae95e3fad345f4b4fe1cbeb054945cd0782","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T03:06:58.895460Z","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:c91563797fd8f6fbffde0983a51e94de5ee370ca13c7cdcb1d01417a27b4655b","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-13T03:06:58.895460Z","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:f7f057b69e00dd5b4d60f457560b9694b296d6a08687ffb8cedbaecef4515b5d","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-13T03:06:58.895460Z","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:3efbcd993ca11f28d2460aa9fa644a697d1d64f198f2909099cff6817a9dcb4b","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-13T16:49:19.533598Z","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-13T03:06:58.895460Z","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:083746dfdd0903e217b250bf3ff15a3cefcfc30eaebcf11f081e056590d0e6f7","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-13T03:06:58.895460Z","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:37f4f27cabfb2d0754c322b3f46c1f39c318d9c11e4bd44ce7132699d7fb7c37","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T03:06:58.895460Z","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:2defc650952ab97f796627d14183c8a8dccdd0e6b853043d479a953a25c50b47","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T03:06:58.895460Z","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:8fe0361e1001bbd0d33912b39082cb857da6aa2a437d7a483735bad4033d95ae","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T03:06:58.895460Z","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:a6f79cc208473fff55ff26a704e2e8a1291c41617a6b7053c7418698bad41e22","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T03:06:58.895460Z","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:ebaa1ad41d762b306db52d06fc2f438cea52ffe0bea6fe8255c5fc2cbf47c06d","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-13T03:06:58.895460Z","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:904a9a1a54e466b9c4323862c7297d520a4b96b3c377526108dd4538e572d83e","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T03:06:58.895460Z","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:cbd40b8501d9ec6ccb657b04ca49371a060c617473db94e6ea3df5f1ffac2d5a","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-13T03:06:58.895460Z","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:20056d1e14dce508ec980564e583f2e9feec4525eac38184387021a1ca0ba0d5","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T03:06:58.895460Z","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:d1e3a36fa49436621f9151536b85b471f23750c86c8d372bcff0868327ba3e3a","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-13T03:06:58.895460Z","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:aad40a183f3a434b96d45430a27d00c12eb33c613e83aaf402d74e332194c622","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T03:06:58.895460Z","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:a3470e509a16a96d074e464c05f646cf9dbfb267b800c0872bfd4e305b69b550","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T03:06:58.895460Z","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:58666083d89332f082b5cfde65f2484b7f94a4171aecd38c0bcac13ad1706b28","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T23:58:05.632912Z","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-13T03:06:58.895460Z","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:c00fe15017b8f3fac4f009eebf11aa591acd5cc37f1376e1086392bac8f19262","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-13T03:06:58.895460Z","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:6ecc80cc4eca5a7d5d8fe5873659d3bb9b0a7006378b681db4097a5040e6314c","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T03:06:58.895460Z","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:7e54ca1db113aa036b0f707ea81747c64dc186bf8c3001df2d6e7952ec305c39","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T03:06:58.895460Z","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:f183de6dae3257be42c155150f678a8563092117ec5f1e58730465f779966318","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-13T03:06:58.895460Z","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:41bb474315928fb62813c66e22178ea303d7e7fea30c9c453266bef1b47c3563","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-13T03:06:58.895460Z","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:eff43155c5a21ac3e0e8255f3ad874f2713dd879b07d8dbe270dddde5685c3a4","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T03:06:58.895460Z","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:4df8523e466c1a2d233a8d4867ba2f310ba7c32da1bccefcb02f962a42ff1c4b","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-08-12T23:04:54.942566Z","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-13T03:06:58.895460Z","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:7875edeb613fa57359b12db08c9bdcd9f1eae9e1893a1eb92593404172f26f17","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-13T03:06:58.895460Z","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:2c78ebf12f53cbefd4ec28a946c061ff58851d7afc45a21c08730c02955af1d2","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T03:06:58.895460Z","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:b49b8d5fe42611e890cdbca16196a2a445478a138c3c26d964f6aa85c4a21302","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T03:06:58.895460Z","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:0ba5cf9084c4a74f792120045f48de4030bf74c7bc8fa49e097a6aa9562335db","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T03:06:58.895460Z","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:eafe4e7ae5c2b97191c243e1540542bc9c35e979bacd196ecafdb8f48ff0c9b4","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-13T03:06:58.895460Z","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:3ecef88571aa8bb3dbb533a5cbe36fc17713e1091f01b934a73dfe127aa75c12","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-13T15:58:36.656111Z","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-13T03:06:58.895460Z","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:7a2a69a1a1e1ee132a870d1cca0c172b86bfcacc2f123d9208dc670a7c4687cf","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-13T03:06:58.895460Z","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:d72879a7d82af6f9e36f61cfeff2e1884f0afddcac8e7e68e99548a904739bb0","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-13T03:06:58.895460Z","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:ff6597b2aa5578e118feae654d69e85fedcfb0852d2c3fbc8825cbc4ae3d9171","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T03:06:58.895460Z","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:b0059abbce7bfe75b2ada54f25390cf6ac4cb3a85fa39cba5ba40531d9824a45","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-13T03:06:58.895460Z","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:cdb19d982682bbed597e2471096f38957a728333ca0cfd913f1180866ccb32d0","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-08-13T03:06:10.986532Z","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-13T03:06:58.895460Z","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:f542259d0563ffec02cac70810c02de495d6db3ab41688b3a95e679b47d87341","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-08-13T05:09:54.505858Z","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-13T03:06:58.895460Z","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:39de04e5e375b634214bb5ede7e12ee092bf36bf175db93da0f57d11aa9c3076","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T03:06:58.895460Z","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:bbc1e24739ee9f3c033015d4c31cc2d8d64617f2c847be1c8ed4cfb052baf3b6","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-13T03:06:58.895460Z","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:8411e772568b81c4c02c6408122cfff487d3e6abb8068ea3e2684865c156e49d","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T03:06:58.895460Z","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:3e06a93489128953a572c72cb3c4b94ceee33637ba96477f706335e9a59a17a5","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T23:45:25.243322Z","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-13T03:06:58.895460Z","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:e2e4e574ccac7ebde120a289b2b66076707d6fc7cff297e28ad01111f6b36543","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-13T03:06:58.895460Z","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:9c9517b1983511678eb2910472bc13fdba9728aba11c7d09fe1416558589f699","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-13T03:06:58.895460Z","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:020b5295fd694a1fdb4acfc72bd50a7f9547fbea19887e75b83ff85c86af9c57","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-13T04:17:46.644458Z","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-13T03:06:58.895460Z","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:b5a67423f94397972f24c308db180be022a4652f8d06b6aef454c4640f19556a","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T03:06:58.895460Z","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:f2adcfbc9ab80667859f92beb40715193ac8b9b0d79da188b417a4dd2e55bc99","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T03:06:58.895460Z","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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 50 of 50 outbound references and 3 inbound Pith citation observations for arXiv:2506.00925."}