{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:HIFTA6CQGDKEQQG7EGLEUGYCZX","short_pith_number":"pith:HIFTA6CQ","canonical_record":{"source":{"id":"2111.09250","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2021-11-17T17:31:25Z","cross_cats_sorted":[],"title_canon_sha256":"1ab2c24dc01499e0edbe39b754e3a378f20aa5c5af732300ee1eba88011a7a47","abstract_canon_sha256":"6ca64e77e79f3526a79210c18af999f03dba34bf85f7d10a80b5419e79cef0e0"},"schema_version":"1.0"},"canonical_sha256":"3a0b30785030d44840df21964a1b02cdc7c95eb608ad3a925bbd38cfd9d0b6f6","source":{"kind":"arxiv","id":"2111.09250","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.09250","created_at":"2026-07-05T03:32:59Z"},{"alias_kind":"arxiv_version","alias_value":"2111.09250v1","created_at":"2026-07-05T03:32:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.09250","created_at":"2026-07-05T03:32:59Z"},{"alias_kind":"pith_short_12","alias_value":"HIFTA6CQGDKE","created_at":"2026-07-05T03:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"HIFTA6CQGDKEQQG7","created_at":"2026-07-05T03:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"HIFTA6CQ","created_at":"2026-07-05T03:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:HIFTA6CQGDKEQQG7EGLEUGYCZX","target":"record","payload":{"canonical_record":{"source":{"id":"2111.09250","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2021-11-17T17:31:25Z","cross_cats_sorted":[],"title_canon_sha256":"1ab2c24dc01499e0edbe39b754e3a378f20aa5c5af732300ee1eba88011a7a47","abstract_canon_sha256":"6ca64e77e79f3526a79210c18af999f03dba34bf85f7d10a80b5419e79cef0e0"},"schema_version":"1.0"},"canonical_sha256":"3a0b30785030d44840df21964a1b02cdc7c95eb608ad3a925bbd38cfd9d0b6f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:32:59.652463Z","signature_b64":"gLsaFw2CXtOnC0eclUsk3JiIIYJkcb1yZD2sqcVq0zOPjPHWbSWmyKth8/sZUt3l0iqxq27WuM3aTuuxqhW6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a0b30785030d44840df21964a1b02cdc7c95eb608ad3a925bbd38cfd9d0b6f6","last_reissued_at":"2026-07-05T03:32:59.652038Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:32:59.652038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2111.09250","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:32:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IXV+TN+tDljBBIjwcK/ddKZAD4H92KAjxnmDrvEVAk6V/Ky+B5OsnMoxxQlPl09QtKdUFn66LqAk0eUM++dDDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T16:09:07.025344Z"},"content_sha256":"a524f5b1240d12ca3e0e4093ccd665bf79fc67828cf3fde1af1b931b03d7eea2","schema_version":"1.0","event_id":"sha256:a524f5b1240d12ca3e0e4093ccd665bf79fc67828cf3fde1af1b931b03d7eea2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:HIFTA6CQGDKEQQG7EGLEUGYCZX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sum-of-Squares Lower Bounds for Sparse Independent Set","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Aaron Potechin, Chris Jones, Goutham Rajendran, Jeff Xu, Madhur Tulsiani","submitted_at":"2021-11-17T17:31:25Z","abstract_excerpt":"The Sum-of-Squares (SoS) hierarchy of semidefinite programs is a powerful algorithmic paradigm which captures state-of-the-art algorithmic guarantees for a wide array of problems. In the average case setting, SoS lower bounds provide strong evidence of algorithmic hardness or information-computation gaps. Prior to this work, SoS lower bounds have been obtained for problems in the \"dense\" input regime, where the input is a collection of independent Rademacher or Gaussian random variables, while the sparse regime has remained out of reach. We make the first progress in this direction by obtainin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.09250","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.09250/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:32:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r3zcD4bsXT3A3b/Ayt2EW6/qXsXXLkWM2sfMbk6ZdgrXeBixB9Vlp28X84QO/ISEgV2kwOLjgLDZZy/O6UxjCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T16:09:07.026310Z"},"content_sha256":"e65dc54aa7ff19a55df21420fd2f6e29bc01cb7437c4dbd3dc1224db3460de5e","schema_version":"1.0","event_id":"sha256:e65dc54aa7ff19a55df21420fd2f6e29bc01cb7437c4dbd3dc1224db3460de5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HIFTA6CQGDKEQQG7EGLEUGYCZX/bundle.json","state_url":"https://pith.science/pith/HIFTA6CQGDKEQQG7EGLEUGYCZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HIFTA6CQGDKEQQG7EGLEUGYCZX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-15T16:09:07Z","links":{"resolver":"https://pith.science/pith/HIFTA6CQGDKEQQG7EGLEUGYCZX","bundle":"https://pith.science/pith/HIFTA6CQGDKEQQG7EGLEUGYCZX/bundle.json","state":"https://pith.science/pith/HIFTA6CQGDKEQQG7EGLEUGYCZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HIFTA6CQGDKEQQG7EGLEUGYCZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:HIFTA6CQGDKEQQG7EGLEUGYCZX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6ca64e77e79f3526a79210c18af999f03dba34bf85f7d10a80b5419e79cef0e0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2021-11-17T17:31:25Z","title_canon_sha256":"1ab2c24dc01499e0edbe39b754e3a378f20aa5c5af732300ee1eba88011a7a47"},"schema_version":"1.0","source":{"id":"2111.09250","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.09250","created_at":"2026-07-05T03:32:59Z"},{"alias_kind":"arxiv_version","alias_value":"2111.09250v1","created_at":"2026-07-05T03:32:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.09250","created_at":"2026-07-05T03:32:59Z"},{"alias_kind":"pith_short_12","alias_value":"HIFTA6CQGDKE","created_at":"2026-07-05T03:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"HIFTA6CQGDKEQQG7","created_at":"2026-07-05T03:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"HIFTA6CQ","created_at":"2026-07-05T03:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:e65dc54aa7ff19a55df21420fd2f6e29bc01cb7437c4dbd3dc1224db3460de5e","target":"graph","created_at":"2026-07-05T03:32:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2111.09250/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Sum-of-Squares (SoS) hierarchy of semidefinite programs is a powerful algorithmic paradigm which captures state-of-the-art algorithmic guarantees for a wide array of problems. In the average case setting, SoS lower bounds provide strong evidence of algorithmic hardness or information-computation gaps. Prior to this work, SoS lower bounds have been obtained for problems in the \"dense\" input regime, where the input is a collection of independent Rademacher or Gaussian random variables, while the sparse regime has remained out of reach. We make the first progress in this direction by obtainin","authors_text":"Aaron Potechin, Chris Jones, Goutham Rajendran, Jeff Xu, Madhur Tulsiani","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2021-11-17T17:31:25Z","title":"Sum-of-Squares Lower Bounds for Sparse Independent Set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.09250","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a524f5b1240d12ca3e0e4093ccd665bf79fc67828cf3fde1af1b931b03d7eea2","target":"record","created_at":"2026-07-05T03:32:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6ca64e77e79f3526a79210c18af999f03dba34bf85f7d10a80b5419e79cef0e0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2021-11-17T17:31:25Z","title_canon_sha256":"1ab2c24dc01499e0edbe39b754e3a378f20aa5c5af732300ee1eba88011a7a47"},"schema_version":"1.0","source":{"id":"2111.09250","kind":"arxiv","version":1}},"canonical_sha256":"3a0b30785030d44840df21964a1b02cdc7c95eb608ad3a925bbd38cfd9d0b6f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a0b30785030d44840df21964a1b02cdc7c95eb608ad3a925bbd38cfd9d0b6f6","first_computed_at":"2026-07-05T03:32:59.652038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:32:59.652038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gLsaFw2CXtOnC0eclUsk3JiIIYJkcb1yZD2sqcVq0zOPjPHWbSWmyKth8/sZUt3l0iqxq27WuM3aTuuxqhW6BA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:32:59.652463Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.09250","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a524f5b1240d12ca3e0e4093ccd665bf79fc67828cf3fde1af1b931b03d7eea2","sha256:e65dc54aa7ff19a55df21420fd2f6e29bc01cb7437c4dbd3dc1224db3460de5e"],"state_sha256":"53f71e5dd7534b7c95e9a075d0bb8657f09ccd8b8d83be154da3397d76bf7fb4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rzSes3LJju4PdFtsh3tRGL4IP7d3uiE7+1joI5QQXuqhZOwCZ95vACsB783Bfib2OEl23TNKezlUv+Xv2KfUAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T16:09:07.032908Z","bundle_sha256":"86bc32485458f7d098dfb0bbc340c1f7bc3e43c7abb1576293261bf11b4d7926"}}