{"as_of":"2026-08-21T01:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:469fff8dad2afa107a5b5314c69bd10130c9d50d33f66f949dd0601179732278","coverage":[{"denominator":51,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":51,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T22:25:23.138275Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2502.04581/citation-record","integrity":"/paper/2502.04581/integrity","json":"/paper/2502.04581/citation-record.json","paper":"/paper/2502.04581"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:25:22.968015Z","title":"Fine-grained complexity of analyzing compressed data: Quantifying improvements over decompress-and-solve","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:22.968015Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:fd47bc7d2f81891005e4d6620b934ef530d6f5859cbcecb754b26889305e8f91","observation_id":"a6b626a7-18b8-436a-aafb-3e5b24d5ef77","resolution":{"observed_at":"2026-08-08T22:25:22.968015Z","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-08T22:25:25.509797Z","title":"Impossibility results for grammar-compressed linear algebra","venue":null,"work_id":"36241431-db72-464f-b32e-909316f85e64","year":2020},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:22.972304Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:f354b84cc7c493b5878bc917b221721e50213c0749f3c12e4d2e2e903c315825","observation_id":"7e7fff81-d049-42b6-bcfc-13b3fb69ce0e","resolution":{"observed_at":"2026-08-08T22:25:25.512705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T22:25:22.979837Z","title":"Exact weight subgraphs and the k-sum conjecture","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:22.979837Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:ea148b49c94d83c75c5bc9c3f1aa24f36a5c6c4e1e23ec15d6c307992c46738c","observation_id":"1ef8b476-28de-4212-a4c2-0d511ba6682e","resolution":{"observed_at":"2026-08-08T22:25:22.979837Z","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-08T22:25:22.983676Z","title":"Losing weight by gaining edges","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:22.983676Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:dd7daa356b471cc0f7f229deb45f05e666a4c8c16ab6183c39b7e14724d5cd98","observation_id":"6c0c50d4-2c86-4c14-995f-61eeb4419352","resolution":{"observed_at":"2026-08-08T22:25:22.983676Z","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-08T22:25:22.987640Z","title":"Popular conjectures imply strong lower bounds for dynamic problems","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:22.987640Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:cc9617ce27a6c5d5dde74c91fd0e3e466eb0baf9f1030d35079ae8497c038989","observation_id":"b121eb36-1b08-41ce-9837-32b85b09e9a0","resolution":{"observed_at":"2026-08-08T22:25:22.987640Z","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/s00453-022-01014-x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T00:03:40.895421Z","title":"The fine-grained complexity of multi-dimensional ordering properties","venue":"Algorithmica","work_id":"6001bc4a-3e55-4744-b1d5-5656725f689f","year":2022},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:22.991471Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:d04208513fe14cf4933ca47a50d060e173b08de214b70ffc7dcba8148929b237","observation_id":"45ed8c60-b59a-4b63-8abc-c76c6e6300c7","resolution":{"observed_at":"2026-08-08T22:25:23.387656Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T22:25:25.498868Z","title":"State-based accelerations and bidirectional search for bi-objective multi-modal shortest paths","venue":null,"work_id":"693f10f8-9212-4aa1-974b-71bea55d7275","year":2013},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:22.994901Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:1b0e2a8097f62df814552a174d5a48ee71fa1e70d97539df9f976c758c62a80d","observation_id":"b2cb7c5c-07c8-447a-8fc7-897e4c4ba083","resolution":{"observed_at":"2026-08-08T22:25:25.502650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611974782.145","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Better approximations for tree sparsity in nearly-linear time","venue":null,"work_id":"6ec34a69-5332-4f67-b55e-75c3500f89fc","year":2017},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:22.998161Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:01109cdbdce230cdd807e5fd8eedeafabe368bad22d68acdb1e546a6c0f94b35","observation_id":"521e88f0-4bb7-43ec-85c4-54222ea20607","resolution":{"observed_at":"2026-08-08T22:25:23.376817Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T22:25:25.488778Z","title":"How hard are n 2-hard problems? ACM SIGACT News , 25(2):83--85, 1994","venue":null,"work_id":"ef1feb35-bcf4-4ed5-8ffb-541c42812c04","year":1994},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.001563Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:63c27f8dfc668e3396f7d660d38cf4f0b4afc88575be694e40a79e90110dbe47","observation_id":"875a77af-c9d8-4b3d-b650-c35b5b69e615","resolution":{"observed_at":"2026-08-08T22:25:25.492365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/pl00009366","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Voronoi diagrams in higher dimensions under certain polyhedral distance functions","venue":"Discrete & Computational Geometry","work_id":"f341673a-1064-4439-91e4-9072e27408cb","year":1998},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.004917Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:d1397690970bbfe483c25712cf63eb633c7dd24c5391a6680531fa1b7a8d6671","observation_id":"877c47c5-acac-4567-9ab4-1a0251c8d62a","resolution":{"observed_at":"2026-08-08T22:25:23.366064Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.approx/random.2021.9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Fine-grained completeness for optimization in P","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"a7bf8676-4039-4d8a-995f-d9f4894ce411","year":2021},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.008516Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:14879743ded1e56ecd3b30154011cc9f230301e2fb2009ce894c7b0c40bb8b61","observation_id":"6da78f64-6b27-4fb0-93fb-f25094d8b832","resolution":{"observed_at":"2026-08-08T22:25:25.482263Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T22:25:23.011913Z","title":"A structural investigation of the approximability of polynomial-time problems","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.011913Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:16ecd88dbac12744ea17d833db5810f9c5944bdca3d89a4dc684dd92d6b006b7","observation_id":"2b5ce512-09ee-4db1-94c2-3dc34cf8cbb0","resolution":{"observed_at":"2026-08-08T22:25:23.011913Z","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-08T22:25:23.015120Z","title":"A fine-grained analogue of schaefer's theorem in P: dichotomy of exists \\^ k-forall-quantified first-order graph properties","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.015120Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:4f8deac3e39d533f0e937904aeb9c52a3b0f5b07687feebd188a7ab2fe7876fd","observation_id":"942e60de-02c5-40a4-a7a6-b8cd0e4db847","resolution":{"observed_at":"2026-08-08T22:25:23.015120Z","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":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:25:25.228966Z","title":"Sparse nonnegative convolution is equivalent to dense nonnegative convolution","venue":null,"work_id":"c8d14da3-b264-4340-a959-385e5884bc1b","year":2021},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.017818Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:8983c3d54e19461ab3d112e4d10709cbbe44ae6d27fb54ec28e1f63d08a81be6","observation_id":"4ab9be26-4c07-479a-8611-81acbf8e0a30","resolution":{"observed_at":"2026-08-08T22:25:25.232639Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T22:25:23.020647Z","title":"Deterministic and las vegas algorithms for sparse nonnegative convolution","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.020647Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:707cf8c8a1199fd1cc7e5db2182f43b57c5ef8f46928cb6e1c1b5edcaeacad4a","observation_id":"06ee28cd-ed41-4d0a-9c5b-922226de03b9","resolution":{"observed_at":"2026-08-08T22:25:23.020647Z","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-08T22:25:23.023538Z","title":"Fast n-fold boolean convolution via additive combinatorics","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.023538Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:47bfdc2080f7755c091b0170beafb53b8457100dd25f722bb5f75763da885b38","observation_id":"e2f3d11e-57d7-479c-975c-842394824d22","resolution":{"observed_at":"2026-08-08T22:25:23.023538Z","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.4230/lipics.socg.2021.18","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:25:23.328020Z","title":"Translating hausdorff is hard: Fine-grained lower bounds for hausdorff distance under translation","venue":null,"work_id":"14a12a8e-d46a-403b-a316-cbe7651db3ce","year":2021},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.026313Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:6d5dd4f4dc63b207fe6122d5a3d263a10a290fd20e976ff03f39848043be1c09","observation_id":"bdd6d25b-e04e-4afb-8272-b219a98a2972","resolution":{"observed_at":"2026-08-08T22:25:23.330948Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.socg.2023.24","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"arXiv (Cornell University)","work_id":"7a4572e8-9293-42de-b362-ed6d71751641","year":2023},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.029053Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:6c4fb89d9a527bc9666fbb3f9e87f8cdf795a6a650ae3d585ea278562c3d8474","observation_id":"63422ca9-3b59-42a2-a3a0-063dc0da5ac2","resolution":{"observed_at":"2026-08-08T22:25:23.321558Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:25:25.056769Z","title":"Chan and Moshe Lewenstein","venue":null,"work_id":"3d42f2d3-ca04-4f99-82f2-0fe1c8ac8505","year":2015},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.032048Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:f5856d95af8da36e099f3305fb2de0fc1ea11b4fbb612cbc044cb8ceb02f57ff","observation_id":"a32ee94c-9ab5-4770-9aba-ca6a62a0a5d9","resolution":{"observed_at":"2026-08-08T22:25:25.062639Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:25:25.397080Z","title":"Chan, Virginia Vassilevska Williams, and Yinzhan Xu","venue":null,"work_id":"218b51d5-148d-413e-bca6-71c8f71b1337","year":2022},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.034657Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:73064ff6fe67e572b941bcc5cfdd85b1edc93b51f37720e146c2b3b07bb9f987","observation_id":"ec223b8e-887f-4aae-80d6-bbfa0149240a","resolution":{"observed_at":"2026-08-08T22:25:25.402580Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:25:24.874309Z","title":"Chan, Virginia Vassilevska Williams, and Yinzhan Xu","venue":null,"work_id":"d3013df7-2fc6-44ef-b717-35538f45b6d1","year":2023},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.037275Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:43cf151bf5a051b11e41b4309245e151a30be399583742fa043008c76b6d92d7","observation_id":"e0d956c5-7622-4993-9464-9ba4d36b48d1","resolution":{"observed_at":"2026-08-08T22:25:24.877913Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/pl00009420","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Paul Chew, Dorit Dor, Alon Efrat, and Klara Kedem","venue":"Discrete & Computational Geometry","work_id":"0c2beff3-0232-4536-b95b-cc6e266d1eb6","year":1999},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.039916Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:71ba26f35d10ed26f79783eb25855591e0f6b96293c485a6e464e855206d0633","observation_id":"ad318539-cf67-4a2c-8020-60427dc9a569","resolution":{"observed_at":"2026-08-08T22:25:23.311905Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T22:25:25.467360Z","title":"Improvements on geometric pattern matching problems","venue":null,"work_id":"7ab9f7df-773b-4631-82ba-47ee64cf9678","year":1992},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.043191Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:e77c8569c78812634f15e7f07390d3cc924a98888f93aa0427c8bc94920228dc","observation_id":"1133e3bc-ab07-4779-bd42-40153eef0481","resolution":{"observed_at":"2026-08-08T22:25:25.471099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-55706-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T00:03:40.895421Z","title":"Paul Chew and Klara Kedem","venue":"Lecture notes in computer science","work_id":"6a995a58-d25f-4cfe-ba13-17db064779e7","year":1992},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.046352Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:cfa17fe03372f8a1a9a29f539392ced6f495ca06b8bcba1e01deaf08006ffc09","observation_id":"f272a9ab-13e0-4b9b-aa72-0b60685507b3","resolution":{"observed_at":"2026-08-08T22:25:23.301465Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:25:24.684347Z","title":"Verifying candidate matches in sparse and wildcard matching","venue":null,"work_id":"9b7e6001-e1f1-49ce-85f4-888750120bfa","year":2002},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.049630Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:a1d421858e28e97b4d8231b8929da05a34e10f2bd3f85bd83899aba9a94eb014","observation_id":"2e93e6b2-1ccc-478d-858c-9b1fcb6b354d","resolution":{"observed_at":"2026-08-08T22:25:24.690408Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3293465","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"On problems equivalent to (min, +)-convolution","venue":"ACM Transactions on Algorithms","work_id":"675ced81-590e-4cc8-97a4-d0199fd040ae","year":2019},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.052858Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:e38c2f55c9611960165030aecb56777e1af3a72af33e4a293ff270822a51dd51","observation_id":"afd4abc5-016f-4566-ad17-d8bc7df5bcd3","resolution":{"observed_at":"2026-08-08T22:25:23.291327Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icalp.2019.113","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Counting answers to existential questions","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"56aa06cc-9b66-41ac-8afe-81512b525ed7","year":2019},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.057359Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:73adad55a60c576e5353325dc401580784bc624d903ee0d38c3938d452a4ac86","observation_id":"0de7a276-1933-420e-936d-91795b8b5b7e","resolution":{"observed_at":"2026-08-08T22:25:23.281181Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:25:24.502580Z","title":"All non-trivial variants of 3-ldt are equivalent","venue":null,"work_id":"c162bd89-24ab-4bb6-8370-76ded0b137ad","year":2020},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.060757Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:d522305c0320779b671003d2951758f3653564e4bee343268d9e6b5e7ccc0315","observation_id":"b1f9c5c4-3659-4417-808f-9eb45ec44d92","resolution":{"observed_at":"2026-08-08T22:25:24.505615Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T22:25:25.456827Z","title":"A survey and annotated bibliography of multiobjective combinatorial optimization","venue":null,"work_id":"fe71301a-bc75-4334-ae42-fc17a65ff22e","year":2000},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.064084Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:a3a54be26815c35e08f315cd4cbd78ba24a121ecf0cf043f02b79cfb51186ce3","observation_id":"daeb6d2c-2ed4-4385-be1d-e8893c1ace85","resolution":{"observed_at":"2026-08-08T22:25:25.460522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0097539797315410","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"New lower bounds for convex hull problems in odd dimensions","venue":"SIAM Journal on Computing","work_id":"45741fdd-06e3-4236-86df-63260096fe86","year":1999},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.067409Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:65ac88654574f5ed21a2834adaca4fc8d21c4b6747343a892e216588f3cc60ce","observation_id":"19bfac0d-3c1a-4011-8d41-a9e2a1ca79fc","resolution":{"observed_at":"2026-08-08T22:25:23.270616Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611977912.168","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"The effect of sparsity on k-dominating set and related first-order graph properties","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"16d79ba1-675a-4151-889c-8b1d0f473bab","year":2024},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.070857Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:b730218175b54514b2bd05948fa5b70f9cd96cd2cd12192a0cb93ef0d942d0ef","observation_id":"ef8078e0-f994-415b-953f-5046547515bc","resolution":{"observed_at":"2026-08-08T22:25:23.259912Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.10232","last_updated":"2024-09-16T12:31:11Z","snapshot_observed_at":"2026-08-16T13:18:12.711131Z","submitted_at":"2024-09-16T12:31:11Z","title":"Pareto Sums of Pareto Sets: Lower Bounds and Algorithms","version":1},"cited_work":{"arxiv_id":"2409.10232","doi":"10.48550/arxiv.2409.10232","metadata_source":"pith","pith_arxiv_id":"2409.10232","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Pareto Sums of Pareto Sets: Lower Bounds and Algorithms","venue":"cs.DS","work_id":"5ec7f269-419e-4cf0-8ccb-d33a122b00a4","year":2024},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.074145Z"},"links":{"cited_paper":"/paper/2409.10232","citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:399584ffe49661dd425b768199c9875a703f0536050f83f8e92b6ff079c155eb","observation_id":"a98e506b-63a4-493e-b680-c8908a379249","resolution":{"observed_at":"2026-08-08T22:25:23.248959Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:25:24.315743Z","title":"Gabow, Jon Louis Bentley, and Robert Endre Tarjan","venue":null,"work_id":"c4de487f-c58f-4265-85c2-9bc6f3b9736e","year":1984},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.078056Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:2e573b1dc5b78a8e6385512d274aa418a03233feef3f24bcc382fba9efc1bd9c","observation_id":"92158010-c89c-40de-9601-42fdbb0c0674","resolution":{"observed_at":"2026-08-08T22:25:24.321209Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T22:25:23.081224Z","title":"Overmars","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.081224Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:b700057c85587a94e692e40c3a9e5c8c655ab4835dcc9b90d20fe59a4d5821e1","observation_id":"2f19196a-cef4-4a3f-8a32-725f2a477ebd","resolution":{"observed_at":"2026-08-08T22:25:23.081224Z","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.1145/3196275","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Completeness for first-order properties on sparse structures with algorithmic applications","venue":"ACM Transactions on Algorithms","work_id":"ed81f240-7bcd-450a-a8cd-816905966461","year":2019},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.085000Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:b0dda858a265d8c8c4e12749fd55f04b431398bbb5fd84ebb914089ae7e73b13","observation_id":"768b3bb6-e102-475d-a6c9-f7e0c84b8ec9","resolution":{"observed_at":"2026-08-08T22:25:23.228178Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T22:25:23.088591Z","title":"Pareto sums of pareto sets","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.088591Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:f90e6cf394b003922813792b95cd56307a2c03178533f3362abd648c9898b097","observation_id":"dfd90739-5f74-4937-b961-1ee828b433ed","resolution":{"observed_at":"2026-08-08T22:25:23.088591Z","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":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:25:24.159866Z","title":"Huttenlocher and Klara Kedem","venue":null,"work_id":"df7a2035-83f2-4ce4-b6a8-bce36d50b2b6","year":1990},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.092085Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:a58768010ea843b6d423584f959cbdf326c8abe6597f97a147aa8ac50d869ded","observation_id":"3e666487-a6e5-42f3-a2f7-7f4c0acd540e","resolution":{"observed_at":"2026-08-08T22:25:24.163271Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-014-9946-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T00:03:40.895421Z","title":"3sum, 3xor, triangles","venue":"Algorithmica","work_id":"782f35f8-758f-4067-a8d9-07c74e17c726","year":2016},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.095621Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:9a93256f641557f12e0ee71cea1478ddff8b9d3c06b2bec4891281ffb83adf84","observation_id":"7fef74b7-e192-439e-9908-629a4c84d0d5","resolution":{"observed_at":"2026-08-08T22:25:23.210712Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T22:25:23.099067Z","title":"Higher lower bounds from the 3sum conjecture","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.099067Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:ff98ae263014e88e7a4d613e024308f997cd5c1859c7a78331fd18c45562fcc1","observation_id":"7301a9ad-d4a8-45a4-9fb0-1f0e9a39e596","resolution":{"observed_at":"2026-08-08T22:25:23.099067Z","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":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:25:23.992672Z","title":"A tight (non-combinatorial) conditional lower bound for klee's measure problem in 3d","venue":null,"work_id":"6feb0284-ab16-46e9-a245-32c656424a31","year":2022},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.102601Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:813488b1551a7f4bd29970b1de618a772efebcd8358fcaf72deba783388cd317","observation_id":"3d2e1963-db23-44e7-94da-1d9800d0e4c1","resolution":{"observed_at":"2026-08-08T22:25:23.998969Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icalp.2016.58","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Wang, and R","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"d56c161e-73f4-41fb-8dd7-edd0663a9cc4","year":2016},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.105853Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:61d82fb828980380b9a496d96706493a1db5a372d072fe1aff07142000441a60","observation_id":"47710c35-c6d6-49d2-b0f7-9037234ea2d1","resolution":{"observed_at":"2026-08-08T22:25:23.193786Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T22:25:23.109117Z","title":"Ryan Williams","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.109117Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:e0bc72cc772a9377fcfce22a1df478e22d3ab5ea6439764214c0cbbf1c9f527b","observation_id":"d19e3781-46b4-45cb-86f8-2a789a92dd7c","resolution":{"observed_at":"2026-08-08T22:25:23.109117Z","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-08T22:25:25.445886Z","title":"Variable and large neighborhood search to solve the multiobjective set covering problem","venue":null,"work_id":"6c1d392c-f478-486c-af0c-445636326a41","year":2014},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.112753Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:f5d6834b5c1a9160ab7d3a10de9cd6617f05acf7eae3ea31ebc86ac81073e538","observation_id":"62648f46-b620-4814-b4e6-8702a92a45b4","resolution":{"observed_at":"2026-08-08T22:25:25.449790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T22:25:25.435713Z","title":"Fine-grained complexity and algorithm engineering of geometric similarity measures","venue":null,"work_id":"90a94067-2a03-41cc-b396-e9411af58e87","year":2021},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.115948Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:ef2d43bda8c52fbac14ba38f5688e82ccef2010a7fa047193c1e278e931a3cf3","observation_id":"92c97fe4-088b-42a4-a726-1edf202ee2e5","resolution":{"observed_at":"2026-08-08T22:25:25.439254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:25:23.807584Z","title":"Towards polynomial lower bounds for dynamic problems","venue":null,"work_id":"85d3d8ba-a22b-46b8-87dc-2ecffde4b20b","year":2010},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.119334Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:f58642215e72c7e960c8fe0d1d358827f1c4c3e150f17f72bdc0ffe97346ca07","observation_id":"1730da16-4c96-4fe2-b5cc-10e2b9ff2d15","resolution":{"observed_at":"2026-08-08T22:25:23.810675Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T22:25:25.425346Z","title":"Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions","venue":null,"work_id":"4ddc7283-87ea-4fe4-84a1-ea1a5db3707a","year":2019},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.122710Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:695d225ee52a7a54a0db9c69130c265273e995582b081c9d18fa0ad8351ccbda","observation_id":"5e057442-d859-4845-b751-15d27dcc0a24","resolution":{"observed_at":"2026-08-08T22:25:25.429019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T22:25:25.415074Z","title":"Shape matching in higher dimensions","venue":null,"work_id":"243abfc3-c5aa-4455-a4ef-65f299393f6e","year":2003},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.126035Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:42039a314e71e490f06533e1438e1911455d208025e084603f49c7a03850d5a1","observation_id":"f4edd38a-a3ab-4cde-bef0-9d5061ed9f32","resolution":{"observed_at":"2026-08-08T22:25:25.418632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T22:25:23.630568Z","title":"Faster decision of first-order graph properties","venue":null,"work_id":"41b42d42-c5f6-4ce0-815a-004ff91ebded","year":2014},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.129417Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:6133fbbf12f5a8e71abb2512170c54f3448c45c67502f4c0a522cb91cfaee4a6","observation_id":"8405d27d-9969-4bfe-8913-0c39de759785","resolution":{"observed_at":"2026-08-08T22:25:23.634976Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T22:25:23.132304Z","title":"On some fine-grained questions in algorithms and complexity","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.132304Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:f4ae1835e91765b8bf1f491e7e0dbe566b39007c46dffa6351479a40b34ec7f8","observation_id":"02020c73-483f-420a-84c6-b5993afb6ea2","resolution":{"observed_at":"2026-08-08T22:25:23.132304Z","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.1109/focs.2010.67","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Subcubic equivalences between path, matrix and triangle problems","venue":null,"work_id":"7be18b95-a65c-469e-997b-dc4d9ddcbcaf","year":2010},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.135289Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:875c9a85d357e7d3c98c85eaffe9885502e1270116ba4b64cb3443de8913c4cd","observation_id":"87f6623c-56b2-41e6-b67d-50725d2bb069","resolution":{"observed_at":"2026-08-08T22:25:23.176759Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T22:25:23.138275Z","title":"Finding, minimizing, and counting weighted subgraphs","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-08T22:25:23.138275Z"},"links":{"citing_paper":"/paper/2502.04581"},"observation_digest":"sha256:26d813d37ad8f260085705de4386ea1e8110d55c3a6189f2f583795a6aeaeff8","observation_id":"41e87f67-c6d2-4ce8-9e4c-1d74ca21b189","resolution":{"observed_at":"2026-08-08T22:25:23.138275Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.04581","last_updated":"2025-02-07T00:29:05Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-15T02:05:33.694484Z","submitted_at":"2025-02-07T00:29:05Z","title":"Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic"},"reference_resolution":{"displayed":51,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":28,"verified_fuzzy":9},"total_outbound_references":51},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 51 of 51 outbound references and 0 inbound Pith citation observations for arXiv:2502.04581."}