{"as_of":"2026-08-08T11:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:81d0c2cc306c804771fb4362346c4ea77b464bd0fa4ad6fa9d2d75d7dd8b795d","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-07T12:07:03.700611Z","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-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.00734/citation-record","integrity":"/paper/2506.00734/integrity","json":"/paper/2506.00734/citation-record.json","paper":"/paper/2506.00734"},"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-07T12:07:07.248527Z","title":"Optimization algo rithms for faster computational geometry,","venue":null,"work_id":"1eaa69b3-f356-428f-8bdc-c51fbb29f180","year":2016},"citing_paper":{"arxiv_id":"2506.00734","last_updated":"2025-05-31T22:42:35Z","snapshot_observed_at":"2026-08-07T11:56:52.372390Z","submitted_at":"2025-05-31T22:42:35Z","title":"A Sequential Computation Algorithm for the Center of the Smallest Enclosing Ball","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:01.987564Z"},"links":{"citing_paper":"/paper/2506.00734"},"observation_digest":"sha256:032f9fa9eb4456fbc9ed98b88e5ea549f5ced160e67fa7ee148d2d5c2115f2b6","observation_id":"68345de2-cc67-4660-8812-a03dc22a5d41","resolution":{"observed_at":"2026-08-07T12:07:07.312326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:07.085567Z","title":"An algorithm for computing the capacity of arbitrary discrete memoryless channels,","venue":null,"work_id":"b0aa4952-c014-4dcf-9e4b-39f711a1e984","year":1972},"citing_paper":{"arxiv_id":"2506.00734","last_updated":"2025-05-31T22:42:35Z","snapshot_observed_at":"2026-08-07T11:56:52.372390Z","submitted_at":"2025-05-31T22:42:35Z","title":"A Sequential Computation Algorithm for the Center of the Smallest Enclosing Ball","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:02.063136Z"},"links":{"citing_paper":"/paper/2506.00734"},"observation_digest":"sha256:84118b7485ab62b5594edb1b008c55ac6189c6a11daf9fb4d66ec8b6f6bb9385","observation_id":"3b297df5-48bf-4fa9-80ef-0b7208e84987","resolution":{"observed_at":"2026-08-07T12:07:07.138251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:06.916999Z","title":"Approximate c lustering via core-sets,","venue":null,"work_id":"331fb1a0-0259-47c3-94a4-e7ee96336c7b","year":2002},"citing_paper":{"arxiv_id":"2506.00734","last_updated":"2025-05-31T22:42:35Z","snapshot_observed_at":"2026-08-07T11:56:52.372390Z","submitted_at":"2025-05-31T22:42:35Z","title":"A Sequential Computation Algorithm for the Center of the Smallest Enclosing Ball","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:02.178489Z"},"links":{"citing_paper":"/paper/2506.00734"},"observation_digest":"sha256:866d70a5be98450877c2dcd2e305ff8eae2955ccb19eaececc3cc60dc0d65000","observation_id":"647bdab3-d6c5-4156-802c-5e3803521095","resolution":{"observed_at":"2026-08-07T12:07:06.956612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:06.758262Z","title":"Computation of channel capacity and rate -distortion functions,","venue":null,"work_id":"459b1b5e-e2c2-40a6-825c-9c43e97c9f52","year":1972},"citing_paper":{"arxiv_id":"2506.00734","last_updated":"2025-05-31T22:42:35Z","snapshot_observed_at":"2026-08-07T11:56:52.372390Z","submitted_at":"2025-05-31T22:42:35Z","title":"A Sequential Computation Algorithm for the Center of the Smallest Enclosing Ball","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:02.243277Z"},"links":{"citing_paper":"/paper/2506.00734"},"observation_digest":"sha256:29ba7a1785570ee57b1c1ce1ab567bd3c2e90f650c4577518eefc7be02bc5cd4","observation_id":"c2867f0c-e9ce-461b-a85d-8198b540b3da","resolution":{"observed_at":"2026-08-07T12:07:06.842299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:06.580914Z","title":"Sublinear o ptimization for machine learn- ing,","venue":null,"work_id":"a6bb0025-d14d-4622-a326-1fc811d41683","year":2012},"citing_paper":{"arxiv_id":"2506.00734","last_updated":"2025-05-31T22:42:35Z","snapshot_observed_at":"2026-08-07T11:56:52.372390Z","submitted_at":"2025-05-31T22:42:35Z","title":"A Sequential Computation Algorithm for the Center of the Smallest Enclosing Ball","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:02.298842Z"},"links":{"citing_paper":"/paper/2506.00734"},"observation_digest":"sha256:f686d75434bf2fafdddd104fe0cc2f92a7eb88427b3efa72a6a386a8be6b5c7c","observation_id":"9cee7468-5fa6-4e7f-9b09-2518ae9fb347","resolution":{"observed_at":"2026-08-07T12:07:06.660837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:06.420924Z","title":"Coresets, sparse greedy approximatio n, and the Frank-Wolfe algorithm,","venue":null,"work_id":"8933e03c-01c3-4aca-b902-c75ad940bdd6","year":2010},"citing_paper":{"arxiv_id":"2506.00734","last_updated":"2025-05-31T22:42:35Z","snapshot_observed_at":"2026-08-07T11:56:52.372390Z","submitted_at":"2025-05-31T22:42:35Z","title":"A Sequential Computation Algorithm for the Center of the Smallest Enclosing Ball","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:02.369423Z"},"links":{"citing_paper":"/paper/2506.00734"},"observation_digest":"sha256:aa790b14372d3e7f3390a03170de87240dfc7d9a1469a417802c5a3bb11d5ab4","observation_id":"229418de-b079-413a-a53e-14155e3c6f28","resolution":{"observed_at":"2026-08-07T12:07:06.499552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:06.250891Z","title":"and K¨ orner, J.,Information Theory: Coding Theorems for Discrete Memoryless Systems, Academic Press, Orlando, 1982","venue":null,"work_id":"64addccc-0657-4de4-b1e1-7edbab586277","year":1982},"citing_paper":{"arxiv_id":"2506.00734","last_updated":"2025-05-31T22:42:35Z","snapshot_observed_at":"2026-08-07T11:56:52.372390Z","submitted_at":"2025-05-31T22:42:35Z","title":"A Sequential Computation Algorithm for the Center of the Smallest Enclosing Ball","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:02.470697Z"},"links":{"citing_paper":"/paper/2506.00734"},"observation_digest":"sha256:2c6a1f86f4ccdfd1adc436e52d8818042b9d3537cf1f5b57b70f1dbf61b332b3","observation_id":"a9506677-9783-4dc3-a5e8-ec1c5b6ee411","resolution":{"observed_at":"2026-08-07T12:07:06.350768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:06.011879Z","title":"Information geometry and alternating minimization proce- dures","venue":null,"work_id":"da3b3e7c-5e2c-4526-aeaf-af1a6171f4fa","year":1984},"citing_paper":{"arxiv_id":"2506.00734","last_updated":"2025-05-31T22:42:35Z","snapshot_observed_at":"2026-08-07T11:56:52.372390Z","submitted_at":"2025-05-31T22:42:35Z","title":"A Sequential Computation Algorithm for the Center of the Smallest Enclosing Ball","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:02.552620Z"},"links":{"citing_paper":"/paper/2506.00734"},"observation_digest":"sha256:74f942686f62e75f1a17c871a52992a5570073a4f676d200a937584b28bec6ae","observation_id":"80ced137-24a6-41e4-9a6a-7fc403801c34","resolution":{"observed_at":"2026-08-07T12:07:06.145232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:05.812386Z","title":"Stability yields sublinear time algorithms f or geometric optimization in machine learning,","venue":null,"work_id":"7f9a4681-5116-48bb-b537-970201436c0a","year":2021},"citing_paper":{"arxiv_id":"2506.00734","last_updated":"2025-05-31T22:42:35Z","snapshot_observed_at":"2026-08-07T11:56:52.372390Z","submitted_at":"2025-05-31T22:42:35Z","title":"A Sequential Computation Algorithm for the Center of the Smallest Enclosing Ball","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:02.633657Z"},"links":{"citing_paper":"/paper/2506.00734"},"observation_digest":"sha256:89481fb1cac8bed217b9affca5a49d754dabbd8ef5bf3d2ebd03acd6b7c31208","observation_id":"17b00698-d51d-433b-b55c-0e9671f2e368","resolution":{"observed_at":"2026-08-07T12:07:05.917472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:05.639794Z","title":"Fast smallest- enclosing-ball computation in high dimensions,","venue":null,"work_id":"77e967f7-4370-42fd-b106-e704702b11b9","year":2003},"citing_paper":{"arxiv_id":"2506.00734","last_updated":"2025-05-31T22:42:35Z","snapshot_observed_at":"2026-08-07T11:56:52.372390Z","submitted_at":"2025-05-31T22:42:35Z","title":"A Sequential Computation Algorithm for the Center of the Smallest Enclosing Ball","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:02.723238Z"},"links":{"citing_paper":"/paper/2506.00734"},"observation_digest":"sha256:2b1a51371e3f15dfe09af40cf39450aa461b54fede52280ac68cdf902db42459","observation_id":"c81ab455-8aa5-4730-af5e-2084229370b6","resolution":{"observed_at":"2026-08-07T12:07:05.701553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:05.407428Z","title":"Wiley, New York, 1968","venue":null,"work_id":"988d49c7-ad92-4459-8238-16a086f5bdae","year":1968},"citing_paper":{"arxiv_id":"2506.00734","last_updated":"2025-05-31T22:42:35Z","snapshot_observed_at":"2026-08-07T11:56:52.372390Z","submitted_at":"2025-05-31T22:42:35Z","title":"A Sequential Computation Algorithm for the Center of the Smallest Enclosing Ball","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:02.811614Z"},"links":{"citing_paper":"/paper/2506.00734"},"observation_digest":"sha256:0a85513533c96dc0e18d9bd8e97dd9f2c4c83f6cf4819df03951179f45a3b2ba","observation_id":"9fd4465f-3516-46f7-b2d0-d7181ea24b40","resolution":{"observed_at":"2026-08-07T12:07:05.484290Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:05.089406Z","title":null,"venue":null,"work_id":"e0d334dc-f595-43b4-8f70-ac69e15e4a2c","year":1985},"citing_paper":{"arxiv_id":"2506.00734","last_updated":"2025-05-31T22:42:35Z","snapshot_observed_at":"2026-08-07T11:56:52.372390Z","submitted_at":"2025-05-31T22:42:35Z","title":"A Sequential Computation Algorithm for the Center of the Smallest Enclosing Ball","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:02.947343Z"},"links":{"citing_paper":"/paper/2506.00734"},"observation_digest":"sha256:0ac5dd4379e965637083ce1be31a9dd5cde1cc502ae226ecfc85d4fc76042b57","observation_id":"d177be13-bc16-430a-bf9b-8539a72b9504","resolution":{"observed_at":"2026-08-07T12:07:05.244967Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:04.774159Z","title":"Mineola, New York, 2003","venue":null,"work_id":"ebcd8b67-4a1f-41f2-934a-10ba04982dc9","year":2003},"citing_paper":{"arxiv_id":"2506.00734","last_updated":"2025-05-31T22:42:35Z","snapshot_observed_at":"2026-08-07T11:56:52.372390Z","submitted_at":"2025-05-31T22:42:35Z","title":"A Sequential Computation Algorithm for the Center of the Smallest Enclosing Ball","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:03.056229Z"},"links":{"citing_paper":"/paper/2506.00734"},"observation_digest":"sha256:de0ad61279cfadcc424a714f22e0c33ef92e679c9b69d7039221b6a96e1ec780","observation_id":"41e80b5f-d7bf-4120-8294-fc76e52e69bc","resolution":{"observed_at":"2026-08-07T12:07:04.940942Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:04.673039Z","title":"Appro ximate minimum enclosing balls in high dimensions using core-Sets,","venue":null,"work_id":"5d157aaf-55b8-4c19-a0ea-858d0bbec477","year":2003},"citing_paper":{"arxiv_id":"2506.00734","last_updated":"2025-05-31T22:42:35Z","snapshot_observed_at":"2026-08-07T11:56:52.372390Z","submitted_at":"2025-05-31T22:42:35Z","title":"A Sequential Computation Algorithm for the Center of the Smallest Enclosing Ball","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:03.152995Z"},"links":{"citing_paper":"/paper/2506.00734"},"observation_digest":"sha256:27cf620f6041db4142127bc2daf100547d6d31989664b50f5fe892b37bab8ea2","observation_id":"7a9eba72-a031-4366-9b34-bc0226cdfe9e","resolution":{"observed_at":"2026-08-07T12:07:04.714887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:04.543337Z","title":"On the search algo rithm for the output distri- bution that achieves the channel capacity,","venue":null,"work_id":"e02790cb-a91d-492a-b9c7-6fec3a25a45c","year":2017},"citing_paper":{"arxiv_id":"2506.00734","last_updated":"2025-05-31T22:42:35Z","snapshot_observed_at":"2026-08-07T11:56:52.372390Z","submitted_at":"2025-05-31T22:42:35Z","title":"A Sequential Computation Algorithm for the Center of the Smallest Enclosing Ball","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:03.217130Z"},"links":{"citing_paper":"/paper/2506.00734"},"observation_digest":"sha256:0f87659d2cac8bf131e81b3705e8cd01bd55cd82f9efa5c2f28ffc435ae93f7f","observation_id":"738b9c0f-331c-424d-8868-766ccda5c4a6","resolution":{"observed_at":"2026-08-07T12:07:04.593676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"cs/0407020","last_updated":"2004-07-08T19:03:32Z","snapshot_observed_at":"2026-07-07T03:05:55.751870Z","submitted_at":"2004-07-08T19:03:32Z","title":"Minimum Enclosing Polytope in High Dimensions","version":1},"cited_work":{"arxiv_id":"cs/0407020","doi":null,"metadata_source":"pith","pith_arxiv_id":"cs/0407020","snapshot_observed_at":"2026-08-07T12:07:03.836283Z","title":"Minimum Enclosing Polytope in High Dimensions","venue":"cs.CG","work_id":"0bcf59bf-5b61-4976-bd81-8b981ca55733","year":2004},"citing_paper":{"arxiv_id":"2506.00734","last_updated":"2025-05-31T22:42:35Z","snapshot_observed_at":"2026-08-07T11:56:52.372390Z","submitted_at":"2025-05-31T22:42:35Z","title":"A Sequential Computation Algorithm for the Center of the Smallest Enclosing Ball","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:03.322079Z"},"links":{"cited_paper":"/paper/cs/0407020","citing_paper":"/paper/2506.00734"},"observation_digest":"sha256:386a7882a65884ba869a9f105b492044d4c08271ed501bbbbe7de93e7f3b560c","observation_id":"3a5ffdc7-c633-42a1-aa9f-20cb059ea577","resolution":{"observed_at":"2026-08-07T12:07:03.879646Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:04.402547Z","title":"Quadratic Programming in Geometric O ptimization: Theory, Imple- mentation, and Applications,","venue":null,"work_id":"17ba6fb5-0696-4f6f-a194-bae939d3adbd","year":null},"citing_paper":{"arxiv_id":"2506.00734","last_updated":"2025-05-31T22:42:35Z","snapshot_observed_at":"2026-08-07T11:56:52.372390Z","submitted_at":"2025-05-31T22:42:35Z","title":"A Sequential Computation Algorithm for the Center of the Smallest Enclosing Ball","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:03.423844Z"},"links":{"citing_paper":"/paper/2506.00734"},"observation_digest":"sha256:43249f0419476b93aea40307aed3cdb55328856e85d25a5281f10e5f930d5816","observation_id":"b12f6968-00e2-4876-8c24-0a0e73557d85","resolution":{"observed_at":"2026-08-07T12:07:04.468872Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:04.254350Z","title":"Support vector data desc ription,","venue":null,"work_id":"50a41ab6-9fd4-439a-8f60-0075e87f7061","year":2004},"citing_paper":{"arxiv_id":"2506.00734","last_updated":"2025-05-31T22:42:35Z","snapshot_observed_at":"2026-08-07T11:56:52.372390Z","submitted_at":"2025-05-31T22:42:35Z","title":"A Sequential Computation Algorithm for the Center of the Smallest Enclosing Ball","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:03.494561Z"},"links":{"citing_paper":"/paper/2506.00734"},"observation_digest":"sha256:52dcd34e3d0a8f005a96aba65ebdad301b88264ae0e0b65636ff80e5ee32dacb","observation_id":"245e0a49-3f31-4b13-bd85-046590ffdf61","resolution":{"observed_at":"2026-08-07T12:07:04.307339Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:04.119160Z","title":"Two algorithms for the minimum enclos ing ball problem,","venue":null,"work_id":"25d4577f-f417-4346-ab07-888f6636e6f6","year":2008},"citing_paper":{"arxiv_id":"2506.00734","last_updated":"2025-05-31T22:42:35Z","snapshot_observed_at":"2026-08-07T11:56:52.372390Z","submitted_at":"2025-05-31T22:42:35Z","title":"A Sequential Computation Algorithm for the Center of the Smallest Enclosing Ball","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:03.578066Z"},"links":{"citing_paper":"/paper/2506.00734"},"observation_digest":"sha256:bbf70aa31d10b254e3ce461601c59eba953b98034fd1a9efcf7d4fcdd0ca25f9","observation_id":"636181c8-f624-419c-a25d-6da32b9f89ee","resolution":{"observed_at":"2026-08-07T12:07:04.162475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:07:03.979363Z","title":"Smallest enclosing disks (balls and ellips oids),","venue":null,"work_id":"4944e26f-7601-4fa1-b048-d5f35cf6fab5","year":1991},"citing_paper":{"arxiv_id":"2506.00734","last_updated":"2025-05-31T22:42:35Z","snapshot_observed_at":"2026-08-07T11:56:52.372390Z","submitted_at":"2025-05-31T22:42:35Z","title":"A Sequential Computation Algorithm for the Center of the Smallest Enclosing Ball","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T12:07:03.700611Z"},"links":{"citing_paper":"/paper/2506.00734"},"observation_digest":"sha256:6103d7c5fe16bc756667be3a90153f5d43761c33904f5d48b16949a1f9519949","observation_id":"2a6c30b8-1f64-407f-b889-3e77d2b4e550","resolution":{"observed_at":"2026-08-07T12:07:04.025370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.00734","last_updated":"2025-05-31T22:42:35Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-07T11:56:52.372390Z","submitted_at":"2025-05-31T22:42:35Z","title":"A Sequential Computation Algorithm for the Center of the Smallest Enclosing Ball"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":1,"verified_fuzzy":18},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2506.00734."}