{"as_of":"2026-08-16T02:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aa946c7b862c6447a00d0e040e3846a1d9a30cb2b7a0bc56d05708760fcc5f2f","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T15:51:54.413460Z","state":"measured"},{"denominator":52,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":52,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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/2509.21074/citation-record","integrity":"/paper/2509.21074/integrity","json":"/paper/2509.21074/citation-record.json","paper":"/paper/2509.21074"},"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-15T15:51:55.209593Z","title":null,"venue":null,"work_id":"0f57c056-9afd-4a61-a4b6-ad218b8a38c5","year":null},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.228186Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:80bc136cc3e15d7cc14eb4e6236bf30165ec0a66a0bb2d909de753efad3aa9ff","observation_id":"f52343b8-4bf3-4d2e-ab3a-13d18547ab4f","resolution":{"observed_at":"2026-08-15T15:51:55.213997Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:55.197990Z","title":null,"venue":null,"work_id":"29ec5e6e-f318-44dd-921a-065574d68524","year":null},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.232602Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:964e34564d1965a811e895e04966e6550106f35d7efa193f9d7cc71b9ca25f08","observation_id":"048d806e-2549-46cd-a965-e9feda382430","resolution":{"observed_at":"2026-08-15T15:51:55.201816Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:55.186912Z","title":"https://github.com/features/ copilot/","venue":null,"work_id":"4b1d1c3b-d70a-43af-b061-f366e0d9e3f0","year":null},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.236310Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:20f21ee86aa2df6eaa3a6cbf2ef2f10f0440fe465f827bd400a4f6990f1f7a61","observation_id":"ea739449-9fb6-4a54-8024-c42caa5d9948","resolution":{"observed_at":"2026-08-15T15:51:55.190731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:55.175164Z","title":"https://github","venue":null,"work_id":"452ed349-94bd-4908-9136-9f7f8a55cd25","year":null},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.240482Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:5cc548f877d01f189ed0da6bec7b9f303f49102b75585a128353ed2b11103504","observation_id":"7510d977-70b9-4f75-ac70-1d95212c4bad","resolution":{"observed_at":"2026-08-15T15:51:55.179427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:55.163729Z","title":null,"venue":null,"work_id":"3c213e8c-b88d-40e8-b3da-a2d470876d3a","year":null},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.244021Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:6c8ec89a211fff20f7855ccb49c8404623e30e5a9fd5bede9d0a8d67b093284a","observation_id":"3c3b3098-8317-4155-b560-d23f1a5e062c","resolution":{"observed_at":"2026-08-15T15:51:55.167746Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:55.152226Z","title":"Abadi, P","venue":null,"work_id":"6b6e1572-ffa9-46d0-885b-b32b72b5fa77","year":2016},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.247569Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:aa3256f6c1d8478aaa0c136e120ca6cf837619ebc52b190b342eec234f0afbc9","observation_id":"e0f5394b-16a4-4a13-8cae-6723a31c5707","resolution":{"observed_at":"2026-08-15T15:51:55.155859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:55.141853Z","title":"Abhashkumar, A","venue":null,"work_id":"4f04a340-13f8-4c98-ac50-c60694fb335c","year":2020},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.251224Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:0911b47ee801e61521f7ac2e5646f60e25446d1ad617c3086f25fe68b296577f","observation_id":"823f4b96-99cb-42b7-9ac8-25a3dcaa2e51","resolution":{"observed_at":"2026-08-15T15:51:55.145240Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:55.130874Z","title":"Abuzaid, S","venue":null,"work_id":"6a165892-f0e3-4df7-9af4-0b6dc95c59c2","year":2021},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.255135Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:f10d590216783cc5067a94fd87ab63008a9ae1b4762c1a2383b5d47277e3f110","observation_id":"31a73642-d7e5-4616-b8b3-0be3e4e47305","resolution":{"observed_at":"2026-08-15T15:51:55.134384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:55.120551Z","title":"Alizadeh, A","venue":null,"work_id":"d01257b1-16e9-466c-b7a1-cd9c773fa669","year":2010},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.258390Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:bb651c569dc55a0f47ff9955de3a1227272115eccb240d546bfbefc88030090e","observation_id":"23c48b26-8142-466f-b9ec-39ea2e68e91e","resolution":{"observed_at":"2026-08-15T15:51:55.123785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:55.109798Z","title":"Beurer-Kellner, M","venue":null,"work_id":"c7c7f243-0e51-4ec8-add9-d7ac240089d4","year":2023},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.261799Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:ed57adc0fab4eb9bf67cd8478654d44024867e40d057c28e07aecd03b7cf008c","observation_id":"980f8da9-928a-487d-9608-89fd8937113e","resolution":{"observed_at":"2026-08-15T15:51:55.113317Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:55.098525Z","title":"Böhm and G","venue":null,"work_id":"4345cb6b-120e-4b10-9c01-2261b1211ee3","year":1966},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.265606Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:b7371940eb6d9c91e49460506bd9f5cbb269ebca60b43de2125f272bf814f22d","observation_id":"f96bbd80-6a33-4d2a-91c3-949661bc3f6f","resolution":{"observed_at":"2026-08-15T15:51:55.102217Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:55.085419Z","title":null,"venue":null,"work_id":"306144f8-6786-48a8-bc2a-983772282236","year":2022},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.269084Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:f855c652cc0afdab151a00683d71ebacce2067bc79b783a357e525a173559415","observation_id":"d1c4a0ad-453c-44c9-9134-28ef434b2c18","resolution":{"observed_at":"2026-08-15T15:51:55.091110Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.12588","last_updated":"2023-10-23T01:27:38Z","snapshot_observed_at":"2026-08-02T13:06:11.850456Z","submitted_at":"2022-11-22T21:06:00Z","title":"Program of Thoughts Prompting: Disentangling Computation from Reasoning for Numerical Reasoning Tasks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.12588","snapshot_observed_at":"2026-08-15T15:51:54.277551Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.277551Z"},"links":{"cited_paper":"/paper/2211.12588","citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:3410b65d192bef6330302343475cb0fcf188675a3f4144a114350e24a51bd698","observation_id":"9b605956-3d6b-4af5-8f6d-cfca34ac4fa6","resolution":{"observed_at":"2026-08-15T15:51:54.277551Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.14323","last_updated":"2023-11-06T11:00:26Z","snapshot_observed_at":"2026-08-13T11:35:16.869290Z","submitted_at":"2023-05-23T17:54:33Z","title":"ChatCoT: Tool-Augmented Chain-of-Thought Reasoning on Chat-based Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.14323","snapshot_observed_at":"2026-08-15T15:51:54.282125Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.282125Z"},"links":{"cited_paper":"/paper/2305.14323","citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:c538a5aa5fa2d3a754322301c435ff60f0a00f5fb6bb9434fa7b2d7e69100fe9","observation_id":"60e3c839-1421-4fff-976b-342237f876c5","resolution":{"observed_at":"2026-08-15T15:51:54.282125Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.01760","last_updated":"2021-06-03T11:29:43Z","snapshot_observed_at":"2026-08-13T19:10:38.352048Z","submitted_at":"2021-06-03T11:29:43Z","title":"Template-Based Named Entity Recognition Using BART","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.01760","snapshot_observed_at":"2026-08-15T15:51:54.285862Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.285862Z"},"links":{"cited_paper":"/paper/2106.01760","citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:40c0006071be925a3fd3890a31e5f04ea8ffd04dfd73c502894e2fad630fc942","observation_id":"dfa8b461-5ec2-477e-936e-64f5ff1f22ee","resolution":{"observed_at":"2026-08-15T15:51:54.285862Z","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-15T15:51:55.066838Z","title":"Devlin, M.-W","venue":null,"work_id":"f4139139-7517-4c48-aae8-b4af190b2363","year":2019},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.289670Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:718edf7bea40c2c84b8dc869a6f8cbef7212feb365887e936974c955d9d652f1","observation_id":"2d769c12-8ecb-4f38-b91e-8c8a77538780","resolution":{"observed_at":"2026-08-15T15:51:55.070990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.00234","last_updated":"2024-10-05T11:47:02Z","snapshot_observed_at":"2026-07-06T14:36:25.690733Z","submitted_at":"2022-12-31T15:57:09Z","title":"A Survey on In-context Learning","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.00234","snapshot_observed_at":"2026-08-15T15:51:54.293161Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.293161Z"},"links":{"cited_paper":"/paper/2301.00234","citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:7ae1f03a1ab3d3a651b2742fdaf5bfb96a071e929d8b0c4c1c30e1562a1a1fa4","observation_id":"72e64ef4-a146-4a19-8651-24c9097aed71","resolution":{"observed_at":"2026-08-15T15:51:54.293161Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.12980","last_updated":"2023-07-24T17:58:06Z","snapshot_observed_at":"2026-08-14T02:16:30.667750Z","submitted_at":"2023-07-24T17:58:06Z","title":"A Systematic Survey of Prompt Engineering on Vision-Language Foundation Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.12980","snapshot_observed_at":"2026-08-15T15:51:54.296951Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.296951Z"},"links":{"cited_paper":"/paper/2307.12980","citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:490f829f0f5edcc4a388a0bcad3e3422678c4b1ed9f96de4ab9fc35cdb2122a7","observation_id":"20a2f262-4252-45f5-97c7-3370d60e49e1","resolution":{"observed_at":"2026-08-15T15:51:54.296951Z","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-15T15:51:55.055421Z","title":"Handigol, B","venue":null,"work_id":"7da7274f-3141-416b-80d0-8a89c0787b13","year":2012},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.301004Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:e3d8a015b2cdba58ce135dd5c593678f19654c4a12cfcae1f0f4ba32d33f5806","observation_id":"4841800a-6c18-4362-8a99-82e0ed74c593","resolution":{"observed_at":"2026-08-15T15:51:55.059021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.09645","last_updated":"2023-10-23T07:51:23Z","snapshot_observed_at":"2026-08-13T11:40:50.394498Z","submitted_at":"2023-05-16T17:45:23Z","title":"StructGPT: A General Framework for Large Language Model to Reason over Structured Data","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.09645","snapshot_observed_at":"2026-08-15T15:51:54.304222Z","title":"Jiang, K","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.304222Z"},"links":{"cited_paper":"/paper/2305.09645","citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:bc1219371cce8a624c455552c4826331f6a8a3bbfd68d2acfd537aaac8851478","observation_id":"f4989152-e7ab-4985-a7a1-541d66e7896b","resolution":{"observed_at":"2026-08-15T15:51:54.304222Z","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-15T15:51:55.044237Z","title":null,"venue":null,"work_id":"1b37893e-0aea-40cb-af10-c5114a9fa98b","year":2020},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.307817Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:0f4e7695b010d5c420e945f0f1de6f9a20ba2e3df7e3eae55ff1fc0cea3722ec","observation_id":"cb5054e8-4bb6-4a7e-878d-c8f52a088d38","resolution":{"observed_at":"2026-08-15T15:51:55.047850Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.08691","last_updated":"2021-09-02T17:34:41Z","snapshot_observed_at":"2026-08-06T15:24:34.790850Z","submitted_at":"2021-04-18T03:19:26Z","title":"The Power of Scale for Parameter-Efficient Prompt Tuning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.08691","snapshot_observed_at":"2026-08-15T15:51:54.311019Z","title":"Lester, R","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.311019Z"},"links":{"cited_paper":"/paper/2104.08691","citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:67a21ea634ca3b44d6195ea2fbdc59f8e344c947fe0038c9e99139acbe5627c9","observation_id":"51c2be6e-0720-43c0-ae77-c85985d54af3","resolution":{"observed_at":"2026-08-15T15:51:54.311019Z","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-15T15:51:55.032804Z","title":null,"venue":null,"work_id":"704e23e2-0709-4913-a090-802fc75a81d7","year":2025},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.314554Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:dc160be51ff3a3c250f6747ff5d8c14a83effc64e8cc2691f75e6b58eefcd668","observation_id":"9c7a39f6-09b3-4503-be58-a855db11ada4","resolution":{"observed_at":"2026-08-15T15:51:55.036817Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:55.021177Z","title":null,"venue":null,"work_id":"160c8783-a71d-412b-91c7-58e67609aa92","year":null},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.317928Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:4770875a3b495f3fc101d0a5cf16b4dc947696ada2cf342f104f55e7c45c7611","observation_id":"75879dbc-298a-4528-918b-c1f2028fcb27","resolution":{"observed_at":"2026-08-15T15:51:55.025059Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.20115","last_updated":"2025-05-24T14:36:15Z","snapshot_observed_at":"2026-08-14T05:28:37.036142Z","submitted_at":"2025-04-28T05:47:37Z","title":"AutoP2C: An LLM-Based Agent Framework for Code Repository Generation from Multimodal Content in Academic Papers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.20115","snapshot_observed_at":"2026-08-15T15:51:54.324681Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.324681Z"},"links":{"cited_paper":"/paper/2504.20115","citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:30e598dea08a0863242deb915dead45e008a91987083e1f18d787206e6f37370","observation_id":"f0d5ace7-d67d-4f45-93ea-4f8815b8b8a1","resolution":{"observed_at":"2026-08-15T15:51:54.324681Z","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-15T15:51:55.005019Z","title":null,"venue":null,"work_id":"7bacfcd2-13ca-40ec-b029-6ebdf0db6de4","year":2025},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.328648Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:a061df6f82bd993c40685ff3cb1b4bcdd2c6dc3a62abce2c41185eacb1f1ea3a","observation_id":"fb486a56-c3c1-4434-803d-3d3bab213354","resolution":{"observed_at":"2026-08-15T15:51:55.009547Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.10698","last_updated":"2023-10-22T10:21:12Z","snapshot_observed_at":"2026-07-06T16:34:08.044974Z","submitted_at":"2023-10-16T05:09:58Z","title":"Bridging Code Semantic and LLMs: Semantic Chain-of-Thought Prompting for Code Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.10698","snapshot_observed_at":"2026-08-15T15:51:54.331836Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.331836Z"},"links":{"cited_paper":"/paper/2310.10698","citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:01ebb2d13358df4c320ce6d01779de2b4a8d679bbd3d543e99105ebd73463750","observation_id":"48f509a2-a8b8-46c4-a5e6-b6c787f66347","resolution":{"observed_at":"2026-08-15T15:51:54.331836Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.01066","last_updated":"2019-09-04T09:33:20Z","snapshot_observed_at":"2026-07-06T08:18:37.267833Z","submitted_at":"2019-09-03T11:11:08Z","title":"Language Models as Knowledge Bases?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.01066","snapshot_observed_at":"2026-08-15T15:51:54.335406Z","title":"Petroni, T","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.335406Z"},"links":{"cited_paper":"/paper/1909.01066","citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:7e32f9e249c5e67c9c492d2f9b450f248a4e16daf4b8bdd1d44c64b0a5ce5f1a","observation_id":"2256d161-69e6-4ca5-b69e-8477774dd4bd","resolution":{"observed_at":"2026-08-15T15:51:54.335406Z","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-15T15:51:54.991312Z","title":"Rahmani, M","venue":null,"work_id":"c2f89115-d956-47a8-a7eb-f5d0fffb3e17","year":2021},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.338834Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:410fa9457519b4b44ad56173bee1ccc900288f6b6b06577f7566109007d8bd06","observation_id":"4fc8b98f-0e8f-4ba7-a066-9cc8f3d40946","resolution":{"observed_at":"2026-08-15T15:51:54.994857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:54.980934Z","title":"Schach.Software Engineering","venue":null,"work_id":"b945bd1f-6804-4f71-adaa-e89c8d95d32b","year":1990},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.342281Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:46b66446df55e283ab6173ceab05e94b9b9457b9b9af6c557deb1078ee9cffa8","observation_id":"2fa17119-daf3-43de-aa47-f0beb6c1275c","resolution":{"observed_at":"2026-08-15T15:51:54.984796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:54.345788Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.345788Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:cd7b36debe2c598956bd21c8a31212f5cb337b33e6be7382705b22a088e22808","observation_id":"6ac5e26d-9e66-4d7c-801c-5f451e2328cf","resolution":{"observed_at":"2026-08-15T15:51:54.345788Z","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-15T15:51:54.970772Z","title":null,"venue":null,"work_id":"dec0ec3b-129b-4adf-a4b7-a3e31962d29b","year":2023},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.349198Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:042ab553749e71733710a16d58c0211096f5ee627872f8a0793e9ee5198ce148","observation_id":"56ae0265-40e4-4a1d-8544-a4f5bf089c11","resolution":{"observed_at":"2026-08-15T15:51:54.974056Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:54.958561Z","title":null,"venue":null,"work_id":"6d7ce388-cec4-436d-9145-072b3b8a9539","year":2025},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.352711Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:35787de104ab74aceb37231ad262a01c4ac9c5dfb8f5b38c8435c06288192ea0","observation_id":"f52384f2-2352-4678-9994-a3ec4368ac1b","resolution":{"observed_at":"2026-08-15T15:51:54.962693Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:54.946574Z","title":null,"venue":null,"work_id":"d3ebf06b-8041-4ec8-8e37-787263401d31","year":2022},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.356935Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:babf61124728f035bb7b9ccc59bbdc4118f778c913b42a2b4d109cce95dc3309","observation_id":"29d74875-064d-4dd0-85a4-48851d3475fa","resolution":{"observed_at":"2026-08-15T15:51:54.950680Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:54.934815Z","title":"Xiang, Y","venue":null,"work_id":"77228d5e-9761-463a-9eb5-b8c80e2ad241","year":2023},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.360664Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:213b40e8530e330c71afd85415455d72c2abbdac93075260d6361ad20e45184e","observation_id":"690cfb6d-4dd8-4642-82e7-b9fc9850cc67","resolution":{"observed_at":"2026-08-15T15:51:54.938743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.00255","last_updated":"2025-08-07T16:31:54Z","snapshot_observed_at":"2026-08-13T18:37:24.477162Z","submitted_at":"2025-03-31T22:02:24Z","title":"SciReplicate-Bench: Benchmarking LLMs in Agent-driven Algorithmic Reproduction from Research Papers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.00255","snapshot_observed_at":"2026-08-15T15:51:54.364104Z","title":"Xiang, H","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.364104Z"},"links":{"cited_paper":"/paper/2504.00255","citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:b2bd92208ced65aa3fcb1fc109225db8fe406b99df66cac9e865e4542d3467c5","observation_id":"08e0c727-a162-402c-a5ae-86f5785f6336","resolution":{"observed_at":"2026-08-15T15:51:54.364104Z","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-15T15:51:54.921674Z","title":"Yan and N","venue":null,"work_id":"7cb5ee3c-9e25-4a7e-aff1-d2fa73b56129","year":2017},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.367845Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:96e2fadf102e7ae37a62adf23526e1010a9413d29f3198590423544e9f03ee3f","observation_id":"74919f71-afcd-4651-972f-6b9cc0a3f1bc","resolution":{"observed_at":"2026-08-15T15:51:54.926186Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:54.910538Z","title":"Yang and S","venue":null,"work_id":"c105a25c-680e-4b63-bb53-0eee2b44374e","year":2016},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.370893Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:3075d621fb86968360db3f415fb723fb8a0c3bcf111d71a30c4ab176c94633bf","observation_id":"b5dde104-f056-4971-a086-0887510436e4","resolution":{"observed_at":"2026-08-15T15:51:54.914365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:54.899088Z","title":null,"venue":null,"work_id":"8b12c3a8-eb88-47f1-bd2d-2c1a0c835599","year":2021},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.373913Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:8177d1adc352e14a1697d585e53faebd95d1ac5cf353a617ef613a2b8872da4d","observation_id":"2729a4ab-0296-4ea9-9ea2-bd5447dcf5ca","resolution":{"observed_at":"2026-08-15T15:51:54.903059Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:54.888135Z","title":"Zhang, J","venue":null,"work_id":"f3cd8397-cb47-484a-9180-8d1fc7afaa25","year":2024},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.376919Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:4d0ab00c3f7d387ec11a80555e6926b505019701d4e702dcf521d3b7d4a6c33a","observation_id":"57d2b905-48ff-4c61-b39a-e06f5193e920","resolution":{"observed_at":"2026-08-15T15:51:54.891823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:54.876593Z","title":"Zhang, D","venue":null,"work_id":"470ec07d-6e86-43b0-bb85-b6a5a145f58a","year":2023},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.379734Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:ab81e3e499fca1624dffc3e74d33b3b78fb6e56048c82dea126b12cc1df3b30c","observation_id":"ca354866-4745-4625-a91c-aff4acfdcfc2","resolution":{"observed_at":"2026-08-15T15:51:54.880991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:54.865050Z","title":"Zhang, X","venue":null,"work_id":"0d7bdfdb-ebb0-4278-b6c5-72c418f2b601","year":2020},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.382928Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:35e8ff905bd588cf13470b3966c00751be6585d798e33f124a2fecd30d9c8733","observation_id":"597c695e-f28c-49c5-9631-ff9996d0c1cb","resolution":{"observed_at":"2026-08-15T15:51:54.869093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.14333","last_updated":"2023-10-23T14:46:07Z","snapshot_observed_at":"2026-08-13T11:35:16.530474Z","submitted_at":"2023-05-23T17:57:59Z","title":"Automatic Model Selection with Large Language Models for Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.14333","snapshot_observed_at":"2026-08-15T15:51:54.386019Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.386019Z"},"links":{"cited_paper":"/paper/2305.14333","citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:3160e35298fb409f426ddde0d2878ff0e141fe8d3746e12ef698b0d5f29e526c","observation_id":"67edb7e2-5e35-4d17-9256-0bdc50fe16cf","resolution":{"observed_at":"2026-08-15T15:51:54.386019Z","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-15T15:51:54.854074Z","title":null,"venue":null,"work_id":"e7af259c-cbae-4f33-82ba-3f06464b8153","year":2023},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.389068Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:fae8dd7d51d14650b17acfeeaf0edb3e0cf890243a5222204b357ec762633295","observation_id":"ee49d9ea-e0e3-461f-b76f-34436453d118","resolution":{"observed_at":"2026-08-15T15:51:54.857853Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:54.842759Z","title":null,"venue":null,"work_id":"baebaf3a-01f2-4c35-bf1b-5ce356739073","year":null},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.392375Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:52094c85252ce0f793e632fbd475214bd369edc6663bfd51ab6a0e173685b6af","observation_id":"61b1d82d-25dd-4971-bc81-289679bc7158","resolution":{"observed_at":"2026-08-15T15:51:54.846556Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:54.831842Z","title":null,"venue":null,"work_id":"c2663f49-f9ff-4ed1-9238-fc0893838f77","year":null},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.395533Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:2f3a77e7e223bac24a5dfbbe37360d1efe5049cd18b4b211450836bce629a4ec","observation_id":"7a99656f-4c45-4918-a334-36dd52c62d29","resolution":{"observed_at":"2026-08-15T15:51:54.835055Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:54.822066Z","title":null,"venue":null,"work_id":"3eb344bc-9842-4402-b3a6-6573d1aeb5ec","year":null},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.399206Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:6876dc847b01151bbc85dffc83c48d3ea95418d4f753c8d3ff55aa91b29205af","observation_id":"60eca9e6-4cb7-49ef-ad54-23cdc368d390","resolution":{"observed_at":"2026-08-15T15:51:54.824893Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:54.812098Z","title":"No odd numbers found","venue":null,"work_id":"2a987321-842a-4320-ad13-14d5968c0c6e","year":null},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.402507Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:8d626670ca8f1bff53590b0f36c2459ca8086ef0d9d9d4eacd2203eb059f7388","observation_id":"f0a37108-edf0-4c1d-a12d-124daa204957","resolution":{"observed_at":"2026-08-15T15:51:54.815392Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:54.799788Z","title":"Iterate over each element in the array numbers: Check if the number is odd (num % 2 != 0)","venue":null,"work_id":"a96e0052-ad29-4d34-95f9-f7de71c8c336","year":null},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.406424Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:fe9cc31473109fe9a077070fc4429496389e1d1e02fe9fcc06f18bfaa06e90e0","observation_id":"7accee83-0812-4058-a2b5-a575b30dc673","resolution":{"observed_at":"2026-08-15T15:51:54.803556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:54.788992Z","title":"Process: Each element of the array is checked for its odd/even property","venue":null,"work_id":"b27de076-eef3-4295-88f2-672b61fb5eb5","year":null},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.410012Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:8d3b715f0ec58957545f145b3037c8f5f6feb6af8783f4d6b2f22a4b36bf7705","observation_id":"084853ec-3885-4eeb-b97a-efc361e92539","resolution":{"observed_at":"2026-08-15T15:51:54.792625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:54.775207Z","title":"The modular design ensures clarity, scalability, and testability, making it suitable for realworld applications","venue":null,"work_id":"61c69639-7095-472d-93f5-8d4fc1985e01","year":null},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.413460Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:0f2f884437e88c2495c09400aa834316fb433dad1d6cc3d3c3dd4476d3c5f863","observation_id":"e2dd8e51-43e5-4e4b-879d-a9984250b735","resolution":{"observed_at":"2026-08-15T15:51:54.781117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-15T15:51:54.321389Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results","version":4},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:54.321389Z"},"links":{"citing_paper":"/paper/2509.21074"},"observation_digest":"sha256:5705e7b9cfcddbb1604aa167855c9ccc72c4f4b3720c98b6cd04899405d5b615","observation_id":"d0f5a66c-1b80-4872-829d-f670b93a7b12","resolution":{"observed_at":"2026-08-15T15:51:54.321389Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.21074","last_updated":"2026-07-09T08:38:10Z","latest_version":4,"primary_category":"cs.NI","snapshot_observed_at":"2026-08-15T15:44:47.787262Z","submitted_at":"2025-09-25T12:24:32Z","title":"RepLLM: Toward Automatically Reproducing Network Research Results"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":30,"verified_exact":0,"verified_fuzzy":22},"total_outbound_references":52},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 0 inbound Pith citation observations for arXiv:2509.21074."}