{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:H5FAPEJSMTNO6NF42DXDJ2DQVL","short_pith_number":"pith:H5FAPEJS","canonical_record":{"source":{"id":"1403.7721","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-03-30T09:13:49Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c3778323d4f41eebb1bf7a36e0a9298f40a44241170af2358efa370c2a2350f8","abstract_canon_sha256":"478e4af9f8632fa1b2d59721ddf22a7ae385cd7a588823e5eef3af15d087b5b2"},"schema_version":"1.0"},"canonical_sha256":"3f4a07913264daef34bcd0ee34e870aacdb3ed84b401af45ba9af44a11f7e1a8","source":{"kind":"arxiv","id":"1403.7721","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.7721","created_at":"2026-05-18T02:55:12Z"},{"alias_kind":"arxiv_version","alias_value":"1403.7721v1","created_at":"2026-05-18T02:55:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.7721","created_at":"2026-05-18T02:55:12Z"},{"alias_kind":"pith_short_12","alias_value":"H5FAPEJSMTNO","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"H5FAPEJSMTNO6NF4","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"H5FAPEJS","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:H5FAPEJSMTNO6NF42DXDJ2DQVL","target":"record","payload":{"canonical_record":{"source":{"id":"1403.7721","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-03-30T09:13:49Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c3778323d4f41eebb1bf7a36e0a9298f40a44241170af2358efa370c2a2350f8","abstract_canon_sha256":"478e4af9f8632fa1b2d59721ddf22a7ae385cd7a588823e5eef3af15d087b5b2"},"schema_version":"1.0"},"canonical_sha256":"3f4a07913264daef34bcd0ee34e870aacdb3ed84b401af45ba9af44a11f7e1a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:12.571883Z","signature_b64":"1iRy/xHD7PNTu1zoOqKxbNxFh7xY4Yy1UULfn5oS1XSGPAFm1YGvXzM0tOD7aUvt+GlrbWSz8QIEH1pspcr4DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f4a07913264daef34bcd0ee34e870aacdb3ed84b401af45ba9af44a11f7e1a8","last_reissued_at":"2026-05-18T02:55:12.571455Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:12.571455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.7721","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-05-18T02:55:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yKUTRtE8zdi/DOexsnoAT7m9YwlmCIq/u9CNWksYErXoLTzIKn2xFrXRpWkERZUMaoTMPHmVCNiyu3fIzs3IAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:48:28.363787Z"},"content_sha256":"3831919949787a30b14316efafbe827cd5e75224c70033f14d24bacdd4a46f5e","schema_version":"1.0","event_id":"sha256:3831919949787a30b14316efafbe827cd5e75224c70033f14d24bacdd4a46f5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:H5FAPEJSMTNO6NF42DXDJ2DQVL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Konstantin Makarychev, Maxim Sviridenko, Rajsekar Manokaran","submitted_at":"2014-03-30T09:13:49Z","abstract_excerpt":"We show that for every positive $\\epsilon > 0$, unless NP $\\subset$ BPQP, it is impossible to approximate the maximum quadratic assignment problem within a factor better than $2^{\\log^{1-\\epsilon} n}$ by a reduction from the maximum label cover problem. Our result also implies that Approximate Graph Isomorphism is not robust and is in fact, $1 - \\epsilon$ vs $\\epsilon$ hard assuming the Unique Games Conjecture.\n  Then, we present an $O(\\sqrt{n})$-approximation algorithm for the problem based on rounding of the linear programming relaxation often used in the state of the art exact algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.7721","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":""},"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-18T02:55:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yDjfvka4xzetiAfcgFeqshgfT7EN/FDD+W++5AqvDdjOHPKneY04EL5+i40fdmxqZHlSaEkDNH08D5RfD6uoDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:48:28.364132Z"},"content_sha256":"a83ef5a326410a76076a757259722d6b45c25421a8df4455cdbca34dd6e31ed0","schema_version":"1.0","event_id":"sha256:a83ef5a326410a76076a757259722d6b45c25421a8df4455cdbca34dd6e31ed0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H5FAPEJSMTNO6NF42DXDJ2DQVL/bundle.json","state_url":"https://pith.science/pith/H5FAPEJSMTNO6NF42DXDJ2DQVL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H5FAPEJSMTNO6NF42DXDJ2DQVL/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-06-03T17:48:28Z","links":{"resolver":"https://pith.science/pith/H5FAPEJSMTNO6NF42DXDJ2DQVL","bundle":"https://pith.science/pith/H5FAPEJSMTNO6NF42DXDJ2DQVL/bundle.json","state":"https://pith.science/pith/H5FAPEJSMTNO6NF42DXDJ2DQVL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H5FAPEJSMTNO6NF42DXDJ2DQVL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:H5FAPEJSMTNO6NF42DXDJ2DQVL","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":"478e4af9f8632fa1b2d59721ddf22a7ae385cd7a588823e5eef3af15d087b5b2","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-03-30T09:13:49Z","title_canon_sha256":"c3778323d4f41eebb1bf7a36e0a9298f40a44241170af2358efa370c2a2350f8"},"schema_version":"1.0","source":{"id":"1403.7721","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.7721","created_at":"2026-05-18T02:55:12Z"},{"alias_kind":"arxiv_version","alias_value":"1403.7721v1","created_at":"2026-05-18T02:55:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.7721","created_at":"2026-05-18T02:55:12Z"},{"alias_kind":"pith_short_12","alias_value":"H5FAPEJSMTNO","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"H5FAPEJSMTNO6NF4","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"H5FAPEJS","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:a83ef5a326410a76076a757259722d6b45c25421a8df4455cdbca34dd6e31ed0","target":"graph","created_at":"2026-05-18T02:55: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":"We show that for every positive $\\epsilon > 0$, unless NP $\\subset$ BPQP, it is impossible to approximate the maximum quadratic assignment problem within a factor better than $2^{\\log^{1-\\epsilon} n}$ by a reduction from the maximum label cover problem. Our result also implies that Approximate Graph Isomorphism is not robust and is in fact, $1 - \\epsilon$ vs $\\epsilon$ hard assuming the Unique Games Conjecture.\n  Then, we present an $O(\\sqrt{n})$-approximation algorithm for the problem based on rounding of the linear programming relaxation often used in the state of the art exact algorithms.","authors_text":"Konstantin Makarychev, Maxim Sviridenko, Rajsekar Manokaran","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-03-30T09:13:49Z","title":"Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.7721","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:3831919949787a30b14316efafbe827cd5e75224c70033f14d24bacdd4a46f5e","target":"record","created_at":"2026-05-18T02:55: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":"478e4af9f8632fa1b2d59721ddf22a7ae385cd7a588823e5eef3af15d087b5b2","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-03-30T09:13:49Z","title_canon_sha256":"c3778323d4f41eebb1bf7a36e0a9298f40a44241170af2358efa370c2a2350f8"},"schema_version":"1.0","source":{"id":"1403.7721","kind":"arxiv","version":1}},"canonical_sha256":"3f4a07913264daef34bcd0ee34e870aacdb3ed84b401af45ba9af44a11f7e1a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f4a07913264daef34bcd0ee34e870aacdb3ed84b401af45ba9af44a11f7e1a8","first_computed_at":"2026-05-18T02:55:12.571455Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:12.571455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1iRy/xHD7PNTu1zoOqKxbNxFh7xY4Yy1UULfn5oS1XSGPAFm1YGvXzM0tOD7aUvt+GlrbWSz8QIEH1pspcr4DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:12.571883Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.7721","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3831919949787a30b14316efafbe827cd5e75224c70033f14d24bacdd4a46f5e","sha256:a83ef5a326410a76076a757259722d6b45c25421a8df4455cdbca34dd6e31ed0"],"state_sha256":"7ef1750a961c08eab68f2155199d47b729e1a72638625124da0d50a2e3dab017"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eT5MENCw3s+S1k0BRp0iDBGMXobkHUKAXDOFbabVA3UbL1oMQwJdqP8FU8nSSTW/ahRbEoRyxfgxFfO8ndq5Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:48:28.366075Z","bundle_sha256":"987753d929c8404e23a056467bd4a70d1780afcd40b62b001fb9b3cd8bce8d11"}}