{"as_of":"2026-08-08T20:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:723a59ac604a6cc38036c0b29e51d827981f16542d886047faabb48399e8131a","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:07:35.083225Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.22949/citation-record","integrity":"/paper/2505.22949/integrity","json":"/paper/2505.22949/citation-record.json","paper":"/paper/2505.22949"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:07:37.099800Z","title":"It has various options for pruning the search","venue":null,"work_id":"c2f0fbe4-14bf-4e8e-a4aa-36c3e7d788e3","year":null},"citing_paper":{"arxiv_id":"2505.22949","last_updated":"2025-05-29T00:05:07Z","snapshot_observed_at":"2026-08-07T12:54:23.405494Z","submitted_at":"2025-05-29T00:05:07Z","title":"Directed Graph Grammars for Sequence-based Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:34.445615Z"},"links":{"citing_paper":"/paper/2505.22949"},"observation_digest":"sha256:73470b757b8e575a8e84853a0f8c9ff871e99a53a691dbecb7119c8bb035a719","observation_id":"a0c56361-5055-45fd-9cc1-5fbcef088182","resolution":{"observed_at":"2026-08-07T13:07:37.175783Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:07:36.940393Z","title":"(c) Heuristic (O(n)): (Repeat K times) Initialize a random node, iterate over all remaining nodes in random order, adding any that satisfies clique condition","venue":null,"work_id":"bd5c24f4-e1b9-46bc-af35-37c0b3fa2476","year":null},"citing_paper":{"arxiv_id":"2505.22949","last_updated":"2025-05-29T00:05:07Z","snapshot_observed_at":"2026-08-07T12:54:23.405494Z","submitted_at":"2025-05-29T00:05:07Z","title":"Directed Graph Grammars for Sequence-based Learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:34.527981Z"},"links":{"citing_paper":"/paper/2505.22949"},"observation_digest":"sha256:fb6e70570e71b18d61f2cf9c29ac3c03ea05efacdbfb891eafb183f412982d0a","observation_id":"5cc66f69-ef89-4ceb-968f-6cde5560a8c7","resolution":{"observed_at":"2026-08-07T13:07:36.997936Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:07:36.825338Z","title":"if a neighbor has edge direction d, edge label β, and label σ, form an edge with direction d′ labeled γ to node x ∈ VS","venue":null,"work_id":"b8ce8eef-e1ea-4dd8-bcc1-3fdb6f806792","year":2020},"citing_paper":{"arxiv_id":"2505.22949","last_updated":"2025-05-29T00:05:07Z","snapshot_observed_at":"2026-08-07T12:54:23.405494Z","submitted_at":"2025-05-29T00:05:07Z","title":"Directed Graph Grammars for Sequence-based Learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:34.570823Z"},"links":{"citing_paper":"/paper/2505.22949"},"observation_digest":"sha256:e53928488d06254da366f650941233bbeea1eadf2c351209d8faca2b48b2a5b9","observation_id":"f8dff32b-784d-4ce5-bd03-aa1db9a422d5","resolution":{"observed_at":"2026-08-07T13:07:36.863879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:07:35.559916Z","title":null,"venue":null,"work_id":"c30b665f-4a58-4b5d-ab50-2876a681daac","year":null},"citing_paper":{"arxiv_id":"2505.22949","last_updated":"2025-05-29T00:05:07Z","snapshot_observed_at":"2026-08-07T12:54:23.405494Z","submitted_at":"2025-05-29T00:05:07Z","title":"Directed Graph Grammars for Sequence-based Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:34.982634Z"},"links":{"citing_paper":"/paper/2505.22949"},"observation_digest":"sha256:578d89993f8fe72389b597803d00662768f6367941bb8a6ef9c4281ae76ecb97","observation_id":"27c3e2f8-895c-4eb8-a9c8-572c273105f7","resolution":{"observed_at":"2026-08-07T13:07:35.631431Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:07:35.393722Z","title":null,"venue":null,"work_id":"1eb66129-9258-47ca-b45e-ecb80c40b844","year":null},"citing_paper":{"arxiv_id":"2505.22949","last_updated":"2025-05-29T00:05:07Z","snapshot_observed_at":"2026-08-07T12:54:23.405494Z","submitted_at":"2025-05-29T00:05:07Z","title":"Directed Graph Grammars for Sequence-based Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:35.036028Z"},"links":{"citing_paper":"/paper/2505.22949"},"observation_digest":"sha256:96d0152e8956dfa81ff2511166eafe1918fe30d79e685d9b611666b8a6cde30c","observation_id":"4542ee50-c1f7-4a2d-a3a4-d56879904270","resolution":{"observed_at":"2026-08-07T13:07:35.477942Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:07:35.231199Z","title":"is a possible circuit topol- ogy","venue":null,"work_id":"5271e320-8189-41b7-857d-1ff3a68db203","year":null},"citing_paper":{"arxiv_id":"2505.22949","last_updated":"2025-05-29T00:05:07Z","snapshot_observed_at":"2026-08-07T12:54:23.405494Z","submitted_at":"2025-05-29T00:05:07Z","title":"Directed Graph Grammars for Sequence-based Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:35.083225Z"},"links":{"citing_paper":"/paper/2505.22949"},"observation_digest":"sha256:343d569cab9eca8fe4355efee0ed6419d918f0d96095e5172eeb169cba03f02e","observation_id":"3ec81810-95fe-4fa3-b5b5-330959134017","resolution":{"observed_at":"2026-08-07T13:07:35.294617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:07:36.601212Z","title":"sub-datasets","venue":null,"work_id":"3823ccd3-7a12-4716-9a07-b732cb2062fc","year":null},"citing_paper":{"arxiv_id":"2505.22949","last_updated":"2025-05-29T00:05:07Z","snapshot_observed_at":"2026-08-07T12:54:23.405494Z","submitted_at":"2025-05-29T00:05:07Z","title":"Directed Graph Grammars for Sequence-based Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:34.591972Z"},"links":{"citing_paper":"/paper/2505.22949"},"observation_digest":"sha256:76829a31c906edd694ffd252dda4e042dfb8efa282ab1af20f9cfe41361e7be1","observation_id":"063cc1a4-5632-40de-a411-e10182f1ef51","resolution":{"observed_at":"2026-08-07T13:07:36.715950Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:07:36.499934Z","title":"motif size","venue":null,"work_id":"38b5ad05-552e-4a71-9a99-5bec1f7c1c79","year":2023},"citing_paper":{"arxiv_id":"2505.22949","last_updated":"2025-05-29T00:05:07Z","snapshot_observed_at":"2026-08-07T12:54:23.405494Z","submitted_at":"2025-05-29T00:05:07Z","title":"Directed Graph Grammars for Sequence-based Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:34.655010Z"},"links":{"citing_paper":"/paper/2505.22949"},"observation_digest":"sha256:9fb2911589ae188c0d82ed01267cc2f5f69047b6a76f95e26968c1f16d616d04","observation_id":"92979d8f-1b76-43d3-8ea5-2d07e4fc6edc","resolution":{"observed_at":"2026-08-07T13:07:36.547720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:07:36.308758Z","title":"Because the focus of our work is not pretraining, we did not invest the time to pretrain the encoder separately","venue":null,"work_id":"6a0d7213-4c8e-4c09-a5f0-c09a3ecac382","year":null},"citing_paper":{"arxiv_id":"2505.22949","last_updated":"2025-05-29T00:05:07Z","snapshot_observed_at":"2026-08-07T12:54:23.405494Z","submitted_at":"2025-05-29T00:05:07Z","title":"Directed Graph Grammars for Sequence-based Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:34.683546Z"},"links":{"citing_paper":"/paper/2505.22949"},"observation_digest":"sha256:b405cb1658c07385c937ec951cc7b7544d447cbe5ea59a3cbd8232bce24bcc9b","observation_id":"ff65329a-b567-454e-90ba-57bd98ca5fdb","resolution":{"observed_at":"2026-08-07T13:07:36.378898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:07:36.145195Z","title":null,"venue":null,"work_id":"bc348425-38e7-4667-aa0d-1aa44819aae7","year":2013},"citing_paper":{"arxiv_id":"2505.22949","last_updated":"2025-05-29T00:05:07Z","snapshot_observed_at":"2026-08-07T12:54:23.405494Z","submitted_at":"2025-05-29T00:05:07Z","title":"Directed Graph Grammars for Sequence-based Learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:34.753190Z"},"links":{"citing_paper":"/paper/2505.22949"},"observation_digest":"sha256:17f5c536fddd4748fee572f7a5f4b8bea60037280b407789625a6cb377587cc0","observation_id":"4bd22e4f-4739-4bd8-bc2b-221c6e43d17a","resolution":{"observed_at":"2026-08-07T13:07:36.251609Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:07:36.011016Z","title":"(4) 20 Directed Graph Grammars for Sequence-based Learning","venue":null,"work_id":"90498ed5-4cbb-4b04-82e0-f6fca5a6f678","year":null},"citing_paper":{"arxiv_id":"2505.22949","last_updated":"2025-05-29T00:05:07Z","snapshot_observed_at":"2026-08-07T12:54:23.405494Z","submitted_at":"2025-05-29T00:05:07Z","title":"Directed Graph Grammars for Sequence-based Learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:34.821641Z"},"links":{"citing_paper":"/paper/2505.22949"},"observation_digest":"sha256:854eb4f59871e9c3d211f2552eb5c445d18cc7ed49d0b1f1cdfb63cbbb30781c","observation_id":"a10312a2-f3de-4fa0-ba60-1c4fa99a5133","resolution":{"observed_at":"2026-08-07T13:07:36.087842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:07:35.867190Z","title":null,"venue":null,"work_id":"5fd53515-e93d-4450-bc92-1fcc78c471ce","year":null},"citing_paper":{"arxiv_id":"2505.22949","last_updated":"2025-05-29T00:05:07Z","snapshot_observed_at":"2026-08-07T12:54:23.405494Z","submitted_at":"2025-05-29T00:05:07Z","title":"Directed Graph Grammars for Sequence-based Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:34.879264Z"},"links":{"citing_paper":"/paper/2505.22949"},"observation_digest":"sha256:ce40f766eb4b4bc86f666ed7c32138a66d30b475457e7b5b3b22c0b0279a0bde","observation_id":"7baf0d00-ddd5-43ea-be63-aee6dd2a9174","resolution":{"observed_at":"2026-08-07T13:07:35.923006Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:07:35.765445Z","title":"Controls how closely the encoder’s latent distribution matches the prior","venue":null,"work_id":"33339381-acb8-4a96-9257-00044a757e85","year":null},"citing_paper":{"arxiv_id":"2505.22949","last_updated":"2025-05-29T00:05:07Z","snapshot_observed_at":"2026-08-07T12:54:23.405494Z","submitted_at":"2025-05-29T00:05:07Z","title":"Directed Graph Grammars for Sequence-based Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:34.942608Z"},"links":{"citing_paper":"/paper/2505.22949"},"observation_digest":"sha256:0695d095699cf945d28dd86640d8458cbc67ed18fd32f98f9a5f37541ee9ae2f","observation_id":"b4928605-4670-48d2-a61c-4181c3d93346","resolution":{"observed_at":"2026-08-07T13:07:35.821006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1511.06349","last_updated":"2016-05-12T20:51:23Z","snapshot_observed_at":"2026-08-05T16:42:28.278134Z","submitted_at":"2015-11-19T20:38:45Z","title":"Generating Sentences from a Continuous Space","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1511.06349","snapshot_observed_at":"2026-08-07T13:07:34.214666Z","title":"Bowman, S","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.22949","last_updated":"2025-05-29T00:05:07Z","snapshot_observed_at":"2026-08-07T12:54:23.405494Z","submitted_at":"2025-05-29T00:05:07Z","title":"Directed Graph Grammars for Sequence-based Learning","version":1},"reference_index":619,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:34.214666Z"},"links":{"cited_paper":"/paper/1511.06349","citing_paper":"/paper/2505.22949"},"observation_digest":"sha256:f11748a484d3506645e0cd473ca68260a02ca68ec6ebe6f4df3576505dd79230","observation_id":"24abc551-30ab-4b75-9b0b-51d57c65193d","resolution":{"observed_at":"2026-08-07T13:07:34.214666Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.07965","last_updated":"2021-02-02T18:45:44Z","snapshot_observed_at":"2026-07-06T10:33:59.667626Z","submitted_at":"2021-01-20T04:50:16Z","title":"Directed Acyclic Graph Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.07965","snapshot_observed_at":"2026-08-07T13:07:34.358820Z","title":"test cases","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.22949","last_updated":"2025-05-29T00:05:07Z","snapshot_observed_at":"2026-08-07T12:54:23.405494Z","submitted_at":"2025-05-29T00:05:07Z","title":"Directed Graph Grammars for Sequence-based Learning","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:34.358820Z"},"links":{"cited_paper":"/paper/2101.07965","citing_paper":"/paper/2505.22949"},"observation_digest":"sha256:9f35c0ac166892ba81f22e3a949b62f094e03a5d4dd19dc86fcb5758145ea649","observation_id":"e8ee550c-1ce9-4159-82c6-2c1f5ee10a39","resolution":{"observed_at":"2026-08-07T13:07:34.358820Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.08361","last_updated":"2020-01-23T03:59:20Z","snapshot_observed_at":"2026-07-06T08:52:12.656082Z","submitted_at":"2020-01-23T03:59:20Z","title":"Scaling Laws for Neural Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.08361","snapshot_observed_at":"2026-08-07T13:07:34.275994Z","title":"Jonyer, I., Holder, L., and Cook, D","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.22949","last_updated":"2025-05-29T00:05:07Z","snapshot_observed_at":"2026-08-07T12:54:23.405494Z","submitted_at":"2025-05-29T00:05:07Z","title":"Directed Graph Grammars for Sequence-based Learning","version":1},"reference_index":2332,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:34.275994Z"},"links":{"cited_paper":"/paper/2001.08361","citing_paper":"/paper/2505.22949"},"observation_digest":"sha256:486d687996285fc8ca9f93b9fc683d80119fd03e7510c1c16faa5b9d903e24b5","observation_id":"587ee356-53b1-41aa-aa5c-f215bae2775a","resolution":{"observed_at":"2026-08-07T13:07:34.275994Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0908.3817","last_updated":"2010-07-10T22:11:40Z","snapshot_observed_at":"2026-08-05T15:53:55.874095Z","submitted_at":"2009-08-26T13:36:18Z","title":"Learning Bayesian Networks with the bnlearn R Package","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0908.3817","snapshot_observed_at":"2026-08-07T13:07:34.329440Z","title":"Powers, D","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.22949","last_updated":"2025-05-29T00:05:07Z","snapshot_observed_at":"2026-08-07T12:54:23.405494Z","submitted_at":"2025-05-29T00:05:07Z","title":"Directed Graph Grammars for Sequence-based Learning","version":1},"reference_index":4104,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:34.329440Z"},"links":{"cited_paper":"/paper/0908.3817","citing_paper":"/paper/2505.22949"},"observation_digest":"sha256:7e2d1f1c80f85246081acf50d2217b0f1b64d6d20efd06bb1ce6fdaafc098056","observation_id":"63c196a4-b871-4041-9f38-45accc6389c9","resolution":{"observed_at":"2026-08-07T13:07:34.329440Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.22949","last_updated":"2025-05-29T00:05:07Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T12:54:23.405494Z","submitted_at":"2025-05-29T00:05:07Z","title":"Directed Graph Grammars for Sequence-based Learning"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":0,"verified_fuzzy":9},"total_outbound_references":17},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2505.22949."}