{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:MG2L3IL4JQGJOCF6NKCHAGANGF","short_pith_number":"pith:MG2L3IL4","schema_version":"1.0","canonical_sha256":"61b4bda17c4c0c9708be6a8470180d314af0aac559ba7a8d14b9d98f90fbec12","source":{"kind":"arxiv","id":"1105.1999","version":1},"attestation_state":"computed","paper":{"title":"New Heuristic Rounding Approaches to the Quadratic Assignment Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Wajeb Gharibi, Yong Xia","submitted_at":"2011-05-10T17:17:11Z","abstract_excerpt":"Quadratic assignment problem is one of the great challenges in combinatorial optimization. It has many applications in Operations research and Computer Science. In this paper, the author extends the most-used rounding approach to a one-parametric optimization model for the quadratic assignment problems. A near-optimum parameter is also predestinated. The numerical experiments confirm the efficiency."},"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":"1105.1999","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-05-10T17:17:11Z","cross_cats_sorted":[],"title_canon_sha256":"550a37538064f4cb200087d2ff4b5a24e8f6d4b39eb89cef26daec036f47dbd3","abstract_canon_sha256":"496ab6e331e3a69400956f8c59070e87f64da5c39059f6ea942b62ed01ce1ae4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:30.144154Z","signature_b64":"tOG7wu5mcv4R9RZIGwlmLocA+C9TBLsVi3t1jkaS401rNP+y5LxpAQNpmIOvm1/HnmLU+73yD4py6TslzZa5Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61b4bda17c4c0c9708be6a8470180d314af0aac559ba7a8d14b9d98f90fbec12","last_reissued_at":"2026-05-18T04:22:30.143507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:30.143507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Heuristic Rounding Approaches to the Quadratic Assignment Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Wajeb Gharibi, Yong Xia","submitted_at":"2011-05-10T17:17:11Z","abstract_excerpt":"Quadratic assignment problem is one of the great challenges in combinatorial optimization. It has many applications in Operations research and Computer Science. In this paper, the author extends the most-used rounding approach to a one-parametric optimization model for the quadratic assignment problems. A near-optimum parameter is also predestinated. The numerical experiments confirm the efficiency."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1999","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1105.1999","created_at":"2026-05-18T04:22:30.143616+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.1999v1","created_at":"2026-05-18T04:22:30.143616+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1999","created_at":"2026-05-18T04:22:30.143616+00:00"},{"alias_kind":"pith_short_12","alias_value":"MG2L3IL4JQGJ","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"MG2L3IL4JQGJOCF6","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"MG2L3IL4","created_at":"2026-05-18T12:26:34.985390+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/MG2L3IL4JQGJOCF6NKCHAGANGF","json":"https://pith.science/pith/MG2L3IL4JQGJOCF6NKCHAGANGF.json","graph_json":"https://pith.science/api/pith-number/MG2L3IL4JQGJOCF6NKCHAGANGF/graph.json","events_json":"https://pith.science/api/pith-number/MG2L3IL4JQGJOCF6NKCHAGANGF/events.json","paper":"https://pith.science/paper/MG2L3IL4"},"agent_actions":{"view_html":"https://pith.science/pith/MG2L3IL4JQGJOCF6NKCHAGANGF","download_json":"https://pith.science/pith/MG2L3IL4JQGJOCF6NKCHAGANGF.json","view_paper":"https://pith.science/paper/MG2L3IL4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.1999&json=true","fetch_graph":"https://pith.science/api/pith-number/MG2L3IL4JQGJOCF6NKCHAGANGF/graph.json","fetch_events":"https://pith.science/api/pith-number/MG2L3IL4JQGJOCF6NKCHAGANGF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MG2L3IL4JQGJOCF6NKCHAGANGF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MG2L3IL4JQGJOCF6NKCHAGANGF/action/storage_attestation","attest_author":"https://pith.science/pith/MG2L3IL4JQGJOCF6NKCHAGANGF/action/author_attestation","sign_citation":"https://pith.science/pith/MG2L3IL4JQGJOCF6NKCHAGANGF/action/citation_signature","submit_replication":"https://pith.science/pith/MG2L3IL4JQGJOCF6NKCHAGANGF/action/replication_record"}},"created_at":"2026-05-18T04:22:30.143616+00:00","updated_at":"2026-05-18T04:22:30.143616+00:00"}