{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5FG4JFSI7YQWCASXOQHTVWGOFY","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":"cb1d63feeba4ae8cef1a6c6f0007094fe976838eaa17afbb96b790737df2b838","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-23T22:53:42Z","title_canon_sha256":"aaed3ab44308892a1362474217b1686237ba89c6a8e76d8a3cc3b50f336fc93e"},"schema_version":"1.0","source":{"id":"1605.07234","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07234","created_at":"2026-05-18T01:13:46Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07234v1","created_at":"2026-05-18T01:13:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07234","created_at":"2026-05-18T01:13:46Z"},{"alias_kind":"pith_short_12","alias_value":"5FG4JFSI7YQW","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5FG4JFSI7YQWCASX","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5FG4JFSI","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:768c9d4e4e816ec33156621bb9ea26ad6fe8342988143229682a923675659a6a","target":"graph","created_at":"2026-05-18T01:13:46Z","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":"In this paper we study the {\\it bilinear assignment problem} (BAP) with size parameters $m$ and $n$, $m\\leq n$. BAP is a generalization of the well known quadratic assignment problem and the three dimensional assignment problem and hence NP-hard. We show that BAP cannot be approximated within a constant factor unless P=NP even if the associated quadratic cost matrix $Q$ is diagonal. Further, we show that BAP remains NP-hard if $m = O(\\sqrt[r]{n})$, for some fixed $r$, but is solvable in polynomial time if $m = O(\\sqrt{\\log n})$. When the rank of $Q$ is fixed, BAP is observed to admit FPTAS and","authors_text":"Abraham P. Punnen, Ante \\'Custi\\'c, Binay Bhattacharya, Vladyslav Sokol","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-23T22:53:42Z","title":"The Bilinear Assignment Problem: Complexity and polynomially solvable special cases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07234","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:dbb85a09026f17c23593ec3be18179d165bff583655dac7a9ba5a5e369aa2388","target":"record","created_at":"2026-05-18T01:13:46Z","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":"cb1d63feeba4ae8cef1a6c6f0007094fe976838eaa17afbb96b790737df2b838","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-23T22:53:42Z","title_canon_sha256":"aaed3ab44308892a1362474217b1686237ba89c6a8e76d8a3cc3b50f336fc93e"},"schema_version":"1.0","source":{"id":"1605.07234","kind":"arxiv","version":1}},"canonical_sha256":"e94dc49648fe21610257740f3ad8ce2e13f68bff1bf830d8b62e53222600ee67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e94dc49648fe21610257740f3ad8ce2e13f68bff1bf830d8b62e53222600ee67","first_computed_at":"2026-05-18T01:13:46.608107Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:46.608107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FRyLLFItyUc0f2mKQESESlzeKqveKXjtFgN1gPMkjpCf0LvkkBiuFgiKVhdI0rBHwBk0/o4QkJ5XPZrmlcVCAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:46.608809Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.07234","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbb85a09026f17c23593ec3be18179d165bff583655dac7a9ba5a5e369aa2388","sha256:768c9d4e4e816ec33156621bb9ea26ad6fe8342988143229682a923675659a6a"],"state_sha256":"edc9c68363dbf4e676678f2b0f61fa6aeb26dc5106ddb8dd6492def19061a417"}