{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JSDZ3WMN2OTJP5UCGIWG2D7OFL","short_pith_number":"pith:JSDZ3WMN","schema_version":"1.0","canonical_sha256":"4c879dd98dd3a697f682322c6d0fee2ade9ee4969ab1f5911351b6005f8bb2cd","source":{"kind":"arxiv","id":"1705.10081","version":3},"attestation_state":"computed","paper":{"title":"Affine maps between quadratic assignment polytopes and subgraph isomorphism polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.OC"],"primary_cat":"cs.CC","authors_text":"Aleksandr Maksimenko","submitted_at":"2017-05-29T09:03:47Z","abstract_excerpt":"We consider two polytopes. The quadratic assignment polytope $QAP(n)$ is the convex hull of the set of tensors $x\\otimes x$, $x \\in P_n$, where $P_n$ is the set of $n\\times n$ permutation matrices. The second polytope is defined as follows. For every permutation of vertices of the complete graph $K_n$ we consider appropriate $\\binom{n}{2} \\times \\binom{n}{2}$ permutation matrix of the edges of $K_n$. The Young polytope $P((n-2,2))$ is the convex hull of all such matrices.\n  In 2009, S. Onn showed that the subgraph isomorphism problem can be reduced to optimization both over $QAP(n)$ and over $"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1705.10081","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-05-29T09:03:47Z","cross_cats_sorted":["cs.DM","math.CO","math.OC"],"title_canon_sha256":"194d074bcfcc2b6a806112c895cc3a231aeb561774ec085b31178dee48613297","abstract_canon_sha256":"fb1288ec402a717d60fa53303c7e65ca9410b41e08dc0f2fbfdf3693e780a4b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:11.923902Z","signature_b64":"ofXzMjUHT7ivShCLGN3JZ0dBNbvMqo+LUhRkZ1ZnA7hbikKJU+2RLgcfEkbIhea4J2eBdgF5jAAE7KgzbQfVAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c879dd98dd3a697f682322c6d0fee2ade9ee4969ab1f5911351b6005f8bb2cd","last_reissued_at":"2026-05-18T00:42:11.923441Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:11.923441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Affine maps between quadratic assignment polytopes and subgraph isomorphism polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.OC"],"primary_cat":"cs.CC","authors_text":"Aleksandr Maksimenko","submitted_at":"2017-05-29T09:03:47Z","abstract_excerpt":"We consider two polytopes. The quadratic assignment polytope $QAP(n)$ is the convex hull of the set of tensors $x\\otimes x$, $x \\in P_n$, where $P_n$ is the set of $n\\times n$ permutation matrices. The second polytope is defined as follows. For every permutation of vertices of the complete graph $K_n$ we consider appropriate $\\binom{n}{2} \\times \\binom{n}{2}$ permutation matrix of the edges of $K_n$. The Young polytope $P((n-2,2))$ is the convex hull of all such matrices.\n  In 2009, S. Onn showed that the subgraph isomorphism problem can be reduced to optimization both over $QAP(n)$ and over $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10081","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.10081","created_at":"2026-05-18T00:42:11.923514+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.10081v3","created_at":"2026-05-18T00:42:11.923514+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10081","created_at":"2026-05-18T00:42:11.923514+00:00"},{"alias_kind":"pith_short_12","alias_value":"JSDZ3WMN2OTJ","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JSDZ3WMN2OTJP5UC","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JSDZ3WMN","created_at":"2026-05-18T12:31:24.725408+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JSDZ3WMN2OTJP5UCGIWG2D7OFL","json":"https://pith.science/pith/JSDZ3WMN2OTJP5UCGIWG2D7OFL.json","graph_json":"https://pith.science/api/pith-number/JSDZ3WMN2OTJP5UCGIWG2D7OFL/graph.json","events_json":"https://pith.science/api/pith-number/JSDZ3WMN2OTJP5UCGIWG2D7OFL/events.json","paper":"https://pith.science/paper/JSDZ3WMN"},"agent_actions":{"view_html":"https://pith.science/pith/JSDZ3WMN2OTJP5UCGIWG2D7OFL","download_json":"https://pith.science/pith/JSDZ3WMN2OTJP5UCGIWG2D7OFL.json","view_paper":"https://pith.science/paper/JSDZ3WMN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.10081&json=true","fetch_graph":"https://pith.science/api/pith-number/JSDZ3WMN2OTJP5UCGIWG2D7OFL/graph.json","fetch_events":"https://pith.science/api/pith-number/JSDZ3WMN2OTJP5UCGIWG2D7OFL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JSDZ3WMN2OTJP5UCGIWG2D7OFL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JSDZ3WMN2OTJP5UCGIWG2D7OFL/action/storage_attestation","attest_author":"https://pith.science/pith/JSDZ3WMN2OTJP5UCGIWG2D7OFL/action/author_attestation","sign_citation":"https://pith.science/pith/JSDZ3WMN2OTJP5UCGIWG2D7OFL/action/citation_signature","submit_replication":"https://pith.science/pith/JSDZ3WMN2OTJP5UCGIWG2D7OFL/action/replication_record"}},"created_at":"2026-05-18T00:42:11.923514+00:00","updated_at":"2026-05-18T00:42:11.923514+00:00"}