{"as_of":"2026-08-11T08:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d4826cbe0e938728c3910fb19c251c0b0f6e8bc4335243776ccb6a252814b0c8","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T03:49:17.806164Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2602.16807/citation-record","integrity":"/paper/2602.16807/integrity","json":"/paper/2602.16807/citation-record.json","paper":"/paper/2602.16807"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:49:14.311161Z","title":"An identity in combinatorial extremal theory.Advances in Mathematics, 80(2):137–151, 1990","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:14.311161Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:c2c58e20c0bb512e5e54329342a625d7852e529ead9f98b0d169babc0309420c","observation_id":"0e7539fd-5077-42a4-92fb-a2645d8981bc","resolution":{"observed_at":"2026-08-03T03:49:14.311161Z","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-03T03:49:14.427726Z","title":"Balancing sets of vectors.IEEE Transactions on Information Theory, 34(1):128–130, 2002","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:14.427726Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:ae5f6d2727d6c9368eccf7fe9b57726865750ab9b8f53c3d9bc85dac72d0694e","observation_id":"ae6e1c35-4e5e-4228-b204-7c769f67b209","resolution":{"observed_at":"2026-08-03T03:49:14.427726Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2510.14150","last_updated":"2026-05-28T13:36:14Z","snapshot_observed_at":"2026-08-10T14:29:59.159685Z","submitted_at":"2025-10-15T22:58:06Z","title":"CodeEvolve: an open source evolutionary coding agent for algorithmic discovery and optimization","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2510.14150","snapshot_observed_at":"2026-08-03T03:49:14.545789Z","title":"Codeevolve: An open source evolutionary coding agent for algorithm discovery and optimization.arXiv preprint arXiv:2510.14150, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:14.545789Z"},"links":{"cited_paper":"/paper/2510.14150","citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:20f1ece18b501cd78963b3de4fe42e49eebfd12dda02e2413bb17b41868fc2ab","observation_id":"56435a88-3695-49bc-a9b6-b88e019e2642","resolution":{"observed_at":"2026-08-03T03:49:14.545789Z","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-03T03:49:14.699862Z","title":"Flow-based extremal mathematical structure discovery.arXiv preprint arXiv:2601.18005, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:14.699862Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:c37390cd99d8b9ed7ff9393f2832623eafe860c780037f47ff33a327764dca05","observation_id":"9b5da66c-4fa0-48b6-a6b2-71ae6ce8eb59","resolution":{"observed_at":"2026-08-03T03:49:14.699862Z","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-03T03:49:14.823624Z","title":"Global optimization for combinatorial geometry problems revisited in the era of llms.arXiv e-prints, pages arXiv–2601, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:14.823624Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:4e2b58214417b6fc24643df4ce8484d5329d8dc4f426c882f2b72bed2d167a41","observation_id":"00d1e0a2-48a9-44ab-b29b-8b4cd09dd58a","resolution":{"observed_at":"2026-08-03T03:49:14.823624Z","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-03T03:49:14.887131Z","title":"Early science acceleration experiments with gpt-5.arXiv preprint arXiv:2511.16072, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:14.887131Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:89d96a2219016f018d2b60e7427ad22c5361c4348b2f3ab697e89268235b27ec","observation_id":"0ab782d5-f9cd-43b8-adec-fa26e61ce98b","resolution":{"observed_at":"2026-08-03T03:49:14.887131Z","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-03T03:49:14.990162Z","title":"NuMVC: An efficient local search algorithm for minimum vertex cover.Journal of Artificial Intelligence Research, 46:687–716, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:14.990162Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:bb6e7ae7ff00872a515537a53f6a0b4a6f9dd26d9d02946f616bf4e656fb43d6","observation_id":"3c9516d5-6314-4534-9c90-9b973ddd2b9c","resolution":{"observed_at":"2026-08-03T03:49:14.990162Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.00566","last_updated":"2024-11-01T13:23:58Z","snapshot_observed_at":"2026-08-11T00:49:15.422696Z","submitted_at":"2024-11-01T13:23:58Z","title":"PatternBoost: Constructions in Mathematics with a Little Help from AI","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.00566","snapshot_observed_at":"2026-08-03T03:49:15.110807Z","title":"Patternboost: Constructions in mathematics with a little help from ai.arXiv preprint arXiv:2411.00566, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:15.110807Z"},"links":{"cited_paper":"/paper/2411.00566","citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:a930c3f93054a12060c68185188f6e79657c1040198fa166f6f485f8ba21775e","observation_id":"c51ab10b-3e0e-4e6e-8017-83a0072f3209","resolution":{"observed_at":"2026-08-03T03:49:15.110807Z","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-03T03:49:15.231258Z","title":"Barbarians at the gate: How AI is upending systems research.arXiv preprint arXiv:2510.06189, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:15.231258Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:0ac85c0adb957c2c94f8063b32cb7efeeafa37e36447303a7cf255c850e94bb1","observation_id":"5fbf0c88-bea5-475e-8c70-9476ea35ce2b","resolution":{"observed_at":"2026-08-03T03:49:15.231258Z","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-03T03:49:15.362010Z","title":"On the cuts and cut number of the 4-cube","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:15.362010Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:725e61cafebb8524b18c3afaf0164c7a501562622f3af498e39750e1986c0159","observation_id":"3e25375e-3be9-439a-864d-de44b857b876","resolution":{"observed_at":"2026-08-03T03:49:15.362010Z","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-03T03:49:15.578352Z","title":"On the cut number problem for the 4, and 5-cubes.Discrete Applied Mathematics, 303:66–75, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:15.578352Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:e5757e5599c655fd3b87e9bb5d8a71aba82f6f57f78a538894d3106a6448360b","observation_id":"92cd431b-ed1a-4c1d-b899-7e243855506d","resolution":{"observed_at":"2026-08-03T03:49:15.578352Z","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-03T03:49:15.660191Z","title":"New bounds for hypercube slicing numbers.Discrete Mathematics & Theoretical Computer Science, AA:155–164, 2001","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:15.660191Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:772ec4e9547d7c367a7c5f5dc9a5c062c17e7f75d3cb5be9712640f0b10b1340","observation_id":"9a15e3cb-af27-421e-b711-76c78cc060f2","resolution":{"observed_at":"2026-08-03T03:49:15.660191Z","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-03T03:49:15.757573Z","title":"On the coverings of the d-cube ford≤6.Discrete Applied Mathematics, 156(17):3156–3165, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:15.757573Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:66ce7bfbe2368bf24bb5a58a02a7304a6e1490bc3cb4cbe4c7ec1e59c1804e4b","observation_id":"dc63d342-6442-48fd-92fe-d2ffbf70723a","resolution":{"observed_at":"2026-08-03T03:49:15.757573Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2511.02864","last_updated":"2025-12-22T12:49:01Z","snapshot_observed_at":"2026-08-07T08:27:55.662438Z","submitted_at":"2025-11-03T16:04:07Z","title":"Mathematical exploration and discovery at scale","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2511.02864","snapshot_observed_at":"2026-08-03T03:49:15.926337Z","title":"Mathematical exploration and discovery at scale.arXiv preprint arXiv:2511.02864, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:15.926337Z"},"links":{"cited_paper":"/paper/2511.02864","citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:4b6f6645f71bd26b24aca8010a22894d920d8a9a7eef522ed47f302d5ad31d7c","observation_id":"daceb815-5dc8-4033-b296-e13bb2afb04a","resolution":{"observed_at":"2026-08-03T03:49:15.926337Z","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-03T03:49:16.072353Z","title":"Random baselines for simple code problems are competitive with code evolution","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:16.072353Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:b4ac0504767ec8eedc72b076e0dd8680f142bd069cfdd6fb7edb99d72bf3d354","observation_id":"5d765c37-5da1-436c-8412-8922d9901adf","resolution":{"observed_at":"2026-08-03T03:49:16.072353Z","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-03T03:49:16.188462Z","title":"The bunkbed conjecture is false.Proceedings of the National Academy of Sciences, 122(24):e2420725122, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:16.188462Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:4788a949116064fc29293ac3b62e35168ae6c89ed28d659da34b8b51ed6cf416","observation_id":"89e23cdf-25d6-4a19-bfd0-0c294768b175","resolution":{"observed_at":"2026-08-03T03:49:16.188462Z","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-03T03:49:16.272312Z","title":"Spectral properties of threshold functions","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:16.272312Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:8b40c3e684e0637ef7ec90a52510dc81c06745dba5a97e0bf76a910a9f106863","observation_id":"1ebafd4a-e8c1-4229-94ac-cdaa24f7532f","resolution":{"observed_at":"2026-08-03T03:49:16.272312Z","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-03T03:49:16.287021Z","title":"How to cut all edges of a polytope?The American Mathematical Monthly, 79(8):890–895, 1972","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:16.287021Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:91ce54e97850f51584ac839c7df9c3fbe8b21a75196aeffcc9f00f60ba8d6a33","observation_id":"6239df3d-2f3d-4798-8c18-9424a1fa2f5d","resolution":{"observed_at":"2026-08-03T03:49:16.287021Z","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-03T03:49:16.321918Z","title":"Slicing all edges of an n-cube requires n 2/3 hyperplanes","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:16.321918Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:fb409213ec5d10442d869eb68f74f83dfec825c6187932e9ca9632341bea4640","observation_id":"fb80cc8e-75bd-4abe-b0dd-8c4ceb64b149","resolution":{"observed_at":"2026-08-03T03:49:16.321918Z","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-03T03:49:16.371610Z","title":"Can language models discover scaling laws?arXiv preprint arXiv:2507.21184, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:16.371610Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:cf4c6566e1af1772b2b0b0fa2f3f200b994e5c3d8a2cb8d6c160398c19c5ee80","observation_id":"73a14242-0adf-4a2c-a5be-149956bcc501","resolution":{"observed_at":"2026-08-03T03:49:16.371610Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.03583","last_updated":"2024-07-29T16:13:22Z","snapshot_observed_at":"2026-08-06T10:08:35.454536Z","submitted_at":"2023-11-06T22:29:55Z","title":"Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.03583","snapshot_observed_at":"2026-08-03T03:49:16.433258Z","title":"Finding increasingly large extremal graphs with alphazero and tabu search.arXiv preprint arXiv:2311.03583, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:16.433258Z"},"links":{"cited_paper":"/paper/2311.03583","citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:64f472ea9eccdddcc10144ec30c50837167ea8539d7e3c5603d5a56691570178","observation_id":"38805556-00a9-4205-a422-91df4261339c","resolution":{"observed_at":"2026-08-03T03:49:16.433258Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.13131","last_updated":"2025-06-16T06:37:18Z","snapshot_observed_at":"2026-08-07T04:21:43.190472Z","submitted_at":"2025-06-16T06:37:18Z","title":"AlphaEvolve: A coding agent for scientific and algorithmic discovery","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.13131","snapshot_observed_at":"2026-08-03T03:49:16.496263Z","title":"Alphaevolve: A coding agent for scientific and algorithmic discovery.arXiv preprint arXiv:2506.13131, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:16.496263Z"},"links":{"cited_paper":"/paper/2506.13131","citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:945939cbd29184316011fc3e3d06039d6abc875ad49cdeb9ef4cd461a8f92415","observation_id":"2afbccaf-99d4-4814-8bac-dd5a1a2a01e4","resolution":{"observed_at":"2026-08-03T03:49:16.496263Z","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-03T03:49:16.566816Z","title":"Slicing the n-cube","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:16.566816Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:93c9988cbdc50ff407f727f4a2d3285f46667af09bd66506387d082e1ddd687c","observation_id":"58d42280-c5c1-4b0a-a54c-ca2d4c43c094","resolution":{"observed_at":"2026-08-03T03:49:16.566816Z","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-03T03:49:16.641106Z","title":"Hyperplane cuts of an n-cube.Discrete Mathematics, 1(2):193–195, 1971","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:16.641106Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:f2d0a51a04292308f45cead5efd4a49a0d684afd8254447fa6ac2896cda156c2","observation_id":"a0f4fe70-f79e-40d6-8365-dd73cc9af712","resolution":{"observed_at":"2026-08-03T03:49:16.641106Z","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-03T03:49:16.704112Z","title":"New ramsey multiplicity bounds and search heuristics.Foundations of Computational Mathematics, 25(5):1777–1814, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:16.704112Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:8b14886844b0f6bde8155f0c0d250215a6f08be9d0f66eb0b66bf5aa14cd4191","observation_id":"bb8792ab-df2f-4f72-857e-47e12c728d8b","resolution":{"observed_at":"2026-08-03T03:49:16.704112Z","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-03T03:49:16.747422Z","title":"On threshold circuits for parity","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:16.747422Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:f9d380e197581aaccea4e1c98f6fd5db5017894c16ef0fa6d6a5aea52ff8de36","observation_id":"7cd586c7-33bd-4320-970b-edab6e6778cb","resolution":{"observed_at":"2026-08-03T03:49:16.747422Z","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-03T03:49:16.805819Z","title":"Using large-scale experiments and machine learning to discover theories of human decision-making.Science, 372(6547):1209– 1214, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:16.805819Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:4f1764f622525f5cfb56180000bcd2186e0f54825d818315f1fe5d2c076bbdde","observation_id":"2d6ea2f1-2249-4f7a-86db-f457fd50f383","resolution":{"observed_at":"2026-08-03T03:49:16.805819Z","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-03T03:49:16.829612Z","title":"Mathemati- cal discoveries from program search with large language models.Nature, 625(7995):468–475, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:16.829612Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:cda7da3ac122ff814165a38650aed6f6cdc6d854e1a9486cbaf27ca3ace0bdc7","observation_id":"41ac437a-4854-4ab2-9584-be5dffe75e22","resolution":{"observed_at":"2026-08-03T03:49:16.829612Z","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-03T03:49:16.937703Z","title":"LLM-generated search heuristics can solve open in- stances of combinatorial design problems.MATH-AI Workshop at NeurIPS, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:16.937703Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:1457eda05b11d8218efbeb0a450308e10fc2638f1963d2f61643ca36a9a57fd9","observation_id":"962540be-3e05-41d7-91bd-30fdde0e745a","resolution":{"observed_at":"2026-08-03T03:49:16.937703Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.17725","last_updated":"2025-01-29T15:57:43Z","snapshot_observed_at":"2026-08-10T04:31:53.061479Z","submitted_at":"2025-01-29T15:57:43Z","title":"Using Code Generation to Solve Open Instances of Combinatorial Design Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.17725","snapshot_observed_at":"2026-08-03T03:49:16.974309Z","title":"Using code generation to solve open instances of combinatorial design problems.arXiv preprint arXiv:2501.17725, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:16.974309Z"},"links":{"cited_paper":"/paper/2501.17725","citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:9656e54355a82d5be618f264e25159ea7bfc5114d38739034151bc5658bff47a","observation_id":"587d4db1-a206-4a17-8df9-f3ffaed2e825","resolution":{"observed_at":"2026-08-03T03:49:16.974309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.23881","snapshot_observed_at":"2026-08-03T03:49:17.061731Z","title":"Using reasoning models to generate search heuristics that solve open instances of combinatorial design problems.arXiv preprint arXiv:2505.23881, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:17.061731Z"},"links":{"cited_paper":"/paper/2505.23881","citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:674aa6ed54df7fe3d28e841ad386b8593aba137b3d64a7baca1cb919d454b323","observation_id":"235b6e40-67d0-46dd-ac27-8af72ffc6bdb","resolution":{"observed_at":"2026-08-03T03:49:17.061731Z","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-03T03:49:17.107746Z","title":"Slicing the hypercube.Surveys in combinatorics, 1993:211– 255, 1993","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:17.107746Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:a74ff4b1f2220da7f8035bf661edebcbee309ec6ec0c7ea2a108210103368c64","observation_id":"4ffaadb0-ef13-4ccc-a3ad-fa483caafd56","resolution":{"observed_at":"2026-08-03T03:49:17.107746Z","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-03T03:49:17.201645Z","title":"Improved lower bound for hypercube edge slicing.arXiv preprint arXiv:2510.16592, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:17.201645Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:32d213f0e89fef86e1afa0ec6cdb2c54d115a972542ed4031d5a39cb9118dc65","observation_id":"1d76d4e4-3ba4-40e8-ab31-552b42843b5f","resolution":{"observed_at":"2026-08-03T03:49:17.201645Z","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-03T03:49:17.263858Z","title":"Nondegenerate hyperplane covers of the hypercube.arXiv preprint arXiv:2507.00773, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:17.263858Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:97e6be5022a041d8634cac6155227aa7e06a3209fbabe52ff54db9e5363c0e0d","observation_id":"3c6785f7-4a1e-4e92-b060-fded05703f89","resolution":{"observed_at":"2026-08-03T03:49:17.263858Z","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-03T03:49:17.345658Z","title":"Openevolve: an open-source evolutionary coding agent, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:17.345658Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:d4d78d2a59ef7416421a9fc9511b5cfc3f0ebc597bcf3edb3986dfbf5971dbc3","observation_id":"c932a536-e365-4b33-a21d-bf0d0f975b4e","resolution":{"observed_at":"2026-08-03T03:49:17.345658Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05199","last_updated":"2025-01-30T19:43:34Z","snapshot_observed_at":"2026-08-10T08:44:58.111811Z","submitted_at":"2025-01-30T19:43:34Z","title":"Advancing Geometry with AI: Multi-agent Generation of Polytopes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.05199","snapshot_observed_at":"2026-08-03T03:49:17.404619Z","title":"Advancing geometry with ai: Multi-agent generation of polytopes.arXiv preprint arXiv:2502.05199, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:17.404619Z"},"links":{"cited_paper":"/paper/2502.05199","citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:c1b1ce7017c4a206692311b553d2b2ccff6e8d5f9d94cd2441d382066829dbcb","observation_id":"12d76a2a-525c-497f-87ef-0e7ec7388a70","resolution":{"observed_at":"2026-08-03T03:49:17.404619Z","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-03T03:49:17.471366Z","title":"[Mastodon Post] - There are now sufficiently many dif- ferent examples of Erdos problems","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:17.471366Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:49308f206276c3874bb59afb529b88086c7023f8f42c0340ea2e49ca0f58bafb","observation_id":"9796b8a0-5b1e-47a3-9161-b98258196aea","resolution":{"observed_at":"2026-08-03T03:49:17.471366Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.05536","last_updated":"2021-02-17T11:17:04Z","snapshot_observed_at":"2026-08-11T03:21:43.568573Z","submitted_at":"2021-02-10T16:24:37Z","title":"Slicing the hypercube is not easy","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.05536","snapshot_observed_at":"2026-08-03T03:49:17.653268Z","title":"Slicing the hypercube is not easy.arXiv preprint arXiv:2102.05536, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:17.653268Z"},"links":{"cited_paper":"/paper/2102.05536","citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:f9bfaedf9627cc72fbd326dd7ec3c7fddde7c1fa1402aa73026b0d7956b4cc1c","observation_id":"d6654e96-bdc9-461e-a73b-d893b3244847","resolution":{"observed_at":"2026-08-03T03:49:17.653268Z","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-03T03:49:17.806164Z","title":"Computing cut numbers","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:17.806164Z"},"links":{"citing_paper":"/paper/2602.16807"},"observation_digest":"sha256:d293638f1d7def1b2255a9ea8b289a53a38006d4f2f5fe10ecb4d3e7c278d156","observation_id":"9ad1373f-d182-4007-8b37-81cc6b260d8a","resolution":{"observed_at":"2026-08-03T03:49:17.806164Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.16807","last_updated":"2026-06-29T19:18:24Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-09T06:03:54.962250Z","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":39,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":39},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2602.16807."}