{"as_of":"2026-08-13T13:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a552599cd59a6565dd6034c260c0dd3c015a046cfd230461c9df5a70dbe2d67a","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-12T14:35:22.452363Z","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-13T06:32:02.005865+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/2411.15338/citation-record","integrity":"/paper/2411.15338/integrity","json":"/paper/2411.15338/citation-record.json","paper":"/paper/2411.15338"},"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-12T14:35:22.985189Z","title":null,"venue":null,"work_id":"ef5b8ecd-bbf3-4860-990e-59e9c06bc270","year":1965},"citing_paper":{"arxiv_id":"2411.15338","last_updated":"2024-11-22T20:38:09Z","snapshot_observed_at":"2026-08-12T14:22:28.831147Z","submitted_at":"2024-11-22T20:38:09Z","title":"On Computational Completeness of Semi-Conditional Matrix Grammars","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T14:35:22.306887Z"},"links":{"citing_paper":"/paper/2411.15338"},"observation_digest":"sha256:83ae698c59837bb6144e6a6dba9188c58ad63c1cdd8a13ab573ff482aeeffd2c","observation_id":"27f92ce1-fe00-4b12-85e8-5516adddf299","resolution":{"observed_at":"2026-08-12T14:35:22.992588Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:35:22.963254Z","title":"Cremers and O","venue":null,"work_id":"d73ab57a-ce81-4106-a477-a176b386440c","year":1973},"citing_paper":{"arxiv_id":"2411.15338","last_updated":"2024-11-22T20:38:09Z","snapshot_observed_at":"2026-08-12T14:22:28.831147Z","submitted_at":"2024-11-22T20:38:09Z","title":"On Computational Completeness of Semi-Conditional Matrix Grammars","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T14:35:22.318615Z"},"links":{"citing_paper":"/paper/2411.15338"},"observation_digest":"sha256:c8f5435814ea6dbef9f05372c88fee9e5f9f4ae797fedd76ee1f91912771b967","observation_id":"43d224ed-3f04-4e0f-badd-59423092c2f2","resolution":{"observed_at":"2026-08-12T14:35:22.969921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:35:22.936890Z","title":"Dassow and Gh","venue":null,"work_id":"4069e6ab-9e62-4a7d-9201-4794785de9c2","year":1989},"citing_paper":{"arxiv_id":"2411.15338","last_updated":"2024-11-22T20:38:09Z","snapshot_observed_at":"2026-08-12T14:22:28.831147Z","submitted_at":"2024-11-22T20:38:09Z","title":"On Computational Completeness of Semi-Conditional Matrix Grammars","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T14:35:22.325306Z"},"links":{"citing_paper":"/paper/2411.15338"},"observation_digest":"sha256:d63156501651dfc3f767243777f69260749af9fd3ca6fd999365b9fd5b23ceac","observation_id":"3b18db43-5ee1-4ab3-b107-2dd8219f477e","resolution":{"observed_at":"2026-08-12T14:35:22.943286Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:35:22.912085Z","title":null,"venue":null,"work_id":"d0326af3-b1c5-4926-bf12-255e277ef421","year":2003},"citing_paper":{"arxiv_id":"2411.15338","last_updated":"2024-11-22T20:38:09Z","snapshot_observed_at":"2026-08-12T14:22:28.831147Z","submitted_at":"2024-11-22T20:38:09Z","title":"On Computational Completeness of Semi-Conditional Matrix Grammars","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T14:35:22.334493Z"},"links":{"citing_paper":"/paper/2411.15338"},"observation_digest":"sha256:a73e0c3ab2ccdc05c88e446eeabcd80728010cea9a714df77a480f1eb46b3fbf","observation_id":"7319d9fb-b3ae-4680-8656-5be1dbfd6e3d","resolution":{"observed_at":"2026-08-12T14:35:22.919423Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:35:22.888521Z","title":null,"venue":null,"work_id":"c488e97c-40f2-436c-adc3-2fd4e2efafaf","year":2021},"citing_paper":{"arxiv_id":"2411.15338","last_updated":"2024-11-22T20:38:09Z","snapshot_observed_at":"2026-08-12T14:22:28.831147Z","submitted_at":"2024-11-22T20:38:09Z","title":"On Computational Completeness of Semi-Conditional Matrix Grammars","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T14:35:22.344158Z"},"links":{"citing_paper":"/paper/2411.15338"},"observation_digest":"sha256:040297df8e4e438cbb675412a71000f4e4c4161a5d12a5abca72883da45ef0d2","observation_id":"fa43ff1e-1455-479c-ab6c-28f4d568f951","resolution":{"observed_at":"2026-08-12T14:35:22.895531Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:35:22.859701Z","title":"Fernau, R","venue":null,"work_id":"f9cf177d-ff82-4d1f-9c70-52dd80426696","year":2007},"citing_paper":{"arxiv_id":"2411.15338","last_updated":"2024-11-22T20:38:09Z","snapshot_observed_at":"2026-08-12T14:22:28.831147Z","submitted_at":"2024-11-22T20:38:09Z","title":"On Computational Completeness of Semi-Conditional Matrix Grammars","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T14:35:22.351797Z"},"links":{"citing_paper":"/paper/2411.15338"},"observation_digest":"sha256:af2edd9eb56566c00a0c4743d1f68c9bd3020d47f626e3b5bacadc137d7a8234","observation_id":"557f91a9-1fd1-4d04-87e2-9f8bfbb790ca","resolution":{"observed_at":"2026-08-12T14:35:22.867117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:35:22.823099Z","title":"Fernau, L","venue":null,"work_id":"14e610a2-a645-4efb-b780-0345cda6b2c8","year":2021},"citing_paper":{"arxiv_id":"2411.15338","last_updated":"2024-11-22T20:38:09Z","snapshot_observed_at":"2026-08-12T14:22:28.831147Z","submitted_at":"2024-11-22T20:38:09Z","title":"On Computational Completeness of Semi-Conditional Matrix Grammars","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T14:35:22.362939Z"},"links":{"citing_paper":"/paper/2411.15338"},"observation_digest":"sha256:43c5f43f3bed053f67e2591dd2c4561be58f24f31e234ae1a227e90b684d5c1e","observation_id":"d01ef93e-e931-48c3-b9e8-67425092a0e0","resolution":{"observed_at":"2026-08-12T14:35:22.835627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:35:22.778358Z","title":"Fernau, L","venue":null,"work_id":"a92b3d99-42ef-4ae4-beab-db9f6de966cb","year":2024},"citing_paper":{"arxiv_id":"2411.15338","last_updated":"2024-11-22T20:38:09Z","snapshot_observed_at":"2026-08-12T14:22:28.831147Z","submitted_at":"2024-11-22T20:38:09Z","title":"On Computational Completeness of Semi-Conditional Matrix Grammars","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T14:35:22.372451Z"},"links":{"citing_paper":"/paper/2411.15338"},"observation_digest":"sha256:d7a3c3b53dc1a91f8246b03ac843bd85c4214de26522ff6a821f23324a61b820","observation_id":"aedc0479-99c4-436b-a0df-0925b708c77e","resolution":{"observed_at":"2026-08-12T14:35:22.788054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:35:22.751804Z","title":"Fernau, L","venue":null,"work_id":"3928cce5-c91c-4b70-8fbb-b8b7de2e39ea","year":2024},"citing_paper":{"arxiv_id":"2411.15338","last_updated":"2024-11-22T20:38:09Z","snapshot_observed_at":"2026-08-12T14:22:28.831147Z","submitted_at":"2024-11-22T20:38:09Z","title":"On Computational Completeness of Semi-Conditional Matrix Grammars","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T14:35:22.381514Z"},"links":{"citing_paper":"/paper/2411.15338"},"observation_digest":"sha256:55edbe271d0d1eb6b1d0ec375e4a88434b9e03509a2221581c8ffb5f42a584a3","observation_id":"d70f2c7a-efab-4e5f-ba3b-84fa3170d110","resolution":{"observed_at":"2026-08-12T14:35:22.761295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:35:22.712741Z","title":"Freund, C","venue":null,"work_id":"4d449f38-68a1-4401-ac4d-220146965a0d","year":2004},"citing_paper":{"arxiv_id":"2411.15338","last_updated":"2024-11-22T20:38:09Z","snapshot_observed_at":"2026-08-12T14:22:28.831147Z","submitted_at":"2024-11-22T20:38:09Z","title":"On Computational Completeness of Semi-Conditional Matrix Grammars","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T14:35:22.393998Z"},"links":{"citing_paper":"/paper/2411.15338"},"observation_digest":"sha256:78bac45be8ba278cbd4eecfa64083c80a82146fa8ad4b59d2c10ebf2b9de8ea0","observation_id":"125fdf8a-d58b-4042-acc9-73b77aec6854","resolution":{"observed_at":"2026-08-12T14:35:22.732089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:35:22.679700Z","title":null,"venue":null,"work_id":"9f20cfcf-3fce-47b9-8d32-da9f382bf838","year":1991},"citing_paper":{"arxiv_id":"2411.15338","last_updated":"2024-11-22T20:38:09Z","snapshot_observed_at":"2026-08-12T14:22:28.831147Z","submitted_at":"2024-11-22T20:38:09Z","title":"On Computational Completeness of Semi-Conditional Matrix Grammars","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T14:35:22.401729Z"},"links":{"citing_paper":"/paper/2411.15338"},"observation_digest":"sha256:79a558b05dd80e0eeb813c08f059423a7f2ee7d92c5dd2a0c184f46bb820eb1b","observation_id":"96f6f97e-0ca7-463f-a1c4-20d40565941d","resolution":{"observed_at":"2026-08-12T14:35:22.688623Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:35:22.656965Z","title":"Hauschildt and M","venue":null,"work_id":"83c84d77-adf9-463b-b8c0-9d4fecc8b1e1","year":1994},"citing_paper":{"arxiv_id":"2411.15338","last_updated":"2024-11-22T20:38:09Z","snapshot_observed_at":"2026-08-12T14:22:28.831147Z","submitted_at":"2024-11-22T20:38:09Z","title":"On Computational Completeness of Semi-Conditional Matrix Grammars","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T14:35:22.408687Z"},"links":{"citing_paper":"/paper/2411.15338"},"observation_digest":"sha256:78c11033fa6d1255ccc0627cf485f189f35d39d6bf36909f9f6eb30ee475c239","observation_id":"8bc5d89a-1f42-4aff-a616-551d235e4cdd","resolution":{"observed_at":"2026-08-12T14:35:22.662864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:35:22.630682Z","title":"Masopust","venue":null,"work_id":"1ab68edd-2558-4aa8-b574-69703d9a67e8","year":2009},"citing_paper":{"arxiv_id":"2411.15338","last_updated":"2024-11-22T20:38:09Z","snapshot_observed_at":"2026-08-12T14:22:28.831147Z","submitted_at":"2024-11-22T20:38:09Z","title":"On Computational Completeness of Semi-Conditional Matrix Grammars","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T14:35:22.415205Z"},"links":{"citing_paper":"/paper/2411.15338"},"observation_digest":"sha256:28910009e9f13b4a5754c15a8e06dd0f5afa1106178099f8ad74f1e9c59b1e29","observation_id":"d8227061-0aed-457d-bf3c-1eda41fb9d4d","resolution":{"observed_at":"2026-08-12T14:35:22.638423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:35:22.589889Z","title":"Masopust and A","venue":null,"work_id":"d0f35bb3-3695-43a0-a293-aaff5660903d","year":2007},"citing_paper":{"arxiv_id":"2411.15338","last_updated":"2024-11-22T20:38:09Z","snapshot_observed_at":"2026-08-12T14:22:28.831147Z","submitted_at":"2024-11-22T20:38:09Z","title":"On Computational Completeness of Semi-Conditional Matrix Grammars","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T14:35:22.427887Z"},"links":{"citing_paper":"/paper/2411.15338"},"observation_digest":"sha256:ad8243ee1d3e4b05574894deceecdf5a267445b52aa3342a77701bcb9f1ab8a9","observation_id":"c134dbe9-0ad9-4603-b2f6-9278030d3dfd","resolution":{"observed_at":"2026-08-12T14:35:22.602161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:35:22.558542Z","title":null,"venue":null,"work_id":"0150b64b-6aca-4e8a-9277-659ddc37e607","year":1990},"citing_paper":{"arxiv_id":"2411.15338","last_updated":"2024-11-22T20:38:09Z","snapshot_observed_at":"2026-08-12T14:22:28.831147Z","submitted_at":"2024-11-22T20:38:09Z","title":"On Computational Completeness of Semi-Conditional Matrix Grammars","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T14:35:22.437553Z"},"links":{"citing_paper":"/paper/2411.15338"},"observation_digest":"sha256:eac518823766f56203826003327cf949edc1d54a67e40eb515b1d7b2a1ccce17","observation_id":"7ec2f1e4-9644-45fa-96f5-408b05cdd129","resolution":{"observed_at":"2026-08-12T14:35:22.566860Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:35:22.535650Z","title":"Meduna and T","venue":null,"work_id":"f6dd2dd4-073e-4398-a626-b3a28a288b48","year":2004},"citing_paper":{"arxiv_id":"2411.15338","last_updated":"2024-11-22T20:38:09Z","snapshot_observed_at":"2026-08-12T14:22:28.831147Z","submitted_at":"2024-11-22T20:38:09Z","title":"On Computational Completeness of Semi-Conditional Matrix Grammars","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T14:35:22.443162Z"},"links":{"citing_paper":"/paper/2411.15338"},"observation_digest":"sha256:01b15cc61aa42906d51c28d35d59188871e85967ce4650412474f96ea3ec764c","observation_id":"7faa300a-9168-4b47-8b5d-958e72dc6401","resolution":{"observed_at":"2026-08-12T14:35:22.544101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:35:22.506998Z","title":null,"venue":null,"work_id":"4f133078-36be-47c8-8108-ebf1e5d78abd","year":1985},"citing_paper":{"arxiv_id":"2411.15338","last_updated":"2024-11-22T20:38:09Z","snapshot_observed_at":"2026-08-12T14:22:28.831147Z","submitted_at":"2024-11-22T20:38:09Z","title":"On Computational Completeness of Semi-Conditional Matrix Grammars","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T14:35:22.452363Z"},"links":{"citing_paper":"/paper/2411.15338"},"observation_digest":"sha256:d92cbf55174cf6b6c988f45740dd05a32f072217936992af49d14b74acabd69f","observation_id":"3fab91db-e215-456c-a020-483febb94d3e","resolution":{"observed_at":"2026-08-12T14:35:22.516053Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.15338","last_updated":"2024-11-22T20:38:09Z","latest_version":1,"primary_category":"cs.FL","snapshot_observed_at":"2026-08-12T14:22:28.831147Z","submitted_at":"2024-11-22T20:38:09Z","title":"On Computational Completeness of Semi-Conditional Matrix Grammars"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":11},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2411.15338."}