{"as_of":"2026-08-16T19:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9c84da071fa3c80d60baafff858399e1de160fe8051a00631f08d763d1ba689b","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:22:10.133230Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"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.07363/citation-record","integrity":"/paper/1908.07363/integrity","json":"/paper/1908.07363/citation-record.json","paper":"/paper/1908.07363"},"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-14T12:22:10.608435Z","title":"Science 286(5439), 509–512 (1999)","venue":null,"work_id":"0f152798-0b99-43f9-88fe-3247032244b6","year":1999},"citing_paper":{"arxiv_id":"1908.07363","last_updated":"2019-09-05T20:35:26Z","snapshot_observed_at":"2026-08-16T04:07:13.458825Z","submitted_at":"2019-08-20T14:01:39Z","title":"Node Overlap Removal Algorithms: A Comparative Study","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T12:22:10.041254Z"},"links":{"citing_paper":"/paper/1908.07363"},"observation_digest":"sha256:b1661dc49a6c83c77fa5cc210d07346fe9f187b3c6891176c40560b7fb319d55","observation_id":"9f2de34d-b8f3-46b5-ac24-8b8a2aed79c3","resolution":{"observed_at":"2026-08-14T12:22:10.614304Z","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-14T12:22:10.590056Z","title":"In: Tamassia, R","venue":null,"work_id":"e1301621-c16c-4421-b289-5bab7041b57c","year":2013},"citing_paper":{"arxiv_id":"1908.07363","last_updated":"2019-09-05T20:35:26Z","snapshot_observed_at":"2026-08-16T04:07:13.458825Z","submitted_at":"2019-08-20T14:01:39Z","title":"Node Overlap Removal Algorithms: A Comparative Study","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T12:22:10.047342Z"},"links":{"citing_paper":"/paper/1908.07363"},"observation_digest":"sha256:247dabf6b9ddac536eccacbe3de42c9f6f82ff77a13773c3f0606a0980191992","observation_id":"8f7f7a25-c27a-4b54-9cc8-e0ba3968f7b8","resolution":{"observed_at":"2026-08-14T12:22:10.594944Z","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-14T12:22:10.438744Z","title":"In: International Symposium on Graph Drawing","venue":null,"work_id":"3dad6253-dd68-4992-80ee-ee7893225b79","year":2005},"citing_paper":{"arxiv_id":"1908.07363","last_updated":"2019-09-05T20:35:26Z","snapshot_observed_at":"2026-08-16T04:07:13.458825Z","submitted_at":"2019-08-20T14:01:39Z","title":"Node Overlap Removal Algorithms: A Comparative Study","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T12:22:10.053007Z"},"links":{"citing_paper":"/paper/1908.07363"},"observation_digest":"sha256:fed7eece30556731c6dd691cd35bde670cdb977e96e8113ef0dc7e58008fc481","observation_id":"c1b3746e-ed61-4226-801a-c94e9aa05d78","resolution":{"observed_at":"2026-08-14T12:22:10.445794Z","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-14T12:22:10.418469Z","title":"Publicationes Mathematicae Debrecen6, 290–291 (1959)","venue":null,"work_id":"5fb0b410-4111-4455-ad23-1fd17b92cda7","year":1959},"citing_paper":{"arxiv_id":"1908.07363","last_updated":"2019-09-05T20:35:26Z","snapshot_observed_at":"2026-08-16T04:07:13.458825Z","submitted_at":"2019-08-20T14:01:39Z","title":"Node Overlap Removal Algorithms: A Comparative Study","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T12:22:10.058185Z"},"links":{"citing_paper":"/paper/1908.07363"},"observation_digest":"sha256:566cb35c2930db03fd28a88d6ef9375bbd1dddd051d70e284593d372c8e67fc8","observation_id":"c6db4362-23d7-433f-9dad-9f978fe31640","resolution":{"observed_at":"2026-08-14T12:22:10.424472Z","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-14T12:22:10.395890Z","title":"Journal of Graph Algorithms and Applications14(1), 53–74 (2010)","venue":null,"work_id":"560bee54-ae89-49ee-8e07-897ce1ffb110","year":2010},"citing_paper":{"arxiv_id":"1908.07363","last_updated":"2019-09-05T20:35:26Z","snapshot_observed_at":"2026-08-16T04:07:13.458825Z","submitted_at":"2019-08-20T14:01:39Z","title":"Node Overlap Removal Algorithms: A Comparative Study","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T12:22:10.063777Z"},"links":{"citing_paper":"/paper/1908.07363"},"observation_digest":"sha256:c82c83c3b1024f833d6719fa8870e6770f9dafcfaaa3a9e05388e9eb661cb67d","observation_id":"6c84893a-c27b-4a2a-ad94-5462d1a4a0a4","resolution":{"observed_at":"2026-08-14T12:22:10.403339Z","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-14T12:22:10.378932Z","title":"Software: practice and experience30(11), 1203–1233 (2000)","venue":null,"work_id":"d3373a51-73a0-4b93-9449-b5f506982584","year":2000},"citing_paper":{"arxiv_id":"1908.07363","last_updated":"2019-09-05T20:35:26Z","snapshot_observed_at":"2026-08-16T04:07:13.458825Z","submitted_at":"2019-08-20T14:01:39Z","title":"Node Overlap Removal Algorithms: A Comparative Study","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T12:22:10.069030Z"},"links":{"citing_paper":"/paper/1908.07363"},"observation_digest":"sha256:8e3fd73c25529a0932b71c9311cf9009a43bdbbb1e6e7b735823fabc64f557c0","observation_id":"ff2b0b64-dae1-4c1e-81fa-9b28875d753e","resolution":{"observed_at":"2026-08-14T12:22:10.384100Z","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-14T12:22:10.358105Z","title":"In: Pach, J","venue":null,"work_id":"e7b2ab09-f1be-43ba-bc57-04fd20f19ef9","year":2005},"citing_paper":{"arxiv_id":"1908.07363","last_updated":"2019-09-05T20:35:26Z","snapshot_observed_at":"2026-08-16T04:07:13.458825Z","submitted_at":"2019-08-20T14:01:39Z","title":"Node Overlap Removal Algorithms: A Comparative Study","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T12:22:10.076055Z"},"links":{"citing_paper":"/paper/1908.07363"},"observation_digest":"sha256:71eddf716316d57b7da2af490c9f972fd8a4ff4a5354f37417af1d735dce2179","observation_id":"5f8009bc-157f-4b60-b19a-e9e8b15df40c","resolution":{"observed_at":"2026-08-14T12:22:10.363663Z","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-14T12:22:10.338593Z","title":null,"venue":null,"work_id":"02515d8c-e03f-4bca-89ce-365fc5982eb0","year":1998},"citing_paper":{"arxiv_id":"1908.07363","last_updated":"2019-09-05T20:35:26Z","snapshot_observed_at":"2026-08-16T04:07:13.458825Z","submitted_at":"2019-08-20T14:01:39Z","title":"Node Overlap Removal Algorithms: A Comparative Study","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T12:22:10.081058Z"},"links":{"citing_paper":"/paper/1908.07363"},"observation_digest":"sha256:7f7c373969b04f4a9972f2a6920c13cbd7f6419696db648b2aca06e5859b7160","observation_id":"439f4fd8-ae1b-4a5c-93bb-f187f6f11c30","resolution":{"observed_at":"2026-08-14T12:22:10.345198Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:22:10.088010Z","title":"Mathematica Journal 10(1), 37–71 (2005)","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"1908.07363","last_updated":"2019-09-05T20:35:26Z","snapshot_observed_at":"2026-08-16T04:07:13.458825Z","submitted_at":"2019-08-20T14:01:39Z","title":"Node Overlap Removal Algorithms: A Comparative Study","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T12:22:10.088010Z"},"links":{"citing_paper":"/paper/1908.07363"},"observation_digest":"sha256:887136c463510aa87ba87f2a7d38b99e7785f06a566dd4d990b401bc036dc925","observation_id":"d3afa1bd-6041-4294-8e8d-4805ede14f07","resolution":{"observed_at":"2026-08-14T12:22:10.088010Z","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-14T12:22:10.306715Z","title":"In: Proceedings of the 26th Australasian computer science conference-Volume 16","venue":null,"work_id":"c47aabc8-fca2-4e31-ab9b-f2f5d68b76a4","year":2003},"citing_paper":{"arxiv_id":"1908.07363","last_updated":"2019-09-05T20:35:26Z","snapshot_observed_at":"2026-08-16T04:07:13.458825Z","submitted_at":"2019-08-20T14:01:39Z","title":"Node Overlap Removal Algorithms: A Comparative Study","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T12:22:10.093030Z"},"links":{"citing_paper":"/paper/1908.07363"},"observation_digest":"sha256:87fcd8722d508ebc1642bf8180807dc716deabb057346cc98fedfe4b9e9141c4","observation_id":"937e49de-3954-4a31-8588-d70b85c999b8","resolution":{"observed_at":"2026-08-14T12:22:10.312541Z","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-14T12:22:10.290361Z","title":"Information Sciences177(14), 2821 – 2844 (2007)","venue":null,"work_id":"148c00d9-82fe-4c88-a06e-82fb30947898","year":2007},"citing_paper":{"arxiv_id":"1908.07363","last_updated":"2019-09-05T20:35:26Z","snapshot_observed_at":"2026-08-16T04:07:13.458825Z","submitted_at":"2019-08-20T14:01:39Z","title":"Node Overlap Removal Algorithms: A Comparative Study","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T12:22:10.099195Z"},"links":{"citing_paper":"/paper/1908.07363"},"observation_digest":"sha256:a874049f07b17b11d65912597d4026370ec328a8318f2585cc0b7505449b52fa","observation_id":"a52d747d-d0b1-45c6-b22f-04445978e4ca","resolution":{"observed_at":"2026-08-14T12:22:10.295266Z","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-14T12:22:10.272314Z","title":"In: Proceedings of the 2005 Asia-Pacific Symposium on Information Visualisation - Volume 45","venue":null,"work_id":"4989c43f-80ed-46a1-b7b5-f26d2761c52e","year":2005},"citing_paper":{"arxiv_id":"1908.07363","last_updated":"2019-09-05T20:35:26Z","snapshot_observed_at":"2026-08-16T04:07:13.458825Z","submitted_at":"2019-08-20T14:01:39Z","title":"Node Overlap Removal Algorithms: A Comparative Study","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T12:22:10.104314Z"},"links":{"citing_paper":"/paper/1908.07363"},"observation_digest":"sha256:be2a4abbb2029cdfbf6fb7aea651f54621d0040f54620f43c82ffa38d6d059fe","observation_id":"6a051af0-a4da-4419-8817-6ce104d98cfe","resolution":{"observed_at":"2026-08-14T12:22:10.278233Z","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-14T12:22:10.253905Z","title":"Journal of Graph Algorithms and Applications2(1), 1–24 (1998)","venue":null,"work_id":"8eac2daa-cb1d-4cf3-9937-3733bd7397eb","year":1998},"citing_paper":{"arxiv_id":"1908.07363","last_updated":"2019-09-05T20:35:26Z","snapshot_observed_at":"2026-08-16T04:07:13.458825Z","submitted_at":"2019-08-20T14:01:39Z","title":"Node Overlap Removal Algorithms: A Comparative Study","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T12:22:10.109059Z"},"links":{"citing_paper":"/paper/1908.07363"},"observation_digest":"sha256:97678078d6ba5b672d26a2433f298ffc7815f5d52f8c45fbcdd5537c3ae0e11b","observation_id":"b169b9bd-2abc-42b4-a6ac-c07907ee37a9","resolution":{"observed_at":"2026-08-14T12:22:10.260555Z","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-14T12:22:10.235872Z","title":"Constraints8(2), 143–171 (2003)","venue":null,"work_id":"74eabb29-24a3-4248-86cb-5041a318b17e","year":2003},"citing_paper":{"arxiv_id":"1908.07363","last_updated":"2019-09-05T20:35:26Z","snapshot_observed_at":"2026-08-16T04:07:13.458825Z","submitted_at":"2019-08-20T14:01:39Z","title":"Node Overlap Removal Algorithms: A Comparative Study","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T12:22:10.113987Z"},"links":{"citing_paper":"/paper/1908.07363"},"observation_digest":"sha256:5a99227f378b18cd0891b1de92d6e0dea36bef11ccf6c13c4d414eb9893121bc","observation_id":"2309a18f-2345-48d1-8991-601032d4633e","resolution":{"observed_at":"2026-08-14T12:22:10.240727Z","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-14T12:22:10.219154Z","title":"Journal of Visual Languages & Computing6(2), 183–210 (1995)","venue":null,"work_id":"a05fdbe8-fc11-4c27-9935-8d1bdf5474c5","year":1995},"citing_paper":{"arxiv_id":"1908.07363","last_updated":"2019-09-05T20:35:26Z","snapshot_observed_at":"2026-08-16T04:07:13.458825Z","submitted_at":"2019-08-20T14:01:39Z","title":"Node Overlap Removal Algorithms: A Comparative Study","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T12:22:10.119140Z"},"links":{"citing_paper":"/paper/1908.07363"},"observation_digest":"sha256:8fc295be20f09f4d903678c3298aba9baed5c5b2e9e7dcef03167c3cc5a87aad","observation_id":"c1ddeb48-3fc6-4e44-8184-8292907a3ae4","resolution":{"observed_at":"2026-08-14T12:22:10.224729Z","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-14T12:22:10.202046Z","title":"In: International Symposium on Graph Drawing and Network Visualization","venue":null,"work_id":"79123526-0b48-4e82-a7c2-16d15ca5d367","year":2016},"citing_paper":{"arxiv_id":"1908.07363","last_updated":"2019-09-05T20:35:26Z","snapshot_observed_at":"2026-08-16T04:07:13.458825Z","submitted_at":"2019-08-20T14:01:39Z","title":"Node Overlap Removal Algorithms: A Comparative Study","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T12:22:10.124215Z"},"links":{"citing_paper":"/paper/1908.07363"},"observation_digest":"sha256:7c2c5e787d9b7624d00d5a4beecd013518224c225bdd93cc3fb353fcbd263345","observation_id":"86d1f600-9802-4d39-9eb6-aada44978ad5","resolution":{"observed_at":"2026-08-14T12:22:10.208436Z","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-14T12:22:10.186561Z","title":"Computer Graph- ics Forum31(3), 1135–1144 (2012)","venue":null,"work_id":"94539913-4aae-4e86-b8b8-491c5b80e21a","year":2012},"citing_paper":{"arxiv_id":"1908.07363","last_updated":"2019-09-05T20:35:26Z","snapshot_observed_at":"2026-08-16T04:07:13.458825Z","submitted_at":"2019-08-20T14:01:39Z","title":"Node Overlap Removal Algorithms: A Comparative Study","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T12:22:10.128938Z"},"links":{"citing_paper":"/paper/1908.07363"},"observation_digest":"sha256:6aa748ee751127ffd496a302d7a747ebdfea3de2e183e4a45046d1d620a911ec","observation_id":"ff60466f-917b-4e06-8822-13bfc0c6cf12","resolution":{"observed_at":"2026-08-14T12:22:10.191404Z","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-14T12:22:10.168935Z","title":"Nature 393, 440–442 (1998)","venue":null,"work_id":"25462fe2-f962-4c3c-be77-3ad1b4048b80","year":1998},"citing_paper":{"arxiv_id":"1908.07363","last_updated":"2019-09-05T20:35:26Z","snapshot_observed_at":"2026-08-16T04:07:13.458825Z","submitted_at":"2019-08-20T14:01:39Z","title":"Node Overlap Removal Algorithms: A Comparative Study","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T12:22:10.133230Z"},"links":{"citing_paper":"/paper/1908.07363"},"observation_digest":"sha256:50d3bedd15ee59b188b135a213ca65f52bd2c2921217ecc2057dd762c020f786","observation_id":"ab42f911-e6dc-45f3-bca3-008f65e5c43c","resolution":{"observed_at":"2026-08-14T12:22:10.175103Z","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"}}],"paper":{"arxiv_id":"1908.07363","last_updated":"2019-09-05T20:35:26Z","latest_version":2,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-16T04:07:13.458825Z","submitted_at":"2019-08-20T14:01:39Z","title":"Node Overlap Removal Algorithms: A Comparative Study"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":16},"total_outbound_references":18},"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 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:1908.07363."}