{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ZGTP6CTZAG3EKSKHG6VR7GBG5E","short_pith_number":"pith:ZGTP6CTZ","schema_version":"1.0","canonical_sha256":"c9a6ff0a7901b645494737ab1f9826e9022c4e99781c8f1f7bc2604b13ea3791","source":{"kind":"arxiv","id":"1208.5333","version":2},"attestation_state":"computed","paper":{"title":"A hybrid ACO approach to the Matrix Bandwidth Minimization Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.AI","authors_text":"Camelia Chira, Camelia-M. Pintea, Gloria-C. Crisan","submitted_at":"2012-08-27T08:51:23Z","abstract_excerpt":"The evolution of the human society raises more and more difficult endeavors. For some of the real-life problems, the computing time-restriction enhances their complexity. The Matrix Bandwidth Minimization Problem (MBMP) seeks for a simultaneous permutation of the rows and the columns of a square matrix in order to keep its nonzero entries close to the main diagonal. The MBMP is a highly investigated P-complete problem, as it has broad applications in industry, logistics, artificial intelligence or information recovery. This paper describes a new attempt to use the Ant Colony Optimization frame"},"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":"1208.5333","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-08-27T08:51:23Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"67820748c3deccc33d72075221f1a22dbf71efc1f277805c72fc5339db4e432e","abstract_canon_sha256":"7d317c244308ba751f60dfd39b9515567c0309e69bf759f17a590654c260b1c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:31.360182Z","signature_b64":"9TjfTEv1eyKHmG3BqIzuljv1xEueF8fFYhcHv6embHqdYt6bu7dYOh3WsaG57NzxYP0Dph55K3YSFSeE3BVcBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9a6ff0a7901b645494737ab1f9826e9022c4e99781c8f1f7bc2604b13ea3791","last_reissued_at":"2026-05-18T03:45:31.359574Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:31.359574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A hybrid ACO approach to the Matrix Bandwidth Minimization Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.AI","authors_text":"Camelia Chira, Camelia-M. Pintea, Gloria-C. Crisan","submitted_at":"2012-08-27T08:51:23Z","abstract_excerpt":"The evolution of the human society raises more and more difficult endeavors. For some of the real-life problems, the computing time-restriction enhances their complexity. The Matrix Bandwidth Minimization Problem (MBMP) seeks for a simultaneous permutation of the rows and the columns of a square matrix in order to keep its nonzero entries close to the main diagonal. The MBMP is a highly investigated P-complete problem, as it has broad applications in industry, logistics, artificial intelligence or information recovery. This paper describes a new attempt to use the Ant Colony Optimization frame"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5333","kind":"arxiv","version":2},"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":"1208.5333","created_at":"2026-05-18T03:45:31.359672+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.5333v2","created_at":"2026-05-18T03:45:31.359672+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5333","created_at":"2026-05-18T03:45:31.359672+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZGTP6CTZAG3E","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZGTP6CTZAG3EKSKH","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZGTP6CTZ","created_at":"2026-05-18T12:27:30.460161+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/ZGTP6CTZAG3EKSKHG6VR7GBG5E","json":"https://pith.science/pith/ZGTP6CTZAG3EKSKHG6VR7GBG5E.json","graph_json":"https://pith.science/api/pith-number/ZGTP6CTZAG3EKSKHG6VR7GBG5E/graph.json","events_json":"https://pith.science/api/pith-number/ZGTP6CTZAG3EKSKHG6VR7GBG5E/events.json","paper":"https://pith.science/paper/ZGTP6CTZ"},"agent_actions":{"view_html":"https://pith.science/pith/ZGTP6CTZAG3EKSKHG6VR7GBG5E","download_json":"https://pith.science/pith/ZGTP6CTZAG3EKSKHG6VR7GBG5E.json","view_paper":"https://pith.science/paper/ZGTP6CTZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.5333&json=true","fetch_graph":"https://pith.science/api/pith-number/ZGTP6CTZAG3EKSKHG6VR7GBG5E/graph.json","fetch_events":"https://pith.science/api/pith-number/ZGTP6CTZAG3EKSKHG6VR7GBG5E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZGTP6CTZAG3EKSKHG6VR7GBG5E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZGTP6CTZAG3EKSKHG6VR7GBG5E/action/storage_attestation","attest_author":"https://pith.science/pith/ZGTP6CTZAG3EKSKHG6VR7GBG5E/action/author_attestation","sign_citation":"https://pith.science/pith/ZGTP6CTZAG3EKSKHG6VR7GBG5E/action/citation_signature","submit_replication":"https://pith.science/pith/ZGTP6CTZAG3EKSKHG6VR7GBG5E/action/replication_record"}},"created_at":"2026-05-18T03:45:31.359672+00:00","updated_at":"2026-05-18T03:45:31.359672+00:00"}