Pith. sign in

Paper Citation Record · LEDGER

Multiple Planted Structures Below $\sqrt{n}$: An SoS Integrality Gap and an SQ Lower Bound

As of 11 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2604.07278.

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

pith.paper-citation-record.v1
2604.07278 v1

Coverage vector

measured 17 of 17 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-05-10T17:38:17.755892Z

measured 17 of 17 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-11T06:34:44.6726+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

17 of 17 outbound references displayed

  • verified exact1
  • verified fuzzy15
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation e3e06cad-60e8-41f4-9ae7-79b0648af713 · outbound

This paper cites Cryptography from planted graphs: Security with logarithmic-size messages.

Multiple Planted Structures Below $\sqrt{n}$: An SoS Integrality Gap and an SQ Lower Bound Cryptography from planted graphs: Security with logarithmic-size messages

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-05-17T09:41:42.184756Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-05-10T17:38:17.755892Z digest=sha256:8499d331b8e9c23233e485808c8b26265954de11240847224355f80c4b318798

Observation 3e8796a5-b0a4-4c6a-bb8c-fe72a5e89ee0 · outbound

This paper cites Public-key cryptography from different as- sumptions.

Multiple Planted Structures Below $\sqrt{n}$: An SoS Integrality Gap and an SQ Lower Bound Public-key cryptography from different as- sumptions

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-05-17T09:41:42.187646Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-05-10T17:38:17.755892Z digest=sha256:5b3e1c7525ddd3003677e090ad038460507c2d51a0b415aba2e2ff1355e094fd

Observation b42cc35c-b48b-484a-8b53-f9e28ebcaeff · outbound

This paper cites Hopkins, Jonathan A.

Multiple Planted Structures Below $\sqrt{n}$: An SoS Integrality Gap and an SQ Lower Bound Hopkins, Jonathan A

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-05-17T09:41:42.198293Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-05-10T17:38:17.755892Z digest=sha256:a05945d353ca1ce9c8db8d27124ced8d153c8812846fed3a88c5a39a00322ed9

Observation b5027410-cc3a-48bf-b861-bdf507a2b1ba · outbound

This paper cites Furst, Jeffrey C.

Multiple Planted Structures Below $\sqrt{n}$: An SoS Integrality Gap and an SQ Lower Bound Furst, Jeffrey C

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-05-17T09:39:25.471365Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-05-10T17:38:17.755892Z digest=sha256:5d7431baf35a0188825742c0d0350469a5c44bfd2eb0adc97609dc4dd4a1c560

Observation bdf42242-38dc-4b73-9932-e4e1f0f272d1 · outbound

This paper cites Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent.

Multiple Planted Structures Below $\sqrt{n}$: An SoS Integrality Gap and an SQ Lower Bound Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent

Reference 5

Resolution
metadata mismatch
arxiv_id, observed 2026-05-11T06:25:59.081631Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-05-10T17:38:17.755892Z digest=sha256:39f76fdfcac85a293377228f735c36e4bbd0830050924a622e4cc3934cbd6d9c

Observation f2ad15bb-6a93-42bb-b2a3-8b80a16ab705 · outbound

This paper cites Almost-linear planted cliques elude the metropolis process.Random Struct.

Multiple Planted Structures Below $\sqrt{n}$: An SoS Integrality Gap and an SQ Lower Bound Almost-linear planted cliques elude the metropolis process.Random Struct

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-05-17T09:39:25.481491Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-05-10T17:38:17.755892Z digest=sha256:4feb94e908d7afd7026ea43430aa0bce178a3c2513f1c7f4cc5472297d5a2763

Observation 2431b5c1-d277-4ca3-829e-0cc127cce1b4 · outbound

This paper cites On the hardness of signaling.

Multiple Planted Structures Below $\sqrt{n}$: An SoS Integrality Gap and an SQ Lower Bound On the hardness of signaling

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-05-17T09:39:25.474355Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-05-10T17:38:17.755892Z digest=sha256:c7b0f3159e1fb4b7b1bb7d9c2b0509f8812dfcb197e43f8fd79c75e82bdbb878

Observation ca2622cb-9ba7-4354-b661-2f3c0e00de50 · outbound

This paper cites Finding and certifying a large hidden clique in a semirandom graph.Random Struct.

Multiple Planted Structures Below $\sqrt{n}$: An SoS Integrality Gap and an SQ Lower Bound Finding and certifying a large hidden clique in a semirandom graph.Random Struct

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-05-17T09:39:25.486615Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-05-10T17:38:17.755892Z digest=sha256:38e2b88b61fd45f85d4be3226b58712db69e234f18a32dd398fd3b7b7de26521

Observation 0e14fab8-3fcc-41a2-a513-2cbdb5175ac5 · outbound

This paper cites Vempala, and Ying Xiao.

Multiple Planted Structures Below $\sqrt{n}$: An SoS Integrality Gap and an SQ Lower Bound Vempala, and Ying Xiao

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-05-17T09:41:42.190892Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-05-10T17:38:17.755892Z digest=sha256:640ee4dd3270f592d6d6a901a296d68fb111aac78ac8a70f1d459ce492b8e446

Observation cc02d197-ae8d-489b-a19f-5658a779fcd8 · outbound

This paper cites Holland, Kathryn Blackmond Laskey, and Samuel Leinhardt.

Multiple Planted Structures Below $\sqrt{n}$: An SoS Integrality Gap and an SQ Lower Bound Holland, Kathryn Blackmond Laskey, and Samuel Leinhardt

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-05-17T09:39:25.466242Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-05-10T17:38:17.755892Z digest=sha256:ed2e43f9cd2930a0f67d099dc0ff3ec68ab64874090cd60f85c019fb3ae61d0d

Observation c377d730-4d40-4e60-8f9a-2c350ebba2d0 · outbound

This paper cites Large cliques elude the metropolis process.Random Structures & Algorithms, 3(4): 347–360.

Multiple Planted Structures Below $\sqrt{n}$: An SoS Integrality Gap and an SQ Lower Bound Large cliques elude the metropolis process.Random Structures & Algorithms, 3(4): 347–360

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-05-17T09:39:25.460986Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-05-10T17:38:17.755892Z digest=sha256:f1a05289aacf0d2e76996db333f0b0821ff4c3b2fcf3881a117b97b0fc7d2bc5

Observation badd5777-fe24-452e-a35b-7d508c9f4e3f · outbound

This paper cites Hiding cliques for cryptographic security.Des.

Multiple Planted Structures Below $\sqrt{n}$: An SoS Integrality Gap and an SQ Lower Bound Hiding cliques for cryptographic security.Des

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-05-17T09:39:25.453088Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-05-10T17:38:17.755892Z digest=sha256:be9e974bb11f75bb7f476d50a85442e583921c731e42d6e3cee0ee50a76120d7

Observation 6ba2cac6-a327-402e-9def-5ecc1b8c8d6b · outbound

This paper cites Efficient noise-tolerant learning from statistical queries.Journal of the ACM, 45(6): 983–1006.

Multiple Planted Structures Below $\sqrt{n}$: An SoS Integrality Gap and an SQ Lower Bound Efficient noise-tolerant learning from statistical queries.Journal of the ACM, 45(6): 983–1006

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-05-17T09:41:42.194770Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-05-10T17:38:17.755892Z digest=sha256:3c5d15b84bd8c912e92c6cc1db95cc96be147848fdd3c9740ae754907e77f82a

Observation 83e7cd25-1f4d-4e49-8fd3-cbbd60826b60 · outbound

This paper cites Vempala, Alexander S.

Multiple Planted Structures Below $\sqrt{n}$: An SoS Integrality Gap and an SQ Lower Bound Vempala, Alexander S

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-05-17T09:39:25.448736Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-05-10T17:38:17.755892Z digest=sha256:303bd7b849858cb391e8de4ff86b523723209b1848734d2e23844f10f94f9927

Observation 715b99b5-685c-4eb7-951c-2a888dae41d3 · outbound

This paper cites Expected complexity of graph partitioning problems.Discret.

Multiple Planted Structures Below $\sqrt{n}$: An SoS Integrality Gap and an SQ Lower Bound Expected complexity of graph partitioning problems.Discret

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-05-17T09:39:25.457083Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-05-10T17:38:17.755892Z digest=sha256:120a61afbd6f7ab0a5cfc6d3565e6eb2aed727dfa7526255edc3adce061ca68e

Observation dcdd6b0a-73dc-409c-ac7b-f37eb1582923 · outbound

This paper cites Sum-of-squares lower bounds for planted clique.

Multiple Planted Structures Below $\sqrt{n}$: An SoS Integrality Gap and an SQ Lower Bound Sum-of-squares lower bounds for planted clique

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-05-17T09:41:42.180472Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-05-10T17:38:17.755892Z digest=sha256:eeffe7aa3af9cb19f526430ec1121b994b87176baed798f7098a4e9f110ff19d

Observation 5a23b2a2-df56-4796-909f-a6419e79a023 · outbound

This paper cites Statistical Queries and Statistical Algorithms: Foundations and Applications.

Multiple Planted Structures Below $\sqrt{n}$: An SoS Integrality Gap and an SQ Lower Bound Statistical Queries and Statistical Algorithms: Foundations and Applications

Reference 17

Resolution
verified exact
arxiv_id, observed 2026-05-11T06:25:59.101765Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-05-10T17:38:17.755892Z digest=sha256:ccb6a68dba15316a4a63d8be1b172514b49e251ad836666c8ade67b7382453ac

Pith citing papers

No inbound Pith citation observations are available.