Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-08T22:25:23.138275Z
Paper Citation Record · LEDGER
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic
As of 20 August 2026, this Paper Citation Record lists 51 of 51 outbound references and 0 inbound Pith citation observations for arXiv:2502.04581.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-20T06:33:59.587034+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
51 of 51 outbound references displayed
- verified exact28
- verified fuzzy9
- unresolved14
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation a6b626a7-18b8-436a-aafb-3e5b24d5ef77 · outbound
This paper cites Fine-grained complexity of analyzing compressed data: Quantifying improvements over decompress-and-solve.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Fine-grained complexity of analyzing compressed data: Quantifying improvements over decompress-and-solve
Reference 1
- Resolution
- unresolved
- no resolver link, observed 2026-08-08T22:25:22.968015Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 7e7fff81-d049-42b6-bcfc-13b3fb69ce0e · outbound
This paper cites Impossibility results for grammar-compressed linear algebra.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Impossibility results for grammar-compressed linear algebra
Reference 2
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-08T22:25:25.512705Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 1ef8b476-28de-4212-a4c2-0d511ba6682e · outbound
This paper cites Exact weight subgraphs and the k-sum conjecture.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Exact weight subgraphs and the k-sum conjecture
Reference 4
- Resolution
- unresolved
- no resolver link, observed 2026-08-08T22:25:22.979837Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 6c0c50d4-2c86-4c14-995f-61eeb4419352 · outbound
This paper cites Losing weight by gaining edges.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Losing weight by gaining edges
Reference 5
- Resolution
- unresolved
- no resolver link, observed 2026-08-08T22:25:22.983676Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation b121eb36-1b08-41ce-9837-32b85b09e9a0 · outbound
This paper cites Popular conjectures imply strong lower bounds for dynamic problems.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Popular conjectures imply strong lower bounds for dynamic problems
Reference 6
- Resolution
- unresolved
- no resolver link, observed 2026-08-08T22:25:22.987640Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 45ed8c60-b59a-4b63-8abc-c76c6e6300c7 · outbound
This paper cites The fine-grained complexity of multi-dimensional ordering properties.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic The fine-grained complexity of multi-dimensional ordering properties
Reference 7
- Resolution
- verified exact
- doi, observed 2026-08-08T22:25:23.387656Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation b2cb7c5c-07c8-447a-8fc7-897e4c4ba083 · outbound
This paper cites State-based accelerations and bidirectional search for bi-objective multi-modal shortest paths.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic State-based accelerations and bidirectional search for bi-objective multi-modal shortest paths
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-08T22:25:25.502650Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 521e88f0-4bb7-43ec-85c4-54222ea20607 · outbound
This paper cites Better approximations for tree sparsity in nearly-linear time.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Better approximations for tree sparsity in nearly-linear time
Reference 9
- Resolution
- verified exact
- doi, observed 2026-08-08T22:25:23.376817Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 875a77af-c9d8-4b3d-b650-c35b5b69e615 · outbound
This paper cites How hard are n 2-hard problems? ACM SIGACT News , 25(2):83--85, 1994.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic How hard are n 2-hard problems? ACM SIGACT News , 25(2):83--85, 1994
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-08T22:25:25.492365Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 877c47c5-acac-4567-9ab4-1a0251c8d62a · outbound
This paper cites Voronoi diagrams in higher dimensions under certain polyhedral distance functions.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Voronoi diagrams in higher dimensions under certain polyhedral distance functions
Reference 11
- Resolution
- verified exact
- doi, observed 2026-08-08T22:25:23.366064Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 6da78f64-6b27-4fb0-93fb-f25094d8b832 · outbound
This paper cites Fine-grained completeness for optimization in P.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Fine-grained completeness for optimization in P
Reference 12
- Resolution
- verified exact
- doi, observed 2026-08-08T22:25:25.482263Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 2b5ce512-09ee-4db1-94c2-3dc34cf8cbb0 · outbound
This paper cites A structural investigation of the approximability of polynomial-time problems.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic A structural investigation of the approximability of polynomial-time problems
Reference 13
- Resolution
- unresolved
- no resolver link, observed 2026-08-08T22:25:23.011913Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 942e60de-02c5-40a4-a7a6-b8cd0e4db847 · outbound
This paper cites A fine-grained analogue of schaefer's theorem in P: dichotomy of exists \^ k-forall-quantified first-order graph properties.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic A fine-grained analogue of schaefer's theorem in P: dichotomy of exists \^ k-forall-quantified first-order graph properties
Reference 14
- Resolution
- unresolved
- no resolver link, observed 2026-08-08T22:25:23.015120Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 4ab9be26-4c07-479a-8611-81acbf8e0a30 · outbound
This paper cites Sparse nonnegative convolution is equivalent to dense nonnegative convolution.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Sparse nonnegative convolution is equivalent to dense nonnegative convolution
Reference 15
- Resolution
- verified exact
- arxiv_id_nonexistent, observed 2026-08-08T22:25:25.232639Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 06ee28cd-ed41-4d0a-9c5b-922226de03b9 · outbound
This paper cites Deterministic and las vegas algorithms for sparse nonnegative convolution.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Deterministic and las vegas algorithms for sparse nonnegative convolution
Reference 16
- Resolution
- unresolved
- no resolver link, observed 2026-08-08T22:25:23.020647Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation e2f3d11e-57d7-479c-975c-842394824d22 · outbound
This paper cites Fast n-fold boolean convolution via additive combinatorics.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Fast n-fold boolean convolution via additive combinatorics
Reference 17
- Resolution
- unresolved
- no resolver link, observed 2026-08-08T22:25:23.023538Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation bdd6d25b-e04e-4afb-8272-b219a98a2972 · outbound
This paper cites Translating hausdorff is hard: Fine-grained lower bounds for hausdorff distance under translation.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Translating hausdorff is hard: Fine-grained lower bounds for hausdorff distance under translation
Reference 18
- Resolution
- verified exact
- doi, observed 2026-08-08T22:25:23.330948Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 63422ca9-3b59-42a2-a3a0-063dc0da5ac2 · outbound
This paper cites an unresolved cited work.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Unresolved cited work
Reference 19
- Resolution
- verified exact
- doi, observed 2026-08-08T22:25:23.321558Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation a32ee94c-9ab5-4770-9aba-ca6a62a0a5d9 · outbound
This paper cites Chan and Moshe Lewenstein.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Chan and Moshe Lewenstein
Reference 20
- Resolution
- verified exact
- arxiv_id_nonexistent, observed 2026-08-08T22:25:25.062639Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation ec223b8e-887f-4aae-80d6-bbfa0149240a · outbound
This paper cites Chan, Virginia Vassilevska Williams, and Yinzhan Xu.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Chan, Virginia Vassilevska Williams, and Yinzhan Xu
Reference 21
- Resolution
- verified exact
- arxiv_id_nonexistent, observed 2026-08-08T22:25:25.402580Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation e0d956c5-7622-4993-9464-9ba4d36b48d1 · outbound
This paper cites Chan, Virginia Vassilevska Williams, and Yinzhan Xu.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Chan, Virginia Vassilevska Williams, and Yinzhan Xu
Reference 22
- Resolution
- verified exact
- arxiv_id_nonexistent, observed 2026-08-08T22:25:24.877913Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation ad318539-cf67-4a2c-8020-60427dc9a569 · outbound
This paper cites Paul Chew, Dorit Dor, Alon Efrat, and Klara Kedem.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Paul Chew, Dorit Dor, Alon Efrat, and Klara Kedem
Reference 23
- Resolution
- verified exact
- doi, observed 2026-08-08T22:25:23.311905Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 1133e3bc-ab07-4779-bd42-40153eef0481 · outbound
This paper cites Improvements on geometric pattern matching problems.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Improvements on geometric pattern matching problems
Reference 24
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-08T22:25:25.471099Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation f272a9ab-13e0-4b9b-aa72-0b60685507b3 · outbound
This paper cites Paul Chew and Klara Kedem.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Paul Chew and Klara Kedem
Reference 25
- Resolution
- verified exact
- doi, observed 2026-08-08T22:25:23.301465Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 2e93e6b2-1ccc-478d-858c-9b1fcb6b354d · outbound
This paper cites Verifying candidate matches in sparse and wildcard matching.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Verifying candidate matches in sparse and wildcard matching
Reference 26
- Resolution
- verified exact
- arxiv_id_nonexistent, observed 2026-08-08T22:25:24.690408Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation afd4abc5-016f-4566-ad17-d8bc7df5bcd3 · outbound
This paper cites On problems equivalent to (min, +)-convolution.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic On problems equivalent to (min, +)-convolution
Reference 27
- Resolution
- verified exact
- doi, observed 2026-08-08T22:25:23.291327Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 0de7a276-1933-420e-936d-91795b8b5b7e · outbound
This paper cites Counting answers to existential questions.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Counting answers to existential questions
Reference 28
- Resolution
- verified exact
- doi, observed 2026-08-08T22:25:23.281181Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation b1f9c5c4-3659-4417-808f-9eb45ec44d92 · outbound
This paper cites All non-trivial variants of 3-ldt are equivalent.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic All non-trivial variants of 3-ldt are equivalent
Reference 29
- Resolution
- verified exact
- arxiv_id_nonexistent, observed 2026-08-08T22:25:24.505615Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation daeb6d2c-2ed4-4385-be1d-e8893c1ace85 · outbound
This paper cites A survey and annotated bibliography of multiobjective combinatorial optimization.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic A survey and annotated bibliography of multiobjective combinatorial optimization
Reference 30
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-08T22:25:25.460522Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 19bfac0d-3c1a-4011-8d41-a9e2a1ca79fc · outbound
This paper cites New lower bounds for convex hull problems in odd dimensions.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic New lower bounds for convex hull problems in odd dimensions
Reference 31
- Resolution
- verified exact
- doi, observed 2026-08-08T22:25:23.270616Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation ef8078e0-f994-415b-953f-5046547515bc · outbound
This paper cites The effect of sparsity on k-dominating set and related first-order graph properties.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic The effect of sparsity on k-dominating set and related first-order graph properties
Reference 32
- Resolution
- verified exact
- doi, observed 2026-08-08T22:25:23.259912Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation a98e506b-63a4-493e-b680-c8908a379249 · outbound
This paper cites Pareto Sums of Pareto Sets: Lower Bounds and Algorithms.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Pareto Sums of Pareto Sets: Lower Bounds and Algorithms
Reference 33
- Resolution
- verified exact
- local_arxiv, observed 2026-08-08T22:25:23.248959Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 92158010-c89c-40de-9601-42fdbb0c0674 · outbound
This paper cites Gabow, Jon Louis Bentley, and Robert Endre Tarjan.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Gabow, Jon Louis Bentley, and Robert Endre Tarjan
Reference 34
- Resolution
- verified exact
- arxiv_id_nonexistent, observed 2026-08-08T22:25:24.321209Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 2f19196a-cef4-4a3f-8a32-725f2a477ebd · outbound
This paper cites Overmars.
Reference 35
- Resolution
- unresolved
- no resolver link, observed 2026-08-08T22:25:23.081224Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 768b3bb6-e102-475d-a6c9-f7e0c84b8ec9 · outbound
This paper cites Completeness for first-order properties on sparse structures with algorithmic applications.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Completeness for first-order properties on sparse structures with algorithmic applications
Reference 36
- Resolution
- verified exact
- doi, observed 2026-08-08T22:25:23.228178Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation dfd90739-5f74-4937-b961-1ee828b433ed · outbound
This paper cites Pareto sums of pareto sets.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Pareto sums of pareto sets
Reference 37
- Resolution
- unresolved
- no resolver link, observed 2026-08-08T22:25:23.088591Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 3e666487-a6e5-42f3-a2f7-7f4c0acd540e · outbound
This paper cites Huttenlocher and Klara Kedem.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Huttenlocher and Klara Kedem
Reference 38
- Resolution
- verified exact
- arxiv_id_nonexistent, observed 2026-08-08T22:25:24.163271Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 7fef74b7-e192-439e-9908-629a4c84d0d5 · outbound
This paper cites 3sum, 3xor, triangles.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic 3sum, 3xor, triangles
Reference 39
- Resolution
- verified exact
- doi, observed 2026-08-08T22:25:23.210712Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 7301a9ad-d4a8-45a4-9fb0-1f0e9a39e596 · outbound
This paper cites Higher lower bounds from the 3sum conjecture.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Higher lower bounds from the 3sum conjecture
Reference 40
- Resolution
- unresolved
- no resolver link, observed 2026-08-08T22:25:23.099067Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 3d2e1963-db23-44e7-94da-1d9800d0e4c1 · outbound
This paper cites A tight (non-combinatorial) conditional lower bound for klee's measure problem in 3d.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic A tight (non-combinatorial) conditional lower bound for klee's measure problem in 3d
Reference 41
- Resolution
- verified exact
- arxiv_id_nonexistent, observed 2026-08-08T22:25:23.998969Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 47710c35-c6d6-49d2-b0f7-9037234ea2d1 · outbound
This paper cites Wang, and R.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Wang, and R
Reference 42
- Resolution
- verified exact
- doi, observed 2026-08-08T22:25:23.193786Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation d19e3781-46b4-45cb-86f8-2a789a92dd7c · outbound
This paper cites Ryan Williams.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Ryan Williams
Reference 43
- Resolution
- unresolved
- no resolver link, observed 2026-08-08T22:25:23.109117Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 62648f46-b620-4814-b4e6-8702a92a45b4 · outbound
This paper cites Variable and large neighborhood search to solve the multiobjective set covering problem.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Variable and large neighborhood search to solve the multiobjective set covering problem
Reference 44
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-08T22:25:25.449790Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 92c97fe4-088b-42a4-a726-1edf202ee2e5 · outbound
This paper cites Fine-grained complexity and algorithm engineering of geometric similarity measures.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Fine-grained complexity and algorithm engineering of geometric similarity measures
Reference 45
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-08T22:25:25.439254Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 1730da16-4c96-4fe2-b5cc-10e2b9ff2d15 · outbound
This paper cites Towards polynomial lower bounds for dynamic problems.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Towards polynomial lower bounds for dynamic problems
Reference 46
- Resolution
- verified exact
- arxiv_id_nonexistent, observed 2026-08-08T22:25:23.810675Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 5e057442-d859-4845-b751-15d27dcc0a24 · outbound
This paper cites Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions
Reference 47
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-08T22:25:25.429019Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation f4edd38a-a3ab-4cde-bef0-9d5061ed9f32 · outbound
This paper cites Shape matching in higher dimensions.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Shape matching in higher dimensions
Reference 48
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-08T22:25:25.418632Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 8405d27d-9969-4bfe-8913-0c39de759785 · outbound
This paper cites Faster decision of first-order graph properties.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Faster decision of first-order graph properties
Reference 49
- Resolution
- verified exact
- arxiv_id_nonexistent, observed 2026-08-08T22:25:23.634976Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 02020c73-483f-420a-84c6-b5993afb6ea2 · outbound
This paper cites On some fine-grained questions in algorithms and complexity.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic On some fine-grained questions in algorithms and complexity
Reference 50
- Resolution
- unresolved
- no resolver link, observed 2026-08-08T22:25:23.132304Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 87f6623c-56b2-41e6-b67d-50725d2bb069 · outbound
This paper cites Subcubic equivalences between path, matrix and triangle problems.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Subcubic equivalences between path, matrix and triangle problems
Reference 51
- Resolution
- verified exact
- doi, observed 2026-08-08T22:25:23.176759Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.
Observation 41e87f67-c6d2-4ce8-9e4c-1d74ca21b189 · outbound
This paper cites Finding, minimizing, and counting weighted subgraphs.
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic Finding, minimizing, and counting weighted subgraphs
Reference 52
- Resolution
- unresolved
- no resolver link, observed 2026-08-08T22:25:23.138275Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Pith citing papers
No inbound Pith citation observations are available.