{"as_of":"2026-08-16T10:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e65be823f9a1bdf847a4f6f0628a97dade6a800e91f9704a352307f2e23d3f49","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:19:53.989518Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.03519/citation-record","integrity":"/paper/1908.03519/integrity","json":"/paper/1908.03519/citation-record.json","paper":"/paper/1908.03519"},"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-14T14:19:54.370595Z","title":"Antoniou and W","venue":null,"work_id":"8427e4b2-ca5c-44ce-81a9-6444e72d3354","year":2007},"citing_paper":{"arxiv_id":"1908.03519","last_updated":"2019-08-09T16:19:21Z","snapshot_observed_at":"2026-08-14T14:08:18.135547Z","submitted_at":"2019-08-09T16:19:21Z","title":"Optimizing Consistent Merging and Pruning of Subgraphs in Network Tomography","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:53.888587Z"},"links":{"citing_paper":"/paper/1908.03519"},"observation_digest":"sha256:87323df0dbe3350b47dc2bbc485bcf5168bc0543d5b0b6547ee6c4efbe26395c","observation_id":"a9a5b3c2-e36b-4045-aa35-075d5c928730","resolution":{"observed_at":"2026-08-14T14:19:54.375884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:19:54.351761Z","title":"Battacharaya, N","venue":null,"work_id":"2f794ba6-081f-4306-9631-ead5ce654a4b","year":2019},"citing_paper":{"arxiv_id":"1908.03519","last_updated":"2019-08-09T16:19:21Z","snapshot_observed_at":"2026-08-14T14:08:18.135547Z","submitted_at":"2019-08-09T16:19:21Z","title":"Optimizing Consistent Merging and Pruning of Subgraphs in Network Tomography","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:53.894150Z"},"links":{"citing_paper":"/paper/1908.03519"},"observation_digest":"sha256:bd52e7961352c5c47d838a60139a2f9e397256362c16f26c11a92ee89058500d","observation_id":"068e4bb2-7f6a-4355-bdc2-17d3ce45ee49","resolution":{"observed_at":"2026-08-14T14:19:54.357121Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:19:54.334342Z","title":"Berkolaiko, N","venue":null,"work_id":"9e533958-6d1a-4b6c-a32c-fe841d79d993","year":2018},"citing_paper":{"arxiv_id":"1908.03519","last_updated":"2019-08-09T16:19:21Z","snapshot_observed_at":"2026-08-14T14:08:18.135547Z","submitted_at":"2019-08-09T16:19:21Z","title":"Optimizing Consistent Merging and Pruning of Subgraphs in Network Tomography","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:53.899226Z"},"links":{"citing_paper":"/paper/1908.03519"},"observation_digest":"sha256:e6491af7c61cd05c47d236b90dfd9337467d2677e6a60359e0117a36a8d3c196","observation_id":"8e792636-0069-4dc7-8f3c-5dc6855ea566","resolution":{"observed_at":"2026-08-14T14:19:54.339273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:19:54.317834Z","title":null,"venue":null,"work_id":"723b98d1-252a-4b33-a8f6-c949ca4cb40e","year":2002},"citing_paper":{"arxiv_id":"1908.03519","last_updated":"2019-08-09T16:19:21Z","snapshot_observed_at":"2026-08-14T14:08:18.135547Z","submitted_at":"2019-08-09T16:19:21Z","title":"Optimizing Consistent Merging and Pruning of Subgraphs in Network Tomography","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:53.904682Z"},"links":{"citing_paper":"/paper/1908.03519"},"observation_digest":"sha256:7c576823ea5b0b0e9c429e096da85b12491e3301829292f19ca2da86867d0707","observation_id":"bf0c40dd-a82c-482a-9238-2021f0c99d15","resolution":{"observed_at":"2026-08-14T14:19:54.322827Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:19:54.302581Z","title":"Caceres, N","venue":null,"work_id":"ac5f434b-5e25-4935-a385-a4355e748710","year":1999},"citing_paper":{"arxiv_id":"1908.03519","last_updated":"2019-08-09T16:19:21Z","snapshot_observed_at":"2026-08-14T14:08:18.135547Z","submitted_at":"2019-08-09T16:19:21Z","title":"Optimizing Consistent Merging and Pruning of Subgraphs in Network Tomography","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:53.910354Z"},"links":{"citing_paper":"/paper/1908.03519"},"observation_digest":"sha256:222d16022c6a255400e33f16a0657b7608f12ed4bfae13e0909ee06ae63eaea3","observation_id":"dde50738-f992-49a9-a14f-b880347e4391","resolution":{"observed_at":"2026-08-14T14:19:54.307249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:19:54.286503Z","title":"Caceres, N","venue":null,"work_id":"5533256c-e286-422a-9f40-0bee113b5dc4","year":1999},"citing_paper":{"arxiv_id":"1908.03519","last_updated":"2019-08-09T16:19:21Z","snapshot_observed_at":"2026-08-14T14:08:18.135547Z","submitted_at":"2019-08-09T16:19:21Z","title":"Optimizing Consistent Merging and Pruning of Subgraphs in Network Tomography","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:53.915487Z"},"links":{"citing_paper":"/paper/1908.03519"},"observation_digest":"sha256:185f06c86819c079a7cf137468b01c54cf4b135644eb455df5901a19029d8485","observation_id":"62f0a8e7-38e9-48f8-a466-d06475bf7a47","resolution":{"observed_at":"2026-08-14T14:19:54.291761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:19:54.268517Z","title":null,"venue":null,"work_id":"6a40471d-ecd4-4b11-9cf2-012aa8153d44","year":2013},"citing_paper":{"arxiv_id":"1908.03519","last_updated":"2019-08-09T16:19:21Z","snapshot_observed_at":"2026-08-14T14:08:18.135547Z","submitted_at":"2019-08-09T16:19:21Z","title":"Optimizing Consistent Merging and Pruning of Subgraphs in Network Tomography","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:53.921317Z"},"links":{"citing_paper":"/paper/1908.03519"},"observation_digest":"sha256:1d0e48ab8e250aeb15cfe31b0fa3d8160ca97ddacf8e1e0f6710ee63cf713501","observation_id":"2f3371df-8723-4f08-a5cd-41630c4f70c0","resolution":{"observed_at":"2026-08-14T14:19:54.275214Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:19:54.249234Z","title":"Coates, M","venue":null,"work_id":"9b6a3431-15cd-42b1-9182-dbcba89d38e3","year":2003},"citing_paper":{"arxiv_id":"1908.03519","last_updated":"2019-08-09T16:19:21Z","snapshot_observed_at":"2026-08-14T14:08:18.135547Z","submitted_at":"2019-08-09T16:19:21Z","title":"Optimizing Consistent Merging and Pruning of Subgraphs in Network Tomography","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:53.926659Z"},"links":{"citing_paper":"/paper/1908.03519"},"observation_digest":"sha256:af12c0f24ab7f197858c2987c47ca722816bd94defa7471eac47867d01c8b3e1","observation_id":"fd7629b2-7ac2-4a76-bd57-d9eec47bc32e","resolution":{"observed_at":"2026-08-14T14:19:54.254775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:19:54.231709Z","title":null,"venue":null,"work_id":"c1fcd245-899a-48c3-9acd-e27a3f527c67","year":2002},"citing_paper":{"arxiv_id":"1908.03519","last_updated":"2019-08-09T16:19:21Z","snapshot_observed_at":"2026-08-14T14:08:18.135547Z","submitted_at":"2019-08-09T16:19:21Z","title":"Optimizing Consistent Merging and Pruning of Subgraphs in Network Tomography","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:53.931550Z"},"links":{"citing_paper":"/paper/1908.03519"},"observation_digest":"sha256:182024930ca02aa9bfd3eaae4472fb2f0a2c34c1b94d16dde64a2742e8699820","observation_id":"7428b7d1-643d-47f2-8266-a39c5863b26f","resolution":{"observed_at":"2026-08-14T14:19:54.237596Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:19:54.212905Z","title":null,"venue":null,"work_id":"17bfe228-4cbe-4f05-a418-3f775b4f54d5","year":2000},"citing_paper":{"arxiv_id":"1908.03519","last_updated":"2019-08-09T16:19:21Z","snapshot_observed_at":"2026-08-14T14:08:18.135547Z","submitted_at":"2019-08-09T16:19:21Z","title":"Optimizing Consistent Merging and Pruning of Subgraphs in Network Tomography","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:53.936527Z"},"links":{"citing_paper":"/paper/1908.03519"},"observation_digest":"sha256:839c60c2e5f0b1a9df5f372483c09a996570336170c265f9d9c95de963d6a003","observation_id":"e39dc2ac-0ec8-45d5-a328-1ecd461edf6a","resolution":{"observed_at":"2026-08-14T14:19:54.218848Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:19:54.195722Z","title":null,"venue":null,"work_id":"952dfcb0-e49e-4650-9d61-557d97156f48","year":2001},"citing_paper":{"arxiv_id":"1908.03519","last_updated":"2019-08-09T16:19:21Z","snapshot_observed_at":"2026-08-14T14:08:18.135547Z","submitted_at":"2019-08-09T16:19:21Z","title":"Optimizing Consistent Merging and Pruning of Subgraphs in Network Tomography","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:53.941255Z"},"links":{"citing_paper":"/paper/1908.03519"},"observation_digest":"sha256:1250f945bd453c61f8544f482e365f85e6e44565297dad1ac90fa2fd558b147c","observation_id":"81ba2573-dad3-4265-9ccf-805984b8222e","resolution":{"observed_at":"2026-08-14T14:19:54.200821Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:19:54.177477Z","title":"Horaud and T","venue":null,"work_id":"4adca5ca-a08a-4751-a4b6-f9a3d7d5eb88","year":1989},"citing_paper":{"arxiv_id":"1908.03519","last_updated":"2019-08-09T16:19:21Z","snapshot_observed_at":"2026-08-14T14:08:18.135547Z","submitted_at":"2019-08-09T16:19:21Z","title":"Optimizing Consistent Merging and Pruning of Subgraphs in Network Tomography","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:53.946087Z"},"links":{"citing_paper":"/paper/1908.03519"},"observation_digest":"sha256:f86a4a19360acf7388d83f8e9db9c6dd54f95035c9bf8b4603c07df06d3242b6","observation_id":"7da02527-5694-4337-a868-ff72649ad131","resolution":{"observed_at":"2026-08-14T14:19:54.183232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:19:54.159854Z","title":"Lopresti, N","venue":null,"work_id":"a9c89f74-38bd-4e18-b0db-8da7a6c311f4","year":2002},"citing_paper":{"arxiv_id":"1908.03519","last_updated":"2019-08-09T16:19:21Z","snapshot_observed_at":"2026-08-14T14:08:18.135547Z","submitted_at":"2019-08-09T16:19:21Z","title":"Optimizing Consistent Merging and Pruning of Subgraphs in Network Tomography","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:53.952399Z"},"links":{"citing_paper":"/paper/1908.03519"},"observation_digest":"sha256:7b06483cdfbf0adefb72cde2e62c7326d161160bebb4d80be79b8d534f8bff76","observation_id":"5111bc71-aa0e-43f8-8fa6-92b412bef661","resolution":{"observed_at":"2026-08-14T14:19:54.166159Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:19:54.142702Z","title":null,"venue":null,"work_id":"d69c89ab-fa48-4f03-8410-695ee7af38c8","year":2007},"citing_paper":{"arxiv_id":"1908.03519","last_updated":"2019-08-09T16:19:21Z","snapshot_observed_at":"2026-08-14T14:08:18.135547Z","submitted_at":"2019-08-09T16:19:21Z","title":"Optimizing Consistent Merging and Pruning of Subgraphs in Network Tomography","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:53.957157Z"},"links":{"citing_paper":"/paper/1908.03519"},"observation_digest":"sha256:bc3e01de8aabd5b7b1d43e1c9a55c746658bbe95cb22f8d80ba35be1bfa161c8","observation_id":"b4010903-4872-4f16-8dfb-bb4603ec0b8c","resolution":{"observed_at":"2026-08-14T14:19:54.148652Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:19:54.122198Z","title":null,"venue":null,"work_id":"685067f7-a2f3-4fd2-9fbd-b03bdeea1512","year":1956},"citing_paper":{"arxiv_id":"1908.03519","last_updated":"2019-08-09T16:19:21Z","snapshot_observed_at":"2026-08-14T14:08:18.135547Z","submitted_at":"2019-08-09T16:19:21Z","title":"Optimizing Consistent Merging and Pruning of Subgraphs in Network Tomography","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:53.963003Z"},"links":{"citing_paper":"/paper/1908.03519"},"observation_digest":"sha256:b94fbffecb12e6119befd562415f5cafaa477869eb7c25143c9e4f5c8c18fff9","observation_id":"a4c12744-8e88-43ac-b54e-998cdb7119f6","resolution":{"observed_at":"2026-08-14T14:19:54.128222Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:19:54.105643Z","title":"Rabbat, R","venue":null,"work_id":"16b9028e-27d8-4790-89d3-1c9a4bf52e27","year":2004},"citing_paper":{"arxiv_id":"1908.03519","last_updated":"2019-08-09T16:19:21Z","snapshot_observed_at":"2026-08-14T14:08:18.135547Z","submitted_at":"2019-08-09T16:19:21Z","title":"Optimizing Consistent Merging and Pruning of Subgraphs in Network Tomography","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:53.968360Z"},"links":{"citing_paper":"/paper/1908.03519"},"observation_digest":"sha256:d35c1ec9924efe4f390bfc64c5b713c0d8bbd831f9433cd388fc56969401f8a3","observation_id":"d15fd68f-bbc2-4c2c-bbf4-48af52c51c07","resolution":{"observed_at":"2026-08-14T14:19:54.111042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1806.03542","last_updated":"2019-06-01T19:56:30Z","snapshot_observed_at":"2026-08-14T19:05:42.061545Z","submitted_at":"2018-06-09T21:02:09Z","title":"OCCAM: An Optimization-Based Approach to Network Inference","version":2},"cited_work":{"arxiv_id":"1806.03542","doi":null,"metadata_source":"pith","pith_arxiv_id":"1806.03542","snapshot_observed_at":"2026-08-14T14:19:54.030842Z","title":"OCCAM: An Optimization-Based Approach to Network Inference","venue":"cs.NI","work_id":"efe1f6ee-001f-4133-965b-33d2de17bc28","year":2018},"citing_paper":{"arxiv_id":"1908.03519","last_updated":"2019-08-09T16:19:21Z","snapshot_observed_at":"2026-08-14T14:08:18.135547Z","submitted_at":"2019-08-09T16:19:21Z","title":"Optimizing Consistent Merging and Pruning of Subgraphs in Network Tomography","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:53.972853Z"},"links":{"cited_paper":"/paper/1806.03542","citing_paper":"/paper/1908.03519"},"observation_digest":"sha256:685137c2353efa679e648a7c3ab63d27ab3657eea0967fd2e245433c14df6905","observation_id":"7adef4d9-36c6-491e-a441-76c24bf77341","resolution":{"observed_at":"2026-08-14T14:19:54.039217Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:19:54.088764Z","title":"Sattari, M","venue":null,"work_id":"ac5da50c-eb02-4165-ba51-18a744fab9c0","year":1926},"citing_paper":{"arxiv_id":"1908.03519","last_updated":"2019-08-09T16:19:21Z","snapshot_observed_at":"2026-08-14T14:08:18.135547Z","submitted_at":"2019-08-09T16:19:21Z","title":"Optimizing Consistent Merging and Pruning of Subgraphs in Network Tomography","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:53.978219Z"},"links":{"citing_paper":"/paper/1908.03519"},"observation_digest":"sha256:14aaf79328df627612a35ae3b05c2e9d552f5eff2fd560e8cf348ea4f7d06aa0","observation_id":"75695a1d-0249-456a-87de-f01f10fec45c","resolution":{"observed_at":"2026-08-14T14:19:54.094214Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:19:54.071542Z","title":null,"venue":null,"work_id":"a6fbf6e1-2aa7-4654-bd58-df624b1a20c7","year":1981},"citing_paper":{"arxiv_id":"1908.03519","last_updated":"2019-08-09T16:19:21Z","snapshot_observed_at":"2026-08-14T14:08:18.135547Z","submitted_at":"2019-08-09T16:19:21Z","title":"Optimizing Consistent Merging and Pruning of Subgraphs in Network Tomography","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:53.984102Z"},"links":{"citing_paper":"/paper/1908.03519"},"observation_digest":"sha256:543f4dc76e97f48b38238bfdde5c4a82f8398eb157abdd67024720c01845b55d","observation_id":"9bce567d-8927-4747-94c0-1f2632228be8","resolution":{"observed_at":"2026-08-14T14:19:54.076742Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:19:54.051399Z","title":null,"venue":null,"work_id":"3d3ad5c4-08e1-4f1c-b1d9-f84a8d0b8649","year":1997},"citing_paper":{"arxiv_id":"1908.03519","last_updated":"2019-08-09T16:19:21Z","snapshot_observed_at":"2026-08-14T14:08:18.135547Z","submitted_at":"2019-08-09T16:19:21Z","title":"Optimizing Consistent Merging and Pruning of Subgraphs in Network Tomography","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:53.989518Z"},"links":{"citing_paper":"/paper/1908.03519"},"observation_digest":"sha256:c58bd4bf20c9af0f5d1d5dd5719b20e9972cf11c547856cfdd38fb581f733cc3","observation_id":"25e8e005-b511-4546-8810-f6486bc147f9","resolution":{"observed_at":"2026-08-14T14:19:54.056584Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.03519","last_updated":"2019-08-09T16:19:21Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-14T14:08:18.135547Z","submitted_at":"2019-08-09T16:19:21Z","title":"Optimizing Consistent Merging and Pruning of Subgraphs in Network Tomography"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":1,"verified_fuzzy":10},"total_outbound_references":20},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:1908.03519."}