{"as_of":"2026-08-12T13:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aff1efd6749bd53195852e7bed2723899d62a370e47bbb499ccd1c06340a6698","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T12:32:39.756566Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2606.04257/citation-record","integrity":"/paper/2606.04257/integrity","json":"/paper/2606.04257/citation-record.json","paper":"/paper/2606.04257"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:32:36.100634Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:36.100634Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:9b8f3dcd182bc733461475468281aa4634adba5ca2afea74eb3cf5b1be301d71","observation_id":"73c3d7d4-e6be-4ed1-81e4-b6af4593d265","resolution":{"observed_at":"2026-08-02T12:32:36.100634Z","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-02T12:32:36.184797Z","title":"1, 2:1–2:54","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:36.184797Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:09124fbf3bc35f1ed0df9abd7a6c9970f1ca68dc80bbb51e141aff68377f8059","observation_id":"fd71eabd-d678-4e39-b4ca-a506d51003fc","resolution":{"observed_at":"2026-08-02T12:32:36.184797Z","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-02T12:32:36.272438Z","title":"Comput.35(2006), no","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:36.272438Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:0c94af69a26d6f3cc245dd5b3d02db739820fdcbc653a8878067d49ddedcae46","observation_id":"7fac7c37-5d52-439f-8660-6a5de6fe9512","resolution":{"observed_at":"2026-08-02T12:32:36.272438Z","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-02T12:32:36.393459Z","title":"Oliveira,Consistency of circuit lower bounds with bounded theories, Logical Methods in Computer Science16(2020), no","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:36.393459Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:0e00a1935286aa9baff00a2da3e7cb34703ee0d7f9f29de11357f4dc83f3e779","observation_id":"a56b098b-21e1-42e3-8431-3de3a8d9d3e1","resolution":{"observed_at":"2026-08-02T12:32:36.393459Z","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-02T12:32:36.481087Z","title":"Chaitin,Information-theoretic limitations of formal systems, JACM 21(1974), no","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:36.481087Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:6a21ea9c0caeb31f8bdfae6e34445c845d179a3a39ae285690439cf85848bfd9","observation_id":"81723992-0361-4c37-8257-438b5f3e7442","resolution":{"observed_at":"2026-08-02T12:32:36.481087Z","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-02T12:32:36.579631Z","title":"Oliveira,Reverse mathematics of complexity lower bounds, SIAM Journal on Computing (2024), To appear; preprint 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:36.579631Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:a1ca5e638321a10c69fae04b7fe6f60dbf1eff515d777b9a939643266491465a","observation_id":"809f13f8-dfa1-41f3-a47c-ed3f05c47cb2","resolution":{"observed_at":"2026-08-02T12:32:36.579631Z","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-02T12:32:36.640848Z","title":"Cook and Jan Kraj ´ ıˇ cek,Consequences of the provability of NP⊆P/poly, Journal of Symbolic Logic72(2007), no","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:36.640848Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:010a704757e779d73e2a64b66dca7d26cc68d75a42b46d8005cac750f58fa7c0","observation_id":"da8fc957-90ad-4f8f-a494-d8db11c99a01","resolution":{"observed_at":"2026-08-02T12:32:36.640848Z","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-02T12:32:36.739091Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:36.739091Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:c7edacf4acb6591eb670618182666230901910995dfd46260ceace24be8d3079","observation_id":"9c0d2e9c-a417-4a81-985a-b23ad8182de0","resolution":{"observed_at":"2026-08-02T12:32:36.739091Z","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-02T12:32:36.812975Z","title":"264, 2023, pp","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:36.812975Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:a87fdab150348c58ad75394a6f63ee3a58fb062d3d86d77559a4855328c129b8","observation_id":"5df0e5ad-c91e-4f64-a44b-9ae22f74bcb4","resolution":{"observed_at":"2026-08-02T12:32:36.812975Z","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-02T12:32:36.902973Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:36.902973Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:7c2cd4c96476e54f2c4ecd2aadd1d4abfc62954786ca031fe7a97ec9c2a38ee8","observation_id":"3fc59dd6-b1a8-4de1-ab57-20dcdec55af1","resolution":{"observed_at":"2026-08-02T12:32:36.902973Z","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-02T12:32:36.994011Z","title":"Math.28(1982), 191–209","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:36.994011Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:2a7a5f2596aa034b0c088d4b8c12b11a3368d62fc46bd7079e48196cde34997e","observation_id":"6d1d2fb2-f550-4fa6-b3ed-dd153b6ad229","resolution":{"observed_at":"2026-08-02T12:32:36.994011Z","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-02T12:32:37.150923Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:37.150923Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:13bd4086fdaab2bd0e5daf98544379963cd901995770864b92f3c0d67e31248b","observation_id":"6a76582d-81da-445e-ab90-efe47f68af6e","resolution":{"observed_at":"2026-08-02T12:32:37.150923Z","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-02T12:32:37.343686Z","title":"1, 20–40","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:37.343686Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:fa53dc82033dbb4e62a4517691298052f7b39ed94ca277dd94f39627cd7ae572","observation_id":"1b897cb0-2558-4e07-8522-84f13f589681","resolution":{"observed_at":"2026-08-02T12:32:37.343686Z","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-02T12:32:37.529781Z","title":"3, To appear","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:37.529781Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:8ea26fae1d1f29c93c7a9c8fea21d4cfac9f9f3b6d025e69f7699d8ce78deaa0","observation_id":"ffa1c475-fa45-4d7d-9a10-ab2b85526e2b","resolution":{"observed_at":"2026-08-02T12:32:37.529781Z","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-02T12:32:37.714761Z","title":"497, Cambridge University Press, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:37.714761Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:ef003ab5e897744d806a6374b890a7464eccb3ad9f700fd66758b0d1218666f9","observation_id":"3403bcd1-8bb8-46ca-8570-8e0f7b60a40e","resolution":{"observed_at":"2026-08-02T12:32:37.714761Z","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-02T12:32:37.828714Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:37.828714Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:1ca95def62dfec815340f2ff9cf5afa54447acccaf3e851a12b267de63b73a39","observation_id":"7612c0df-46a2-4668-a669-90521d285734","resolution":{"observed_at":"2026-08-02T12:32:37.828714Z","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-02T12:32:37.983841Z","title":null,"venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:37.983841Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:737653d6c63f5690653688cc9d72632de8cb35d08538b6e8012b1e7c4a0b4300","observation_id":"7d874fa9-67de-40ee-ad60-990b34ed3551","resolution":{"observed_at":"2026-08-02T12:32:37.983841Z","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-02T12:32:38.159862Z","title":"Oliveira,Unprovability of strong complexity lower bounds in bounded arithmetic, Proceedings of the 55th Annual ACM Symposium on Theory of Computing (STOC), 2023, pp","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:38.159862Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:e3145ae8d354b356f53eafa01da08e22deffb51de506ed309a71af37d467c0b6","observation_id":"b1389bfb-558a-49bc-bc17-f2c2936f754b","resolution":{"observed_at":"2026-08-02T12:32:38.159862Z","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-02T12:32:38.338611Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:38.338611Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:5ebca6b30c6ae2529bfd6b319ec6d231f6adea23ec2493c915d784bf2524c464","observation_id":"702c07e9-ac3a-4284-9d06-d0e01994654b","resolution":{"observed_at":"2026-08-02T12:32:38.338611Z","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-02T12:32:38.462274Z","title":"1243–1254","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:38.462274Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:489fd1104d714537c05c884dfe9620ca8f30a6ccae5502170c405fd09a1349b1","observation_id":"e1ff2f78-2191-4eb4-bb02-14a1dcc5120f","resolution":{"observed_at":"2026-08-02T12:32:38.462274Z","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-02T12:32:38.644990Z","title":"Colloquium Comput","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:38.644990Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:fdfa851ede79d9a7ee5653ece8ac7deff668d4d3b2ca11d018580c607df63fd7","observation_id":"a440a2b7-8a6b-44c5-9d9d-c333be634d5b","resolution":{"observed_at":"2026-08-02T12:32:38.644990Z","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-02T12:32:38.770021Z","title":"2, 102735","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:38.770021Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:1c30269b1dde04dcc77c5d5b2399a4e3706dfd1ba132f0553e49dcc44bc7798f","observation_id":"27f0365c-103b-499c-9339-046673e928c6","resolution":{"observed_at":"2026-08-02T12:32:38.770021Z","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-02T12:32:38.923227Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:38.923227Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:635b8673aab35cd6eda8e9127e7f33f76106b4c3903de4c5802e8d16bc3ce655","observation_id":"3c18c4f1-22f4-4d3c-8610-222d32acbbfa","resolution":{"observed_at":"2026-08-02T12:32:38.923227Z","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-02T12:32:39.004220Z","title":"120, Elsevier, 1986, pp","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:39.004220Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:783fa0fb3d6d010352d66dd69f9ba81038847e4e6a2051687c0686a8555f7613","observation_id":"2aaafc9c-e5f5-4777-91e8-926b3d65f447","resolution":{"observed_at":"2026-08-02T12:32:39.004220Z","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-02T12:32:39.154751Z","title":"Buss, ed.), Elsevier, 1998","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:39.154751Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:229f1bc8478055109361363ebef9a46b1b84057ebbeae0023f26c6aea3d5a1db","observation_id":"6f9f5fb1-50e6-418e-8d1a-af86ef2c1bf5","resolution":{"observed_at":"2026-08-02T12:32:39.154751Z","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-02T12:32:39.275131Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:39.275131Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:3f6c35d9bf56210354deaef2b4ce1eb5c3124f049c97f289453de8297f487486","observation_id":"79d5aff6-5b74-4f68-8efa-7578865e3653","resolution":{"observed_at":"2026-08-02T12:32:39.275131Z","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-02T12:32:39.398479Z","title":"Razborov,Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic, Izvestiya: Mathematics59(1995), no","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:39.398479Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:78a45fa2d0093de2ce288fbe81b993bd87258d2162c1b7a3c376ee13a0271bc8","observation_id":"ff89148d-9230-46e9-a50f-0983d7ca7cc3","resolution":{"observed_at":"2026-08-02T12:32:39.398479Z","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-02T12:32:39.523265Z","title":"Razborov and Steven Rudich,Natural proofs, STOC ’94: Proceed- ings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing,, (New York, NY: ACM Press), 1994, pp","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:39.523265Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:b0ea0c57f3067a0d163ebd66a541038e01ab5e1cacae863133fd3763d8e2927c","observation_id":"b80d3f14-1926-4027-9580-cbdeed5b4889","resolution":{"observed_at":"2026-08-02T12:32:39.523265Z","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-02T12:32:39.631650Z","title":"219, 2022, pp","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:39.631650Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:f81910e1197c04bc4504590892dc876d948e34492232daf956014ac6967a83df","observation_id":"df701f5b-260b-4b33-9439-abfd9dc651ff","resolution":{"observed_at":"2026-08-02T12:32:39.631650Z","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-02T12:32:39.756566Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-02T12:32:39.756566Z"},"links":{"citing_paper":"/paper/2606.04257"},"observation_digest":"sha256:9de7ab3ad972cb8720ba55023b7138face314b4c5a5c32bd49629489af040a78","observation_id":"f7ecce18-c03b-4b16-9445-ab8297e2c6fa","resolution":{"observed_at":"2026-08-02T12:32:39.756566Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.04257","last_updated":"2026-07-20T08:42:15Z","latest_version":2,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-02T12:32:34.974954Z","submitted_at":"2026-06-02T22:18:38Z","title":"Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":30,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":30},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2606.04257."}