Paper Citation Record · LEDGER

Improved Upper Bounds for Slicing the Hypercube

As of 14 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2602.16807.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2602.16807 v2

Coverage vector

measured 39 of 39 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-03T03:49:17.806164Z

measured 39 of 39 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-14T06:32:32.682623+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

39 of 39 outbound references displayed

verified exact0
verified fuzzy0
unresolved39
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 0e7539fd-5077-42a4-92fb-a2645d8981bc · outbound

This paper cites An identity in combinatorial extremal theory.Advances in Mathematics, 80(2):137–151, 1990.

Improved Upper Bounds for Slicing the Hypercube An identity in combinatorial extremal theory.Advances in Mathematics, 80(2):137–151, 1990

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:14.311161Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ae6e1c35-4e5e-4228-b204-7c769f67b209 · outbound

This paper cites Balancing sets of vectors.IEEE Transactions on Information Theory, 34(1):128–130, 2002.

Improved Upper Bounds for Slicing the Hypercube Balancing sets of vectors.IEEE Transactions on Information Theory, 34(1):128–130, 2002

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:14.427726Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 56435a88-3695-49bc-a9b6-b88e019e2642 · outbound

This paper cites CodeEvolve: an open source evolutionary coding agent for algorithmic discovery and optimization.

Improved Upper Bounds for Slicing the Hypercube CodeEvolve: an open source evolutionary coding agent for algorithmic discovery and optimization

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:14.545789Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9b5da66c-4fa0-48b6-a6b2-71ae6ce8eb59 · outbound

This paper cites Flow-based extremal mathematical structure discovery.arXiv preprint arXiv:2601.18005, 2026.

Improved Upper Bounds for Slicing the Hypercube Flow-based extremal mathematical structure discovery.arXiv preprint arXiv:2601.18005, 2026

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:14.699862Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 00d1e0a2-48a9-44ab-b29b-8b4cd09dd58a · outbound

This paper cites Global optimization for combinatorial geometry problems revisited in the era of llms.arXiv e-prints, pages arXiv–2601, 2026.

Improved Upper Bounds for Slicing the Hypercube Global optimization for combinatorial geometry problems revisited in the era of llms.arXiv e-prints, pages arXiv–2601, 2026

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:14.823624Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0ab782d5-f9cd-43b8-adec-fa26e61ce98b · outbound

This paper cites Early science acceleration experiments with gpt-5.arXiv preprint arXiv:2511.16072, 2025.

Improved Upper Bounds for Slicing the Hypercube Early science acceleration experiments with gpt-5.arXiv preprint arXiv:2511.16072, 2025

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:14.887131Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3c9516d5-6314-4534-9c90-9b973ddd2b9c · outbound

This paper cites NuMVC: An efficient local search algorithm for minimum vertex cover.Journal of Artificial Intelligence Research, 46:687–716, 2013.

Improved Upper Bounds for Slicing the Hypercube NuMVC: An efficient local search algorithm for minimum vertex cover.Journal of Artificial Intelligence Research, 46:687–716, 2013

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:14.990162Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c51ab10b-3e0e-4e6e-8017-83a0072f3209 · outbound

This paper cites PatternBoost: Constructions in Mathematics with a Little Help from AI.

Improved Upper Bounds for Slicing the Hypercube PatternBoost: Constructions in Mathematics with a Little Help from AI

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:15.110807Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5fbf0c88-bea5-475e-8c70-9476ea35ce2b · outbound

This paper cites Barbarians at the gate: How AI is upending systems research.arXiv preprint arXiv:2510.06189, 2025.

Improved Upper Bounds for Slicing the Hypercube Barbarians at the gate: How AI is upending systems research.arXiv preprint arXiv:2510.06189, 2025

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:15.231258Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3e25375e-3be9-439a-864d-de44b857b876 · outbound

This paper cites On the cuts and cut number of the 4-cube.

Improved Upper Bounds for Slicing the Hypercube On the cuts and cut number of the 4-cube

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:15.362010Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 92cd431b-ed1a-4c1d-b899-7e243855506d · outbound

This paper cites On the cut number problem for the 4, and 5-cubes.Discrete Applied Mathematics, 303:66–75, 2021.

Improved Upper Bounds for Slicing the Hypercube On the cut number problem for the 4, and 5-cubes.Discrete Applied Mathematics, 303:66–75, 2021

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:15.578352Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9a15e3cb-af27-421e-b711-76c78cc060f2 · outbound

This paper cites New bounds for hypercube slicing numbers.Discrete Mathematics & Theoretical Computer Science, AA:155–164, 2001.

Improved Upper Bounds for Slicing the Hypercube New bounds for hypercube slicing numbers.Discrete Mathematics & Theoretical Computer Science, AA:155–164, 2001

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:15.660191Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dc63d342-6442-48fd-92fe-d2ffbf70723a · outbound

This paper cites On the coverings of the d-cube ford≤6.Discrete Applied Mathematics, 156(17):3156–3165, 2008.

Improved Upper Bounds for Slicing the Hypercube On the coverings of the d-cube ford≤6.Discrete Applied Mathematics, 156(17):3156–3165, 2008

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:15.757573Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation daceb815-5dc8-4033-b296-e13bb2afb04a · outbound

This paper cites Mathematical exploration and discovery at scale.

Improved Upper Bounds for Slicing the Hypercube Mathematical exploration and discovery at scale

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:15.926337Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5d765c37-5da1-436c-8412-8922d9901adf · outbound

This paper cites Random baselines for simple code problems are competitive with code evolution.

Improved Upper Bounds for Slicing the Hypercube Random baselines for simple code problems are competitive with code evolution

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:16.072353Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 89e23cdf-25d6-4a19-bfd0-0c294768b175 · outbound

This paper cites The bunkbed conjecture is false.Proceedings of the National Academy of Sciences, 122(24):e2420725122, 2025.

Improved Upper Bounds for Slicing the Hypercube The bunkbed conjecture is false.Proceedings of the National Academy of Sciences, 122(24):e2420725122, 2025

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:16.188462Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1ebafd4a-e8c1-4229-94ac-cdaa24f7532f · outbound

This paper cites Spectral properties of threshold functions.

Improved Upper Bounds for Slicing the Hypercube Spectral properties of threshold functions

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:16.272312Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6239df3d-2f3d-4798-8c18-9424a1fa2f5d · outbound

This paper cites How to cut all edges of a polytope?The American Mathematical Monthly, 79(8):890–895, 1972.

Improved Upper Bounds for Slicing the Hypercube How to cut all edges of a polytope?The American Mathematical Monthly, 79(8):890–895, 1972

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:16.287021Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fb80cc8e-75bd-4abe-b0dd-8c4ceb64b149 · outbound

This paper cites Slicing all edges of an n-cube requires n 2/3 hyperplanes.

Improved Upper Bounds for Slicing the Hypercube Slicing all edges of an n-cube requires n 2/3 hyperplanes

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:16.321918Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 73a14242-0adf-4a2c-a5be-149956bcc501 · outbound

This paper cites Can language models discover scaling laws?arXiv preprint arXiv:2507.21184, 2025.

Improved Upper Bounds for Slicing the Hypercube Can language models discover scaling laws?arXiv preprint arXiv:2507.21184, 2025

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:16.371610Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 38805556-00a9-4205-a422-91df4261339c · outbound

This paper cites Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search.

Improved Upper Bounds for Slicing the Hypercube Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:16.433258Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2afbccaf-99d4-4814-8bac-dd5a1a2a01e4 · outbound

This paper cites AlphaEvolve: A coding agent for scientific and algorithmic discovery.

Improved Upper Bounds for Slicing the Hypercube AlphaEvolve: A coding agent for scientific and algorithmic discovery

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:16.496263Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 58d42280-c5c1-4b0a-a54c-ca2d4c43c094 · outbound

This paper cites Slicing the n-cube.

Improved Upper Bounds for Slicing the Hypercube Slicing the n-cube

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:16.566816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a0f4fe70-f79e-40d6-8365-dd73cc9af712 · outbound

This paper cites Hyperplane cuts of an n-cube.Discrete Mathematics, 1(2):193–195, 1971.

Improved Upper Bounds for Slicing the Hypercube Hyperplane cuts of an n-cube.Discrete Mathematics, 1(2):193–195, 1971

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:16.641106Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bb8792ab-df2f-4f72-857e-47e12c728d8b · outbound

This paper cites New ramsey multiplicity bounds and search heuristics.Foundations of Computational Mathematics, 25(5):1777–1814, 2025.

Improved Upper Bounds for Slicing the Hypercube New ramsey multiplicity bounds and search heuristics.Foundations of Computational Mathematics, 25(5):1777–1814, 2025

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:16.704112Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7cd586c7-33bd-4320-970b-edab6e6778cb · outbound

This paper cites On threshold circuits for parity.

Improved Upper Bounds for Slicing the Hypercube On threshold circuits for parity

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:16.747422Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2d6ea2f1-2249-4f7a-86db-f457fd50f383 · outbound

This paper cites Using large-scale experiments and machine learning to discover theories of human decision-making.Science, 372(6547):1209– 1214, 2021.

Improved Upper Bounds for Slicing the Hypercube Using large-scale experiments and machine learning to discover theories of human decision-making.Science, 372(6547):1209– 1214, 2021

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:16.805819Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 41ac437a-4854-4ab2-9584-be5dffe75e22 · outbound

This paper cites Mathemati- cal discoveries from program search with large language models.Nature, 625(7995):468–475, 2024.

Improved Upper Bounds for Slicing the Hypercube Mathemati- cal discoveries from program search with large language models.Nature, 625(7995):468–475, 2024

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:16.829612Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 962540be-3e05-41d7-91bd-30fdde0e745a · outbound

This paper cites LLM-generated search heuristics can solve open in- stances of combinatorial design problems.MATH-AI Workshop at NeurIPS, 2025.

Improved Upper Bounds for Slicing the Hypercube LLM-generated search heuristics can solve open in- stances of combinatorial design problems.MATH-AI Workshop at NeurIPS, 2025

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:16.937703Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 587d4db1-a206-4a17-8df9-f3ffaed2e825 · outbound

This paper cites Using Code Generation to Solve Open Instances of Combinatorial Design Problems.

Improved Upper Bounds for Slicing the Hypercube Using Code Generation to Solve Open Instances of Combinatorial Design Problems

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:16.974309Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 235b6e40-67d0-46dd-ac27-8af72ffc6bdb · outbound

This paper cites Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems.

Improved Upper Bounds for Slicing the Hypercube Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:17.061731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4ffaadb0-ef13-4ccc-a3ad-fa483caafd56 · outbound

This paper cites Slicing the hypercube.Surveys in combinatorics, 1993:211– 255, 1993.

Improved Upper Bounds for Slicing the Hypercube Slicing the hypercube.Surveys in combinatorics, 1993:211– 255, 1993

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:17.107746Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1d76d4e4-3ba4-40e8-ab31-552b42843b5f · outbound

This paper cites Improved lower bound for hypercube edge slicing.arXiv preprint arXiv:2510.16592, 2025.

Improved Upper Bounds for Slicing the Hypercube Improved lower bound for hypercube edge slicing.arXiv preprint arXiv:2510.16592, 2025

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:17.201645Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3c6785f7-4a1e-4e92-b060-fded05703f89 · outbound

This paper cites Nondegenerate hyperplane covers of the hypercube.arXiv preprint arXiv:2507.00773, 2025.

Improved Upper Bounds for Slicing the Hypercube Nondegenerate hyperplane covers of the hypercube.arXiv preprint arXiv:2507.00773, 2025

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:17.263858Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c932a536-e365-4b33-a21d-bf0d0f975b4e · outbound

This paper cites Openevolve: an open-source evolutionary coding agent, 2025.

Improved Upper Bounds for Slicing the Hypercube Openevolve: an open-source evolutionary coding agent, 2025

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:17.345658Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 12d76a2a-525c-497f-87ef-0e7ec7388a70 · outbound

This paper cites Advancing Geometry with AI: Multi-agent Generation of Polytopes.

Improved Upper Bounds for Slicing the Hypercube Advancing Geometry with AI: Multi-agent Generation of Polytopes

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:17.404619Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9796b8a0-5b1e-47a3-9161-b98258196aea · outbound

This paper cites [Mastodon Post] - There are now sufficiently many dif- ferent examples of Erdos problems.

Improved Upper Bounds for Slicing the Hypercube [Mastodon Post] - There are now sufficiently many dif- ferent examples of Erdos problems

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:17.471366Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d6654e96-bdc9-461e-a73b-d893b3244847 · outbound

This paper cites Slicing the hypercube is not easy.

Improved Upper Bounds for Slicing the Hypercube Slicing the hypercube is not easy

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:17.653268Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9ad1373f-d182-4007-8b37-81cc6b260d8a · outbound

This paper cites Computing cut numbers.

Improved Upper Bounds for Slicing the Hypercube Computing cut numbers

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-03T03:49:17.806164Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.