{"as_of":"2026-08-17T08:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1d7ecf6fd3cde9de4b615e4f9140612ed849b3790f71d1215dc190b5dc66b0f5","coverage":[{"denominator":2,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:01:06.727099Z","state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:24:26.512685Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T21:11:20.703620Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.20607","last_updated":"2025-05-27T01:01:36Z","snapshot_observed_at":"2026-08-12T07:01:53.200620Z","submitted_at":"2025-05-27T01:01:36Z","title":"Strong Low Degree Hardness for the Number Partitioning Problem","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.20607","snapshot_observed_at":"2026-08-07T04:24:26.512685Z","title":"Strong low degree hardness for the number parti- tioning problem","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.10748","last_updated":"2025-06-12T14:35:26Z","snapshot_observed_at":"2026-08-14T18:28:43.937637Z","submitted_at":"2025-06-12T14:35:26Z","title":"Computational Complexity of Statistics: New Insights from Low-Degree Polynomials","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:26.512685Z"},"links":{"cited_paper":"/paper/2505.20607","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:595d9b383aa0e2100d62f77c03234019d43aaf8b2cfc347c8be9f237983bb06f","observation_id":"ed35b9c8-630c-4115-abc9-fcae816b3e19","resolution":{"observed_at":"2026-08-07T04:24:26.512685Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.20607","last_updated":"2025-05-27T01:01:36Z","snapshot_observed_at":"2026-08-12T07:01:53.200620Z","submitted_at":"2025-05-27T01:01:36Z","title":"Strong Low Degree Hardness for the Number Partitioning Problem","version":1},"cited_work":{"arxiv_id":"2505.20607","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.20607","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Strong Low Degree Hardness for the Number Parti- tioning Problem","venue":null,"work_id":"ccfb307c-2905-47ed-abdc-af666b526e0c","year":2025},"citing_paper":{"arxiv_id":"2605.05618","last_updated":"2026-05-07T03:17:33Z","snapshot_observed_at":"2026-08-14T18:29:33.852224Z","submitted_at":"2026-05-07T03:17:33Z","title":"Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-05-08T06:21:23.923750Z"},"links":{"cited_paper":"/paper/2505.20607","citing_paper":"/paper/2605.05618"},"observation_digest":"sha256:8966ede6f2cd669aba7ca936e223359ead4c26d21169f41271807a14c23ab051","observation_id":"744948e4-93fb-410d-b985-8ba7dd3a4f74","resolution":{"observed_at":"2026-05-11T21:11:20.706047Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.20607/citation-record","integrity":"/paper/2505.20607/integrity","json":"/paper/2505.20607/citation-record.json","paper":"/paper/2505.20607"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.16517","last_updated":"2025-07-28T02:24:56Z","snapshot_observed_at":"2026-08-17T04:38:01.754202Z","submitted_at":"2025-01-27T21:31:01Z","title":"Symmetric Perceptrons, Number Partitioning and Lattices","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.16517","snapshot_observed_at":"2026-08-07T14:01:06.727099Z","title":"Optimal low-degree hardness of maximum independent set,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.20607","last_updated":"2025-05-27T01:01:36Z","snapshot_observed_at":"2026-08-12T07:01:53.200620Z","submitted_at":"2025-05-27T01:01:36Z","title":"Strong Low Degree Hardness for the Number Partitioning Problem","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:06.727099Z"},"links":{"cited_paper":"/paper/2501.16517","citing_paper":"/paper/2505.20607"},"observation_digest":"sha256:a9d173798687f8d1b3f7a195f7603b1a1195ea244129a0680667291b189e27ca","observation_id":"7c90cd0d-e43b-47bd-a79b-0183754b622f","resolution":{"observed_at":"2026-08-07T14:01:06.727099Z","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-07T14:01:06.652048Z","title":"Tensor principal component analysis via sum-of-square proofs,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.20607","last_updated":"2025-05-27T01:01:36Z","snapshot_observed_at":"2026-08-12T07:01:53.200620Z","submitted_at":"2025-05-27T01:01:36Z","title":"Strong Low Degree Hardness for the Number Partitioning Problem","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-07T14:01:06.652048Z"},"links":{"citing_paper":"/paper/2505.20607"},"observation_digest":"sha256:ba775cc47057044cd7580cb5c00c6ef9988b20d3260eb4fd008200caf4f5e5f3","observation_id":"299d53d6-65a5-45fb-9c0e-3523e829b188","resolution":{"observed_at":"2026-08-07T14:01:06.652048Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.20607","last_updated":"2025-05-27T01:01:36Z","latest_version":1,"primary_category":"math.ST","snapshot_observed_at":"2026-08-12T07:01:53.200620Z","submitted_at":"2025-05-27T01:01:36Z","title":"Strong Low Degree Hardness for the Number Partitioning Problem"},"reference_resolution":{"displayed":2,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":2},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 2 of 2 outbound references and 2 inbound Pith citation observations for arXiv:2505.20607."}