{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LFEKG7KZOI5JZZRWJJCZCEQ2OY","short_pith_number":"pith:LFEKG7KZ","canonical_record":{"source":{"id":"1504.00703","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-02T22:31:41Z","cross_cats_sorted":[],"title_canon_sha256":"ae64ec22db35aabbea0ee5ee67bc8d7efc7efd87a96868276ddb4b382355ba09","abstract_canon_sha256":"3c1124b8aabc309d812fff6c898a8bcaaa7566c899d9693f261a469d0aa1c8f1"},"schema_version":"1.0"},"canonical_sha256":"5948a37d59723a9ce6364a4591121a7611684ea02d62c8fe36f86eee385833d7","source":{"kind":"arxiv","id":"1504.00703","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00703","created_at":"2026-05-18T00:56:12Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00703v5","created_at":"2026-05-18T00:56:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00703","created_at":"2026-05-18T00:56:12Z"},{"alias_kind":"pith_short_12","alias_value":"LFEKG7KZOI5J","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LFEKG7KZOI5JZZRW","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LFEKG7KZ","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LFEKG7KZOI5JZZRWJJCZCEQ2OY","target":"record","payload":{"canonical_record":{"source":{"id":"1504.00703","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-02T22:31:41Z","cross_cats_sorted":[],"title_canon_sha256":"ae64ec22db35aabbea0ee5ee67bc8d7efc7efd87a96868276ddb4b382355ba09","abstract_canon_sha256":"3c1124b8aabc309d812fff6c898a8bcaaa7566c899d9693f261a469d0aa1c8f1"},"schema_version":"1.0"},"canonical_sha256":"5948a37d59723a9ce6364a4591121a7611684ea02d62c8fe36f86eee385833d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:12.575389Z","signature_b64":"qOEN4ZZLSVrJvWnj/2huEWI5xw9JsfbDBHPHE+4H5W88WTnM4URMqesV/BFCsoZevLoYKFDDxMrxgWEenr77Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5948a37d59723a9ce6364a4591121a7611684ea02d62c8fe36f86eee385833d7","last_reissued_at":"2026-05-18T00:56:12.574825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:12.574825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.00703","source_version":5,"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-05-18T00:56:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I4jRO56lkukFnzm/uTSm2hEg0OzhAqOwfyeyjpdSLhDMfECPZ+YAiyiXaHxeNknWaGTsUdY/wuuCtYL6ALPoDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:07:52.283216Z"},"content_sha256":"34f0ca4031c9b9bc654b2cadcf5a1efb97fd23bc56826980935860bf5341ff79","schema_version":"1.0","event_id":"sha256:34f0ca4031c9b9bc654b2cadcf5a1efb97fd23bc56826980935860bf5341ff79"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LFEKG7KZOI5JZZRWJJCZCEQ2OY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The matching problem has no small symmetric SDP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Arefin Huq, Aurko Roy, Benjamin Weitz, Daniel Zink, G\\'abor Braun, Jonah Brown-Cohen, Prasad Raghavendra, Sebastian Pokutta","submitted_at":"2015-04-02T22:31:41Z","abstract_excerpt":"Yannakakis showed that the matching problem does not have a small symmetric linear program. Rothvo{\\ss} recently proved that any, not necessarily symmetric, linear program also has exponential size. It is natural to ask whether the matching problem can be expressed compactly in a framework such as semidefinite programming (SDP) that is more powerful than linear programming but still allows efficient optimization. We answer this question negatively for symmetric SDPs: any symmetric SDP for the matching problem has exponential size.\n  We also show that an O(k)-round Lasserre SDP relaxation for t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00703","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:56:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"us1/yMW6dPaVFEwMwQTqjbbmDoJ6edpNFanosYu9BDdbZKpMVhJl/41li4hXlSzb8F0T0mSBFdA+e5AIVkS9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:07:52.283943Z"},"content_sha256":"53ec19c4e70396ba0d47dd36da39065cb999b7760d7e9809e0805796c65e3422","schema_version":"1.0","event_id":"sha256:53ec19c4e70396ba0d47dd36da39065cb999b7760d7e9809e0805796c65e3422"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LFEKG7KZOI5JZZRWJJCZCEQ2OY/bundle.json","state_url":"https://pith.science/pith/LFEKG7KZOI5JZZRWJJCZCEQ2OY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LFEKG7KZOI5JZZRWJJCZCEQ2OY/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-05-27T07:07:52Z","links":{"resolver":"https://pith.science/pith/LFEKG7KZOI5JZZRWJJCZCEQ2OY","bundle":"https://pith.science/pith/LFEKG7KZOI5JZZRWJJCZCEQ2OY/bundle.json","state":"https://pith.science/pith/LFEKG7KZOI5JZZRWJJCZCEQ2OY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LFEKG7KZOI5JZZRWJJCZCEQ2OY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LFEKG7KZOI5JZZRWJJCZCEQ2OY","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":"3c1124b8aabc309d812fff6c898a8bcaaa7566c899d9693f261a469d0aa1c8f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-02T22:31:41Z","title_canon_sha256":"ae64ec22db35aabbea0ee5ee67bc8d7efc7efd87a96868276ddb4b382355ba09"},"schema_version":"1.0","source":{"id":"1504.00703","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00703","created_at":"2026-05-18T00:56:12Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00703v5","created_at":"2026-05-18T00:56:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00703","created_at":"2026-05-18T00:56:12Z"},{"alias_kind":"pith_short_12","alias_value":"LFEKG7KZOI5J","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LFEKG7KZOI5JZZRW","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LFEKG7KZ","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:53ec19c4e70396ba0d47dd36da39065cb999b7760d7e9809e0805796c65e3422","target":"graph","created_at":"2026-05-18T00:56:12Z","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"},"paper":{"abstract_excerpt":"Yannakakis showed that the matching problem does not have a small symmetric linear program. Rothvo{\\ss} recently proved that any, not necessarily symmetric, linear program also has exponential size. It is natural to ask whether the matching problem can be expressed compactly in a framework such as semidefinite programming (SDP) that is more powerful than linear programming but still allows efficient optimization. We answer this question negatively for symmetric SDPs: any symmetric SDP for the matching problem has exponential size.\n  We also show that an O(k)-round Lasserre SDP relaxation for t","authors_text":"Arefin Huq, Aurko Roy, Benjamin Weitz, Daniel Zink, G\\'abor Braun, Jonah Brown-Cohen, Prasad Raghavendra, Sebastian Pokutta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-02T22:31:41Z","title":"The matching problem has no small symmetric SDP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00703","kind":"arxiv","version":5},"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:34f0ca4031c9b9bc654b2cadcf5a1efb97fd23bc56826980935860bf5341ff79","target":"record","created_at":"2026-05-18T00:56:12Z","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":"3c1124b8aabc309d812fff6c898a8bcaaa7566c899d9693f261a469d0aa1c8f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-02T22:31:41Z","title_canon_sha256":"ae64ec22db35aabbea0ee5ee67bc8d7efc7efd87a96868276ddb4b382355ba09"},"schema_version":"1.0","source":{"id":"1504.00703","kind":"arxiv","version":5}},"canonical_sha256":"5948a37d59723a9ce6364a4591121a7611684ea02d62c8fe36f86eee385833d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5948a37d59723a9ce6364a4591121a7611684ea02d62c8fe36f86eee385833d7","first_computed_at":"2026-05-18T00:56:12.574825Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:12.574825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qOEN4ZZLSVrJvWnj/2huEWI5xw9JsfbDBHPHE+4H5W88WTnM4URMqesV/BFCsoZevLoYKFDDxMrxgWEenr77Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:12.575389Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.00703","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34f0ca4031c9b9bc654b2cadcf5a1efb97fd23bc56826980935860bf5341ff79","sha256:53ec19c4e70396ba0d47dd36da39065cb999b7760d7e9809e0805796c65e3422"],"state_sha256":"a83f3727cb7f5a0954704c99f88d99fbc8819f2b21928fea2f561201765d6113"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l+TFP8hGG8dyyZvrWb2L1nKCapbMADE+OpMxA/jSLinROaO62ThwKLk4LWh/OG06u+IiKZ/uMA7FL6VwP6FACg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:07:52.287598Z","bundle_sha256":"3442ceb478744a56c95f6d38add2c1d10e0899e8edc8c55dcbd51a94559eeaa0"}}