{"as_of":"2026-08-17T20:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e8ca056f9337ee0d0862a3a8bc556a755d6475c27392d181d3d1b5c936c32871","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:28:57.004447Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-02T05:56:40.120642Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1507.05136","last_updated":"2016-03-11T23:40:57Z","snapshot_observed_at":"2026-08-14T22:39:56.102564Z","submitted_at":"2015-07-18T00:32:28Z","title":"Tight Lower Bounds for Planted Clique in the Degree-4 SOS Program","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1507.05136","snapshot_observed_at":"2026-08-14T14:28:57.004447Z","title":"Tight lower b ounds for planted clique in the degree-4 sos program","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.06130","last_updated":"2020-05-19T01:20:43Z","snapshot_observed_at":"2026-08-17T16:18:00.469041Z","submitted_at":"2019-08-08T22:14:09Z","title":"Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries","version":2},"reference_index":1997,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:57.004447Z"},"links":{"cited_paper":"/paper/1507.05136","citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:fa7e3a80d3841c4e5686c44210a7acaf2679d88175b07f6d3b0424d426431cf6","observation_id":"48ddfe19-7e62-44d0-af97-5cbceb3e737a","resolution":{"observed_at":"2026-08-14T14:28:57.004447Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1507.05136","last_updated":"2016-03-11T23:40:57Z","snapshot_observed_at":"2026-08-14T22:39:56.102564Z","submitted_at":"2015-07-18T00:32:28Z","title":"Tight Lower Bounds for Planted Clique in the Degree-4 SOS Program","version":3},"cited_work":{"arxiv_id":"1507.05136","doi":null,"metadata_source":"pith","pith_arxiv_id":"1507.05136","snapshot_observed_at":"2026-07-02T05:56:40.120642Z","title":"Tight Lower Bounds for Planted Clique in the Degree-4 SOS Program","venue":"cs.DS","work_id":"e88eebc1-b053-426a-982d-3cb675bf7ea8","year":2015},"citing_paper":{"arxiv_id":"2607.00897","last_updated":"2026-07-01T13:02:12Z","snapshot_observed_at":"2026-08-14T20:26:06.599729Z","submitted_at":"2026-07-01T13:02:12Z","title":"Recovery of Planted Subgraphs","version":1},"reference_index":205,"source":"arxiv_source","source_observed_at":"2026-07-02T05:49:41.894386Z"},"links":{"cited_paper":"/paper/1507.05136","citing_paper":"/paper/2607.00897"},"observation_digest":"sha256:a1e56bd44a82ae4d796eaa253098332e146d8a6a5b2a852f7cdaa4f0e860e1db","observation_id":"dbe86fba-56a8-4567-8e7a-800d121a9b7a","resolution":{"observed_at":"2026-07-02T05:56:40.122170Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1507.05136","last_updated":"2016-03-11T23:40:57Z","snapshot_observed_at":"2026-08-14T22:39:56.102564Z","submitted_at":"2015-07-18T00:32:28Z","title":"Tight Lower Bounds for Planted Clique in the Degree-4 SOS Program","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1507.05136","snapshot_observed_at":"2026-08-01T19:10:33.606907Z","title":"arXiv preprint arXiv:1507.05136 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":206,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:33.606907Z"},"links":{"cited_paper":"/paper/1507.05136","citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:a8a4407319a1c7cf5548dd32e586ec6a4156cf8c71e69cf4e760c77f4f5f6e84","observation_id":"6636d498-b18b-4fb0-991a-053154994ea4","resolution":{"observed_at":"2026-08-01T19:10:33.606907Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1507.05136/citation-record","integrity":"/paper/1507.05136/integrity","json":"/paper/1507.05136/citation-record.json","paper":"/paper/1507.05136"},"outbound":[],"paper":{"arxiv_id":"1507.05136","last_updated":"2016-03-11T23:40:57Z","latest_version":3,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T22:39:56.102564Z","submitted_at":"2015-07-18T00:32:28Z","title":"Tight Lower Bounds for Planted Clique in the Degree-4 SOS Program"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1507.05136."}