{"as_of":"2026-08-20T00:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:64c2353bc35caccc07e0228fea826f317eea842cdb7c8592961aba30526ad00d","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T10:53:37.984663Z","state":"measured"},{"denominator":54,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":54,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:46:41.746935Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T14:46:51.045888Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"cited_work":{"arxiv_id":"2411.18885","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.18885","snapshot_observed_at":"2026-08-07T14:46:51.045888Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","venue":"cs.CL","work_id":"e0cc8243-b633-4571-80f7-51a424ce9089","year":2024},"citing_paper":{"arxiv_id":"2608.06111","last_updated":"2026-08-06T14:44:31Z","snapshot_observed_at":"2026-08-13T09:37:16.052805Z","submitted_at":"2026-08-06T14:44:31Z","title":"Beyond Sequence Order: Syntax-Informed Positional Embeddings for Transformers","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T14:46:41.746935Z"},"links":{"cited_paper":"/paper/2411.18885","citing_paper":"/paper/2608.06111"},"observation_digest":"sha256:7121d1889679e86c1f2bf7ad3d72a82456fcc1b190d4bd5b6c51d7f3d7b08b36","observation_id":"ddc1f754-9646-449d-98ab-26d16245183b","resolution":{"observed_at":"2026-08-07T14:46:51.156719Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2411.18885/citation-record","integrity":"/paper/2411.18885/integrity","json":"/paper/2411.18885/citation-record.json","paper":"/paper/2411.18885"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:53:37.027647Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.027647Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:e2a8b17d9af0de76b4dd50d347575f9e15a83fa4e7fd246bdd3659e5a8676b08","observation_id":"03e28776-924f-4d25-9a48-422d5067ac34","resolution":{"observed_at":"2026-08-12T10:53:37.027647Z","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-12T10:53:37.080054Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.080054Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:37fce514b60dcfb3103eff66e189d28aaeb50adaf8f0d41d998bf87518a2fcc3","observation_id":"4e471199-4de9-4320-a595-4c0c159434af","resolution":{"observed_at":"2026-08-12T10:53:37.080054Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-17T09:58:46.058102Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-12T10:53:37.098149Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.098149Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:eeafe8c8c2665172d455948eed17098f0d2368b0b4a9e7564798c946bbf7be54","observation_id":"2df9f44f-c3c3-4218-ad5d-ee25c8ae3eb4","resolution":{"observed_at":"2026-08-12T10:53:37.098149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.13673","last_updated":"2025-05-19T11:12:27Z","snapshot_observed_at":"2026-08-18T16:00:47.608550Z","submitted_at":"2023-05-23T04:28:16Z","title":"Physics of Language Models: Part 1, Learning Hierarchical Language Structures","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.13673","snapshot_observed_at":"2026-08-12T10:53:37.103973Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.103973Z"},"links":{"cited_paper":"/paper/2305.13673","citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:ebfe3b0717b1815874077e8c98165ac37213030209ec6437cb175a2527c7bbe0","observation_id":"4a63b3a6-f13b-4d5f-93cf-017513117ee4","resolution":{"observed_at":"2026-08-12T10:53:37.103973Z","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-12T10:53:41.264058Z","title":null,"venue":null,"work_id":"bb75bac1-6023-4c61-944d-62de35b10e56","year":2024},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.109513Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:3b0808b0d56f89702768400f6ef62e7be04d0090f43cf31de3c1056f7ae8a716","observation_id":"cf2cbd1a-8b35-4ef1-a4f9-8240e047289c","resolution":{"observed_at":"2026-08-12T10:53:41.276029Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:41.125931Z","title":null,"venue":null,"work_id":"ec3ba3e4-73af-4e28-ba11-75eae6d0161f","year":2020},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.114625Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:848eec9ac73b806dad243c5a98c727a4fbd7600988db1e732620ed5176d1ec4d","observation_id":"528dd8df-80a7-4f85-b99a-dc3249c2ffe5","resolution":{"observed_at":"2026-08-12T10:53:41.187766Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:41.111655Z","title":null,"venue":null,"work_id":"3dcf7a02-f910-4afe-8f05-3ee88b1833e3","year":2020},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.119538Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:18ef136e813e5dbd2af0f0108afddbaf6cb1003101c2d1f68612e0c15d035032","observation_id":"e78d8631-7702-4abc-b812-aeb91d839353","resolution":{"observed_at":"2026-08-12T10:53:41.116439Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:41.097531Z","title":null,"venue":null,"work_id":"0a974a5a-1825-4dcb-91ce-f6bc15320917","year":2022},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.126208Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:6f0ebec702f6f99839768a4c6147dd644d13b0e975464186fcbe081851ecabe4","observation_id":"9bdbbdf4-6990-44cf-9819-c65d6eb1b7ab","resolution":{"observed_at":"2026-08-12T10:53:41.101900Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:41.083772Z","title":null,"venue":null,"work_id":"b221bba1-eaf8-48ea-83ea-98628bc3737c","year":1969},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.132290Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:0ce3811c5b25261afb8ea45138ea1e4804677bbaf895662fa448c1569a29d9d4","observation_id":"e83ba371-7066-415d-8a53-7d0073d79efb","resolution":{"observed_at":"2026-08-12T10:53:41.088195Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:41.057544Z","title":null,"venue":null,"work_id":"ee955968-0769-4f7e-b216-69341b5a83a2","year":1987},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.137169Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:df288585697e04e018b0568fe50498ecf65ea86d53b1ec89c1ac21f79cc501ab","observation_id":"100f40a9-3313-4c04-9f4f-63f904fea67c","resolution":{"observed_at":"2026-08-12T10:53:41.073177Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:40.937724Z","title":null,"venue":null,"work_id":"58b018c0-8541-4264-9e08-75edb208a6dd","year":2020},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.141578Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:d1652f67ad0f8ab741a78975a34c6fff4e9f3596626ae08572012ffdd93ebfbb","observation_id":"b7b707ad-178c-4824-832b-45a0e83ae9be","resolution":{"observed_at":"2026-08-12T10:53:40.980857Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-13T17:20:44.002518Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-12T10:53:37.185585Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.185585Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:d09330a52e563f5624a5251e082a403b46dc0c1a80a6f84258351d6917b2df12","observation_id":"78481fff-a8a6-4afd-a090-87b193915f04","resolution":{"observed_at":"2026-08-12T10:53:37.185585Z","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-12T10:53:40.922677Z","title":null,"venue":null,"work_id":"94ee0e37-b762-42dd-94d6-bb0a4bca1834","year":2016},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.220111Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:2696bfd11e35ceeb82db5d9cf1ace056ffec6e0c46db3ad7ce98c0aa3bb98e69","observation_id":"ffdf1404-fa90-4813-8122-3cb62d4db9aa","resolution":{"observed_at":"2026-08-12T10:53:40.927451Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:40.903973Z","title":null,"venue":null,"work_id":"f6380b6e-ad08-4463-a6ae-47a3a545846a","year":2023},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.294212Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:6ccd8b46a267ed807b383c89a087c10fea96061fb421781e2b7d2981cf2bf4a6","observation_id":"8f9898e1-8540-41c5-ba4a-4eb63014dea9","resolution":{"observed_at":"2026-08-12T10:53:40.910767Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:40.852818Z","title":null,"venue":null,"work_id":"e339c781-bb7c-4a60-8767-fccde993e5b7","year":2016},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.421154Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:8be00248de57066185f3714178a3899f67bf91bf3785c5475c236e14984e68b6","observation_id":"0139c9f9-0ef5-44f6-9669-cc6f013177e7","resolution":{"observed_at":"2026-08-12T10:53:40.858093Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:40.836371Z","title":null,"venue":null,"work_id":"c70d339b-444b-43d7-abf3-5b11133a0ab9","year":2020},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.437178Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:9624536d01f1576ac40dd0212e1376a15a9bbbe9b959271ec31ab74940a80f72","observation_id":"c8ac7503-6715-4a05-8301-b05b3f35bfba","resolution":{"observed_at":"2026-08-12T10:53:40.841898Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:40.711469Z","title":null,"venue":null,"work_id":"fab6c1f8-c3fc-4b39-9759-b9219a6c8de8","year":2020},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.442602Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:4b5882c19e9fe3f60a4c75b4c48649133036885d13d2ef58832defefa9fe68ef","observation_id":"57245a9d-1aee-4913-8914-bc9c01c3db24","resolution":{"observed_at":"2026-08-12T10:53:40.740403Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:40.695477Z","title":null,"venue":null,"work_id":"7a4c0180-9ec9-4e87-8a54-f4669befd245","year":2020},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.454460Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:6bbd49e73e766994b30d36e8440abed641a1d7851c12fb59293294012e27beaa","observation_id":"73e808ce-8017-4c48-a9f4-e8dff5279800","resolution":{"observed_at":"2026-08-12T10:53:40.700104Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:37.459189Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.459189Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:e0204438dadcece93a3d9af775170d7f204c08188cf0285969ccae0c29f1dd1f","observation_id":"d22c3374-c71c-4631-a54e-4499c0ded7d1","resolution":{"observed_at":"2026-08-12T10:53:37.459189Z","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-12T10:53:40.494743Z","title":null,"venue":null,"work_id":"aca74375-0418-4698-8c2b-9040ec8ac76b","year":2018},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.463622Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:ee759749e329422326762ddd8d02982f88d6f2a6aebf8a5cddc34fd57f474574","observation_id":"277da14d-1f7d-4915-8e9e-dadaaf84aef8","resolution":{"observed_at":"2026-08-12T10:53:40.576805Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:40.479581Z","title":"Hale and Milo s Stanojevi \\'c","venue":null,"work_id":"981c2adf-25c2-4272-8c0d-cb7444b0fca0","year":2024},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.469103Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:7708d4c9b60792d8812475a071d9713a9fea888e581259596e9a022efe84bbe6","observation_id":"29bfacfe-181a-48b7-a11b-9f38607f1652","resolution":{"observed_at":"2026-08-12T10:53:40.484723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:40.459457Z","title":null,"venue":null,"work_id":"4d252590-2d0e-46e5-a41e-0bf469a03962","year":2020},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.473808Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:ec5967ba9c448e1d58629273ee0a99f089aa54edd01be2e4b0c9251aa612297c","observation_id":"e0d339bf-9a55-47e9-97ee-efccb82f7a6c","resolution":{"observed_at":"2026-08-12T10:53:40.469063Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.08293","last_updated":"2024-06-17T16:22:52Z","snapshot_observed_at":"2026-08-16T14:10:18.573624Z","submitted_at":"2024-03-13T06:54:47Z","title":"Generative Pretrained Structured Transformers: Unsupervised Syntactic Language Models at Scale","version":3},"cited_work":{"arxiv_id":"2403.08293","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.08293","snapshot_observed_at":"2026-08-12T10:53:38.096747Z","title":"Generative Pretrained Structured Transformers: Unsupervised Syntactic Language Models at Scale","venue":"cs.CL","work_id":"1dddaee1-26ef-47ce-8589-f3126636d913","year":2024},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.478022Z"},"links":{"cited_paper":"/paper/2403.08293","citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:b26a71a80c62910621edc35ab2bcd2fee6da40bc7135bb4068c4202735907e8c","observation_id":"4ce56246-993a-4ca6-8270-e985697a45e0","resolution":{"observed_at":"2026-08-12T10:53:38.207374Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:40.289756Z","title":null,"venue":null,"work_id":"1929ee16-7860-4720-9a20-aea0dade5743","year":2021},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.482756Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:1cc46bbd856780a67e046f1e65ef2280061201986196badd34ce463b3660344e","observation_id":"4b67b671-5a56-40b5-8445-2daddb2ad8d3","resolution":{"observed_at":"2026-08-12T10:53:40.412702Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:40.243071Z","title":null,"venue":null,"work_id":"5e08167e-b998-4942-8106-cc1785310adb","year":2006},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.487345Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:1630cf92b1fc016a9c6e0666a7fdc5b131af846cb771c70a383e15478c8d3fd4","observation_id":"d8902811-8be9-4bd8-81dd-05b0f473dbc4","resolution":{"observed_at":"2026-08-12T10:53:40.248262Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:40.186972Z","title":null,"venue":null,"work_id":"3b534315-2c46-4f0f-b1c7-363eb7954066","year":1966},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.491491Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:8e1740aec170fd8272a44d4cf750b558fb83a89773679eee2282ac5cca7a5568","observation_id":"48035e75-da1e-43e0-b01e-859adeec8732","resolution":{"observed_at":"2026-08-12T10:53:40.232834Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:39.965184Z","title":null,"venue":null,"work_id":"a6194e61-f852-43a9-b876-ade038a1aa36","year":2022},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.495861Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:ff6d3571c308b39c5082b1bb1652bf274340e35b8eb4313d79ca94c046ac3f3d","observation_id":"a9d51c15-e647-48f9-8dc7-ff88c655a76e","resolution":{"observed_at":"2026-08-12T10:53:40.052333Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:39.950125Z","title":null,"venue":null,"work_id":"18793762-701a-498f-be2c-8594e377ab10","year":2015},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.500066Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:c711f0901e15d1061cc9402d86f816b335c987b323c2c0eaa6ece03cb0da5a5e","observation_id":"8ffa0e0b-2478-4886-9f93-f42c5bc3b937","resolution":{"observed_at":"2026-08-12T10:53:39.954825Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:39.935521Z","title":null,"venue":null,"work_id":"c92ea393-adce-4739-94cc-48b0bf630895","year":1993},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.503840Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:cf37f1674a340b453fed830279b82ac8c389482df0c76ea3ca0fa0e70a372df1","observation_id":"259904be-c657-4285-a425-dbba903b7e08","resolution":{"observed_at":"2026-08-12T10:53:39.939786Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:39.782937Z","title":null,"venue":null,"work_id":"42253dd3-c618-43d7-93e5-fa65da5df481","year":2020},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.508049Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:3dc905999c42db0165063b9e1be75ba093ba96ba90eb9b43124fe9a8a66f4065","observation_id":"8600faca-dd66-41cc-8322-4370e692bede","resolution":{"observed_at":"2026-08-12T10:53:39.881912Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:39.728059Z","title":null,"venue":null,"work_id":"17bdbcb7-31ef-45b7-8463-8c02cab461c6","year":2019},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.512290Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:849a05f4e5e108c2ec0a1f1caf250d9baeb9f391f68fccf6017e6972595245c5","observation_id":"1e1998f4-2d6d-4d75-96dd-d34bcadbc00a","resolution":{"observed_at":"2026-08-12T10:53:39.733636Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:39.714364Z","title":null,"venue":null,"work_id":"f0e62116-77e6-4245-8fb6-3e0c0c379534","year":2022},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.516474Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:057d8fa7e0cef072a19f48427efaed90e7b8f25e7643bc9d4b9b27bebd70602d","observation_id":"f6c751d6-ea70-4e7c-8f66-94fad948ece2","resolution":{"observed_at":"2026-08-12T10:53:39.718720Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:39.701268Z","title":null,"venue":null,"work_id":"7a63cf66-71f5-4a20-a0bb-f1ef942266bd","year":2023},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.521533Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:070b4eb8c81383ddfde8d8851359dadd0c20b78717619dd1dfa10222a818481a","observation_id":"34a956b0-94d2-4aa2-8893-151e66577d81","resolution":{"observed_at":"2026-08-12T10:53:39.705042Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:39.579828Z","title":null,"venue":null,"work_id":"09423fb0-6933-40b3-b5e5-371ec2d926ce","year":2023},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.573896Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:f207f8e28e480e230f682922382403258801fbc2d1b5083f799bca64261a04bb","observation_id":"a13a33d3-1e36-4e0e-9afd-74bdf1849df0","resolution":{"observed_at":"2026-08-12T10:53:39.623130Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:39.565444Z","title":null,"venue":null,"work_id":"e8a83c4d-a98d-4697-8e93-5ac7078b928f","year":2023},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.681750Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:cfeb6357dd4ff83930ccf00c9d1ec859dffcf3c8834238e09243c09c242782e2","observation_id":"d19da76f-d9a2-46b5-ac5b-a2698b45d159","resolution":{"observed_at":"2026-08-12T10:53:39.569966Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:39.335274Z","title":null,"venue":null,"work_id":"4e083b6d-4a03-489b-ae8f-8aaa32b2b285","year":2011},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.785890Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:4f3160d2071547cf51fa2f1dab2ed5b6b82f995e0690fa97ffcf0ee98daf1033","observation_id":"a4143e4a-5f76-469e-990c-b9ae2be2ab11","resolution":{"observed_at":"2026-08-12T10:53:39.464134Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:39.304565Z","title":null,"venue":null,"work_id":"e45097a9-384b-4a28-8b5d-b49ee84970be","year":2021},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.908781Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:352e09a7d1886ae8244c6153021da51b760e50d79f341aa91fed1a915db21150","observation_id":"abdc5bc5-1cdb-46d8-a609-97cf0559a304","resolution":{"observed_at":"2026-08-12T10:53:39.309056Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:39.289198Z","title":null,"venue":null,"work_id":"34869744-4b68-4d51-979d-2d33c12cd063","year":2022},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.918619Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:187bc3d6681d340a383435bd94a41a59ccd21cb8b8e1be34746d1958da1bc006","observation_id":"106cd6de-c59e-41a5-b730-8e671cda4ae1","resolution":{"observed_at":"2026-08-12T10:53:39.295005Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:39.275750Z","title":null,"venue":null,"work_id":"d153f750-29cc-4b15-a588-81fcd92dad30","year":2017},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.925069Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:fa49baef7270a26302368a3fd784b1100dbb7d568321db6461f793b05c2344de","observation_id":"4f69c816-242c-41a0-a0fc-3db3f057217a","resolution":{"observed_at":"2026-08-12T10:53:39.280274Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:39.202015Z","title":null,"venue":null,"work_id":"f69db9f4-9c98-4b3e-9752-87d73240c89c","year":2019},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.929082Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:3b75854e687b0e4e3d1f19b2961aac3eb17a489b3c8a38aa76a4a9f8618cce9e","observation_id":"8eddf108-d782-4f3a-8a88-a5c6b0b04316","resolution":{"observed_at":"2026-08-12T10:53:39.265495Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:39.032267Z","title":null,"venue":null,"work_id":"d5ea4488-37a0-424a-8cb1-245839c9c4d5","year":2013},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.933431Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:0e0686e507662d09cb6515baacea1c17f23b37a947ec4d2650e51846383580c7","observation_id":"fdc586f4-7be4-4936-bbac-950100e27dc5","resolution":{"observed_at":"2026-08-12T10:53:39.131035Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:39.015850Z","title":null,"venue":null,"work_id":"f780cb9f-0138-4aa1-b761-c68b9fe96490","year":2018},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.937724Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:dcf11ebda76243562b484805a85aefd19fa0740fb07a2d8e4395d7fd3115800f","observation_id":"df14551b-80d9-4a6f-90ca-90184c1246ae","resolution":{"observed_at":"2026-08-12T10:53:39.021553Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:38.849063Z","title":null,"venue":null,"work_id":"d1df1747-0b69-485b-8caf-0980a11aec52","year":2015},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.941529Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:ba967b15dc0dc4673f7ea48929e80a083be8f9631df16fe5e31d40dea23b3119","observation_id":"5d1656b6-1a12-4a88-a1f8-219facff0b6d","resolution":{"observed_at":"2026-08-12T10:53:38.920242Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.11805","last_updated":"2025-05-09T21:04:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-19T02:39:27Z","title":"Gemini: A Family of Highly Capable Multimodal Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.11805","snapshot_observed_at":"2026-08-12T10:53:37.945920Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.945920Z"},"links":{"cited_paper":"/paper/2312.11805","citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:1440a91731151601cb082687cd85e307a458035180c6e4e7a268f5ae219e7976","observation_id":"aae1ff54-8128-444c-9573-1d8255f6953c","resolution":{"observed_at":"2026-08-12T10:53:37.945920Z","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-12T10:53:38.834348Z","title":null,"venue":null,"work_id":"5c3a0ed4-1277-45e5-b94e-a846f68da130","year":2013},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.950591Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:568a3facdaee08a03bd0d6dc4f2f647465c1156ed284715a7029a1dce668d7d6","observation_id":"d7b35d00-d81a-4ae3-8ef0-3369ce5bb7bd","resolution":{"observed_at":"2026-08-12T10:53:38.839380Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:38.819174Z","title":"Gomez, ukasz Kaiser, and Illia Polosukhin","venue":null,"work_id":"8b033724-4cba-43e8-b939-f787ad152e4e","year":2017},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.955056Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:abe321292b566ec65fcfc71cdb7ce1ca6b3ea928c069f10aec1522252f3cb25b","observation_id":"a4aa0b09-cf7e-4480-bce7-d317c2207492","resolution":{"observed_at":"2026-08-12T10:53:38.824315Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:38.587545Z","title":null,"venue":null,"work_id":"5f15f8d2-3de1-45d9-8326-8db0065ff3da","year":2019},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.959670Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:95ca89f29ab8f6a333005b00cad55b55d3725505f80af6124e63331d7fc157d9","observation_id":"ba0e255d-0135-4b2b-afd4-30c36d2c228e","resolution":{"observed_at":"2026-08-12T10:53:38.681648Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:37.964148Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.964148Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:98a30c59cee516fb358ac7647058846d424e0261dba9d4a77319728c3f1fec10","observation_id":"37ea5a67-02cd-4159-bf4c-ffecd7792753","resolution":{"observed_at":"2026-08-12T10:53:37.964148Z","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-12T10:53:38.563267Z","title":null,"venue":null,"work_id":"9862fd49-da4e-4a1f-a564-5cc588016b37","year":2018},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.968271Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:4d16f418334d1ff563c0d37a3f5bebd9b0ef4947a8b08583ff67299cfb7904f1","observation_id":"4ce962d8-b657-45d6-991b-6d2518bdb001","resolution":{"observed_at":"2026-08-12T10:53:38.567571Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:38.548799Z","title":null,"venue":null,"work_id":"e77cc7a1-a753-4284-b407-93a0e6e48214","year":2024},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.972143Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:3c744cc181126a94d00cb4c38bc0519a0a4d12b2d156537f43df2d496bec736d","observation_id":"e465c1f8-b11a-4843-8ff9-e824b45aaac4","resolution":{"observed_at":"2026-08-12T10:53:38.553477Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:38.443405Z","title":null,"venue":null,"work_id":"1a91c9d6-e17a-4473-874b-00142bf567e8","year":2019},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.976260Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:33c5f917bfefefc9c7676cae6345e607dc7ee5faca43a2453f45eaf3d1bbb1b2","observation_id":"b1d04f94-1f74-4a76-a186-acfbceb4ab05","resolution":{"observed_at":"2026-08-12T10:53:38.536578Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:38.275211Z","title":null,"venue":null,"work_id":"f635d5a2-0628-4fc7-9d52-faaedc7bc049","year":2021},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.980588Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:a7e0ab1246911fc763956255ed1d2a74deb0c42fd2f842ea24598d657533ee9b","observation_id":"fcaf3d32-f2e8-4ba0-90e6-0343da69a7ef","resolution":{"observed_at":"2026-08-12T10:53:38.326563Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-12T10:53:38.261074Z","title":null,"venue":null,"work_id":"fadfa6d1-ea48-41f1-ae61-37b17080e66c","year":1967},"citing_paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-12T10:53:37.984663Z"},"links":{"citing_paper":"/paper/2411.18885"},"observation_digest":"sha256:2a217d0931750511779fd40939cf61eab2140ed8303feb22458a1c3540af0969","observation_id":"52490485-b915-4944-8ba2-926657665d9a","resolution":{"observed_at":"2026-08-12T10:53:38.265607Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.18885","last_updated":"2025-03-23T18:26:25Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-18T02:36:05.134042Z","submitted_at":"2024-11-28T03:27:48Z","title":"Sneaking Syntax into Transformer Language Models with Tree Regularization"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":50,"verified_exact":1,"verified_fuzzy":2},"total_outbound_references":53},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 1 inbound Pith citation observation for arXiv:2411.18885."}