{"as_of":"2026-08-13T03:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cd9d6df3c89ffc33b8713208d65393cf9ea435d1265dad62cd65a3c9754f53cf","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T05:39:00.993191Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T18:17:27.861220Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T05:10:54.652660Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"cited_work":{"arxiv_id":"2509.05211","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.05211","snapshot_observed_at":"2026-07-14T01:20:45.848332Z","title":null,"venue":null,"work_id":"666cbb76-d6a9-475d-8088-573d0fc92a70","year":2025},"citing_paper":{"arxiv_id":"2604.06119","last_updated":"2026-04-07T17:28:23Z","snapshot_observed_at":"2026-07-06T22:54:40.349479Z","submitted_at":"2026-04-07T17:28:23Z","title":"Projections of sets with optimal oracles onto $k$-planes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T18:17:27.861220Z"},"links":{"cited_paper":"/paper/2509.05211","citing_paper":"/paper/2604.06119"},"observation_digest":"sha256:370784e055ff9473843565975e60ab462270f18e4821cf4e573174f800eec51b","observation_id":"b0848f98-80e0-4277-a0e9-552df3925d98","resolution":{"observed_at":"2026-07-14T01:20:45.848332Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2509.05211/citation-record","integrity":"/paper/2509.05211/integrity","json":"/paper/2509.05211/citation-record.json","paper":"/paper/2509.05211"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.06937","last_updated":"2024-11-01T20:53:27Z","snapshot_observed_at":"2026-08-08T15:44:10.100557Z","submitted_at":"2023-05-11T16:14:38Z","title":"Distance sets bounds for polyhedral norms via effective dimension","version":3},"cited_work":{"arxiv_id":"2305.06937","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.06937","snapshot_observed_at":"2026-08-05T05:39:05.179419Z","title":"Distance sets bounds for polyhedral norms via effective dimension","venue":"math.CA","work_id":"4df88b4e-814f-4487-a386-6becbbe0c0fe","year":2023},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T05:38:56.721397Z"},"links":{"cited_paper":"/paper/2305.06937","citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:6a9cc64311cde637c9dc1cfeb1503a80a1ae2972d0200427c0987b8e07b50c7f","observation_id":"0d39dbca-8c69-4aeb-97c6-c0b797a7a5f3","resolution":{"observed_at":"2026-08-05T05:39:05.250439Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-05T05:38:56.857275Z","title":"The discretized sum-product and projection theorems.J","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T05:38:56.857275Z"},"links":{"citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:7d5341254d5579a970077a622b491e8ec8374c1020be4f3a32d8a66688e48a1c","observation_id":"cd76edc2-a874-4416-8f7a-2be041707d6f","resolution":{"observed_at":"2026-08-05T05:38:56.857275Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.16315","last_updated":"2025-03-08T19:09:59Z","snapshot_observed_at":"2026-08-13T00:22:36.892490Z","submitted_at":"2024-04-25T03:45:05Z","title":"Bounds on the dimension of lineal extensions","version":3},"cited_work":{"arxiv_id":"2404.16315","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.16315","snapshot_observed_at":"2026-08-05T05:39:05.028940Z","title":"Bounds on the dimension of lineal extensions","venue":"math.CA","work_id":"d2e8281c-64d5-4411-8b4b-37f6438b6dfa","year":2024},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T05:38:57.027696Z"},"links":{"cited_paper":"/paper/2404.16315","citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:8df39652798e6027a41c3385d135e1c93a697ef7c087867f2266819d5b8b39a0","observation_id":"3d84d584-3a9e-4378-a927-0798894116bf","resolution":{"observed_at":"2026-08-05T05:39:05.097327Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-05T05:38:57.198158Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T05:38:57.198158Z"},"links":{"citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:1c0201edbcc38fcf9c376fe041a342744298fb0b1a839f588afd63dbb49b9977","observation_id":"acb827e6-5a15-4fdb-b32e-73c48c2d892b","resolution":{"observed_at":"2026-08-05T05:38:57.198158Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.04959","last_updated":"2025-09-02T10:30:00Z","snapshot_observed_at":"2026-08-12T22:05:25.257237Z","submitted_at":"2024-11-07T18:37:13Z","title":"Bounding the dimension of exceptional sets for orthogonal projections","version":3},"cited_work":{"arxiv_id":"2411.04959","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.04959","snapshot_observed_at":"2026-08-05T05:39:04.789436Z","title":"Bounding the dimension of exceptional sets for orthogonal projections","venue":"math.CA","work_id":"66eed968-c51f-47b4-88e4-d16dab329b27","year":2024},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T05:38:57.322755Z"},"links":{"cited_paper":"/paper/2411.04959","citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:46cc25f485e9e58da39aabd43295aa30cba1e78448de0fa233a9b509ff9c636a","observation_id":"2e287224-fda0-4620-af1b-c1a029810b5a","resolution":{"observed_at":"2026-08-05T05:39:04.868392Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.18228","last_updated":"2025-09-04T19:18:17Z","snapshot_observed_at":"2026-08-09T13:10:29.317799Z","submitted_at":"2025-08-25T17:24:00Z","title":"Improved bounds for radial projections in the plane","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.18228","snapshot_observed_at":"2026-08-05T05:38:57.399533Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T05:38:57.399533Z"},"links":{"cited_paper":"/paper/2508.18228","citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:fa4e9f486d09f2cce9c50c4ea0b0828e0f15a39ced7f0b076922ca9b06acc0e7","observation_id":"50b4818e-c4e6-4410-9c96-1294026d39bf","resolution":{"observed_at":"2026-08-05T05:38:57.399533Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.11701","last_updated":"2023-09-21T00:58:35Z","snapshot_observed_at":"2026-08-05T13:38:40.119001Z","submitted_at":"2023-09-21T00:58:35Z","title":"Dimension of Pinned Distance Sets for Semi-Regular Sets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.11701","snapshot_observed_at":"2026-08-05T05:38:57.475744Z","title":"Fiedler and D","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T05:38:57.475744Z"},"links":{"cited_paper":"/paper/2309.11701","citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:29a35d019532a87f7190c508a7ee6f4bc494b8dad22e04bcd0a7f44c7c6e097d","observation_id":"648ed0f9-6dbf-4fab-8c13-f1a988d7bfd7","resolution":{"observed_at":"2026-08-05T05:38:57.475744Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.00889","last_updated":"2025-03-28T19:49:17Z","snapshot_observed_at":"2026-08-12T23:09:58.016113Z","submitted_at":"2024-08-01T19:48:07Z","title":"Pinned distances of planar sets with low dimension","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.00889","snapshot_observed_at":"2026-08-05T05:38:57.533107Z","title":"Fiedler and D","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T05:38:57.533107Z"},"links":{"cited_paper":"/paper/2408.00889","citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:70951db1cb9c3a678f12d5c9bf7c05e5bea728baf0b07b0972b793799b453df2","observation_id":"c2881629-06f2-481c-a1fd-35b45813b793","resolution":{"observed_at":"2026-08-05T05:38:57.533107Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.16001","last_updated":"2025-03-23T21:19:17Z","snapshot_observed_at":"2026-08-12T13:36:36.490132Z","submitted_at":"2024-11-24T22:46:59Z","title":"Universal Sets for Projections","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.16001","snapshot_observed_at":"2026-08-05T05:38:57.682445Z","title":"Fiedler and D","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T05:38:57.682445Z"},"links":{"cited_paper":"/paper/2411.16001","citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:36f2fa53a7e62b2882b444e9edbd2e5e26311bb2a9f51183cc8892701ab2a0b3","observation_id":"6161fcd3-8956-44a3-bd1b-28834103a91e","resolution":{"observed_at":"2026-08-05T05:38:57.682445Z","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-05T05:39:06.009226Z","title":"On Hausdorff dimension of projections.Mathematika, 15:153–155, 1968","venue":null,"work_id":"b4e2cd81-0b59-4a8a-a595-c82c2cbce224","year":1968},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T05:38:57.837192Z"},"links":{"citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:58f2f88a567dda792cf3f7e061659800d7a53171048e09a11af33ee147f41c6e","observation_id":"0cf8594f-9099-4335-9f7b-54293a1d86cf","resolution":{"observed_at":"2026-08-05T05:39:06.112010Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-05T05:38:57.941582Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T05:38:57.941582Z"},"links":{"citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:66d974f4b097250c095c6fb76cb34a021efe20817e9670dec76410c4f5ed629b","observation_id":"715c0e51-b072-473d-abec-7ac31f80b2e6","resolution":{"observed_at":"2026-08-05T05:38:57.941582Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:38:58.039132Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T05:38:58.039132Z"},"links":{"citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:7bb57fd095dad1b1e08a63beb6d4f3e63da274a87d8e27f786b5a5ffcdcb52c9","observation_id":"364f7d72-ffd6-4868-ba49-3728e079813e","resolution":{"observed_at":"2026-08-05T05:38:58.039132Z","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-05T05:39:05.789776Z","title":"Lutz and Neil Lutz","venue":null,"work_id":"17c93367-eca0-4d07-8f82-f81c6e7a0533","year":2015},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T05:38:58.167274Z"},"links":{"citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:d17b6112b970205b7d07b7f1f3104e23d854f62947748b2e7fbf46de6bf9c1fa","observation_id":"689feae8-7404-4796-9e8c-0f0a987739d2","resolution":{"observed_at":"2026-08-05T05:39:05.885104Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-05T05:38:58.296249Z","title":"Lutz and Neil Lutz","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T05:38:58.296249Z"},"links":{"citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:6cb03cbf44461ac42d1fa16d74b21d55708b2f6203f6f03f166f4b705c1c0d32","observation_id":"17e55490-9af4-418b-984d-f70f54beb84a","resolution":{"observed_at":"2026-08-05T05:38:58.296249Z","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":"10.1007/s00224-022-10096-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T06:12:12.796739Z","title":"Lutz, Neil Lutz, and Elvira Mayordomo","venue":"Theory of Computing Systems","work_id":"1456f30f-9b2b-4d4a-98f0-af23994eec26","year":2023},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T05:38:58.439532Z"},"links":{"citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:a7ba4da50d34ed26cfabbb626007e4273ca386208d5c86ae55b470d98167a402","observation_id":"804e562e-e7dd-40bb-ad78-f96184c9861e","resolution":{"observed_at":"2026-08-05T05:39:02.617697Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2023.10507","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:39:04.620956Z","title":"Lutz, Neil Lutz, and Elvira Mayordomo","venue":null,"work_id":"4eceb1f1-c9ae-497d-a850-1ac3a869f5ca","year":2023},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T05:38:58.604250Z"},"links":{"citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:2603053ca9fa7adcfa8f08cb65c815fb3e6541a72b2c330eab0f003932a152ec","observation_id":"9e44c749-b5fd-4daf-aa88-e03c726425f3","resolution":{"observed_at":"2026-08-05T05:39:04.683265Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3233/com-210383","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Lutz, Renrui Qi, and Liang Yu","venue":"Computability","work_id":"a08546df-1e4a-408f-8370-5db162e82aa0","year":2024},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T05:38:58.711994Z"},"links":{"citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:9b0ef051f6e56ad31ac9b3e62b39e2e9a5749904f204266d270bb3eb90d94770","observation_id":"60708b12-a5e4-4ca1-aa25-8913d83ce861","resolution":{"observed_at":"2026-08-05T05:39:02.313239Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-05T05:38:58.880168Z","title":"Fractal intersections and products via algorithmic dimension.ACM Transactions on Computation Theory, 13(3), August 2021.doi:10.1145/3460948","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T05:38:58.880168Z"},"links":{"citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:89fd124513d1a9e2ed844a384a5a8e8531d1816680252bb5c2b7c9722d1f0e9d","observation_id":"0e64d985-16c7-4ac9-9e08-9ef317d7b7a0","resolution":{"observed_at":"2026-08-05T05:38:58.880168Z","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":"2507.05475","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:39:04.348885Z","title":"Lineal extensions of Kakeya sets missing every ee-random point, 2025.arXiv:2507.05475","venue":null,"work_id":"b3d8d6fe-5ab0-4e50-baba-9a9be0d5d12a","year":2025},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T05:38:59.026955Z"},"links":{"citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:ab7764c7050225f3b5cbc345544c1a0667f7c045995843d5a2eb67ce86ea5491","observation_id":"0f3359a5-270f-4653-b9d9-6f819bf6e17d","resolution":{"observed_at":"2026-08-05T05:39:04.483024Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2020.10460","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:39:04.111208Z","title":null,"venue":null,"work_id":"3897daec-9bee-4538-9f9c-fc6aff95d78d","year":2020},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T05:38:59.189916Z"},"links":{"citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:8cc61619e9f393eabe0567eef8b7da7028e814e17501ac1bc32d123152f6d5a0","observation_id":"306cec9c-e54c-4e9c-9615-093d29e1de6a","resolution":{"observed_at":"2026-08-05T05:39:04.187444Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-05T05:39:05.552036Z","title":null,"venue":null,"work_id":"b322fa93-09b9-4945-888d-8e9527536bca","year":2022},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T05:38:59.346741Z"},"links":{"citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:2809ac29c7cd26026f4e31bc03bf0b710f4a379dd87a096d919d917b9b57d5ef","observation_id":"23cfda14-177e-4ed6-91db-29b38e5df238","resolution":{"observed_at":"2026-08-05T05:39:05.642678Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2024.10513","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:39:03.900512Z","title":null,"venue":null,"work_id":"cba5cea6-88ac-4bfd-a967-9034fb2ec3b7","year":2024},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T05:38:59.506325Z"},"links":{"citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:25782b7f2966c771ea09dee1e5413338134908f73efc148b91417c95de437124","observation_id":"f5fb4c5f-8df9-470a-a4bd-1ea9be4d3de7","resolution":{"observed_at":"2026-08-05T05:39:03.981557Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-05T05:38:59.632526Z","title":null,"venue":null,"work_id":null,"year":1954},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T05:38:59.632526Z"},"links":{"citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:3e6c2d61f6ca5867322a295473881b80b0ed1bf12144829c24543a772af6ce36","observation_id":"28ffc90a-75ea-4340-b71b-fe448da8f8b5","resolution":{"observed_at":"2026-08-05T05:38:59.632526Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:38:59.753675Z","title":"Cambridge University Press, 1999.doi:10.1017/CBO9780511623813","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T05:38:59.753675Z"},"links":{"citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:45884eb0fcc02063bf596cb37ecff4e69d6f003ccb81bac65ca0e2908f8fc857","observation_id":"3a7242cc-4077-4495-94ba-554293dda728","resolution":{"observed_at":"2026-08-05T05:38:59.753675Z","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":"10.1007/978-3-030-32353-0_6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T06:12:12.796739Z","title":"Hausdorff dimension, projections, intersections, and Besicovitch sets","venue":"Applied and numerical harmonic analysis","work_id":"402b8e5f-ec10-491f-a990-ae0c695fbc5b","year":2019},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T05:38:59.858201Z"},"links":{"citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:78ec588cf76779f59d39ce78cce973d8dab12a00e509b13cc657158a16999681","observation_id":"6ee45b83-3c06-4a9a-9b46-efefb10e5915","resolution":{"observed_at":"2026-08-05T05:39:01.997532Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-05T05:39:00.009549Z","title":"Mayordomo","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T05:39:00.009549Z"},"links":{"citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:42836be9e6a2d09ebc4b160df35ff3e6c9125ad0626343fea69289efe1b72d51","observation_id":"7b19cd67-edb4-47b4-8573-3bdfb88e4bb5","resolution":{"observed_at":"2026-08-05T05:39:00.009549Z","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":"10.1007/978-3-031-95908-0_21","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T06:12:12.796739Z","title":"A point to set principle for finite-state dimension","venue":"Lecture notes in computer science","work_id":"143bfd32-b31e-4614-b39c-eaaddf59e0ca","year":2025},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T05:39:00.132871Z"},"links":{"citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:adcb080429b951e455220ce452a96b2d60eaca11d3198e5aeb7ff83761a1bb1c","observation_id":"d80c4214-6cb9-41f8-8147-c8b2ce371650","resolution":{"observed_at":"2026-08-05T05:39:01.712119Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2502.09995","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:39:03.489292Z","title":"Fractal dimensions and profinite groups, 2025.arXiv:2502.09995","venue":null,"work_id":"a47c34e8-8002-4b90-aa9d-cd77e2900225","year":2025},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T05:39:00.219012Z"},"links":{"citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:822b8abd660a67175f6cbd52a4ed87a969574d92d88c88ee5082e05508141588","observation_id":"cb11fb92-bf32-4554-b670-b8f135de8da1","resolution":{"observed_at":"2026-08-05T05:39:03.696565Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-05T05:39:05.335327Z","title":"Point-to-set principle and constructive dimension faithfulness","venue":null,"work_id":"ceffc6b0-38f8-4387-a4e7-7143516cd70d","year":2024},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T05:39:00.340821Z"},"links":{"citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:d3e579360b4c758b63220e79a94243ad59a24390eeec545d54a60192ef91589e","observation_id":"ad8b148a-d2c1-4f60-beab-95a05ce7a20e","resolution":{"observed_at":"2026-08-05T05:39:05.438176Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.08819","last_updated":"2025-01-19T16:22:27Z","snapshot_observed_at":"2026-08-01T14:26:00.537141Z","submitted_at":"2023-08-17T07:04:25Z","title":"Furstenberg sets estimate in the plane","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.08819","snapshot_observed_at":"2026-08-05T05:39:00.439037Z","title":"Furstenberg sets estimate in the plane, 2023.arXiv:2308.08819","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T05:39:00.439037Z"},"links":{"cited_paper":"/paper/2308.08819","citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:f1c481efeff561e73558c12f6f81660a232d5a43137f7d8c5f3a91a92ac295a8","observation_id":"dbc31ff1-379e-4e3b-b6ca-dca811eacac2","resolution":{"observed_at":"2026-08-05T05:39:00.439037Z","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":"10.1007/978-3-031-36978-0_10","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T06:12:12.796739Z","title":"Inequalities for entropies and dimensions","venue":"Lecture notes in computer science","work_id":"14351126-e943-40de-a4d1-57e62a43c26b","year":2023},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T05:39:00.519731Z"},"links":{"citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:b59899d537ee0fccddcf52bd5f280f0452db804e3fc0dee73e3f667b11464b59","observation_id":"068f2e2d-f2de-4587-ad8b-9cdff5d51d98","resolution":{"observed_at":"2026-08-05T05:39:01.443361Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-05T05:39:00.630191Z","title":"A non-linear version of Bourgain’s projection theorem: Dedicated to the memory of Jean Bourgain","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T05:39:00.630191Z"},"links":{"citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:a29caad8c40cdc24a8387422ab5e93b1dd829128d8df830160a2c471e7f932aa","observation_id":"5b0b48c8-27cd-4e65-bd05-1517484494cc","resolution":{"observed_at":"2026-08-05T05:39:00.630191Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.09044","last_updated":"2024-08-13T03:25:07Z","snapshot_observed_at":"2026-08-12T12:01:45.926819Z","submitted_at":"2021-12-16T17:35:05Z","title":"On the distance sets spanned by sets of dimension $d/2$ in $\\mathbb{R}^d$","version":3},"cited_work":{"arxiv_id":"2112.09044","doi":null,"metadata_source":"pith","pith_arxiv_id":"2112.09044","snapshot_observed_at":"2026-08-05T05:39:03.152644Z","title":"On the distance sets spanned by sets of dimension $d/2$ in $\\mathbb{R}^d$","venue":"math.CA","work_id":"d952c408-ad86-462d-aba2-b36eebe33649","year":2021},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T05:39:00.718756Z"},"links":{"cited_paper":"/paper/2112.09044","citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:6ab11c165466bfc8fe2dd04f1e3806b18683691b8b93cee5e098bf08ce23561b","observation_id":"2b17582c-c3f9-455d-b999-3640221bd817","resolution":{"observed_at":"2026-08-05T05:39:03.283059Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.stacs.2022.57","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:39:01.114822Z","title":null,"venue":null,"work_id":"450510dc-039f-4e25-96ce-f7eec09ba7a5","year":2022},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T05:39:00.782084Z"},"links":{"citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:27cfeb8362c03befb1939f9e01c22ff8c3dfbcfbc7f9456980354bdc1a5e8340","observation_id":"c5cce01d-f9a0-4df3-ad32-6648f11a781e","resolution":{"observed_at":"2026-08-05T05:39:01.200373Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.12501","last_updated":"2022-08-12T20:24:35Z","snapshot_observed_at":"2026-08-04T12:07:00.545861Z","submitted_at":"2022-07-25T20:04:11Z","title":"Pinned Distance Sets Using Effective Dimension","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.12501","snapshot_observed_at":"2026-08-05T05:39:00.848630Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T05:39:00.848630Z"},"links":{"cited_paper":"/paper/2207.12501","citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:25a00e47d474e5d8ed99b4781168500fe4b260770c6fd10f632f97c2b2d9210b","observation_id":"69501a16-36db-4996-989b-b64a4e395891","resolution":{"observed_at":"2026-08-05T05:39:00.848630Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:39:00.926321Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T05:39:00.926321Z"},"links":{"citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:23ecb3635afb45ed96d79c1a1dbeb778332fb435c4beade78f8292443fa4f912","observation_id":"c5b2e548-83a2-4c9f-9734-ae980e9fda72","resolution":{"observed_at":"2026-08-05T05:39:00.926321Z","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":"1997.0034","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:39:02.950587Z","title":"A Kakeya-type problem for circles.American Journal of Mathematics, 119(5):985–1026, 1997","venue":null,"work_id":"26ad734d-4f6d-4f3e-8d8e-23476795c20c","year":1997},"citing_paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T05:39:00.993191Z"},"links":{"citing_paper":"/paper/2509.05211"},"observation_digest":"sha256:a8ee891f455ae932d9e0fc8c1f62ec898776a75d9317c7006be112e0ec2f4fad","observation_id":"9c9ef757-efe6-43f9-a931-637ef3651585","resolution":{"observed_at":"2026-08-05T05:39:03.038360Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.05211","last_updated":"2026-07-11T21:26:56Z","latest_version":2,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-08T15:43:50.123195Z","submitted_at":"2025-09-05T16:12:50Z","title":"Algorithmic Information Bounds for Distances and Orthogonal Projections"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":4,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":17,"verified_exact":13,"verified_fuzzy":0},"total_outbound_references":37},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 1 inbound Pith citation observation for arXiv:2509.05211."}