{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:K2HBB2MSOLUGPJ7PEOPU34OD2O","short_pith_number":"pith:K2HBB2MS","schema_version":"1.0","canonical_sha256":"568e10e99272e867a7ef239f4df1c3d3acc2f17cb7c0598a942a6f8292941030","source":{"kind":"arxiv","id":"1208.5340","version":1},"attestation_state":"computed","paper":{"title":"New results of ant algorithms for the Linear Ordering 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, D. Dumitrescu","submitted_at":"2012-08-27T08:58:46Z","abstract_excerpt":"Ant-based algorithms are successful tools for solving complex problems. One of these problems is the Linear Ordering Problem (LOP). The paper shows new results on some LOP instances, using Ant Colony System (ACS) and the Step-Back Sensitive Ant Model (SB-SAM)."},"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.5340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-08-27T08:58:46Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"8d7c72edcd46e61f775b84d89b0c66d35c1f05d5b58efca3cb7f50bea1720e8a","abstract_canon_sha256":"ab501cf75af3e97313525744d08a8cfdcc3bf694fa7919731b4132fea6052b45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:59.722313Z","signature_b64":"LqqtgcxDFo9cpSPYigFSwdPKPINgpFEL7wYTt6iq0BZ8m2TK8+6EkNW5a3MP6l41Xm+ShRwrpF1Wr4gRnSczCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"568e10e99272e867a7ef239f4df1c3d3acc2f17cb7c0598a942a6f8292941030","last_reissued_at":"2026-05-18T03:46:59.721305Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:59.721305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New results of ant algorithms for the Linear Ordering 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, D. Dumitrescu","submitted_at":"2012-08-27T08:58:46Z","abstract_excerpt":"Ant-based algorithms are successful tools for solving complex problems. One of these problems is the Linear Ordering Problem (LOP). The paper shows new results on some LOP instances, using Ant Colony System (ACS) and the Step-Back Sensitive Ant Model (SB-SAM)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5340","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":"1208.5340","created_at":"2026-05-18T03:46:59.721505+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.5340v1","created_at":"2026-05-18T03:46:59.721505+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5340","created_at":"2026-05-18T03:46:59.721505+00:00"},{"alias_kind":"pith_short_12","alias_value":"K2HBB2MSOLUG","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"K2HBB2MSOLUGPJ7P","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"K2HBB2MS","created_at":"2026-05-18T12:27:11.947152+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/K2HBB2MSOLUGPJ7PEOPU34OD2O","json":"https://pith.science/pith/K2HBB2MSOLUGPJ7PEOPU34OD2O.json","graph_json":"https://pith.science/api/pith-number/K2HBB2MSOLUGPJ7PEOPU34OD2O/graph.json","events_json":"https://pith.science/api/pith-number/K2HBB2MSOLUGPJ7PEOPU34OD2O/events.json","paper":"https://pith.science/paper/K2HBB2MS"},"agent_actions":{"view_html":"https://pith.science/pith/K2HBB2MSOLUGPJ7PEOPU34OD2O","download_json":"https://pith.science/pith/K2HBB2MSOLUGPJ7PEOPU34OD2O.json","view_paper":"https://pith.science/paper/K2HBB2MS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.5340&json=true","fetch_graph":"https://pith.science/api/pith-number/K2HBB2MSOLUGPJ7PEOPU34OD2O/graph.json","fetch_events":"https://pith.science/api/pith-number/K2HBB2MSOLUGPJ7PEOPU34OD2O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K2HBB2MSOLUGPJ7PEOPU34OD2O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K2HBB2MSOLUGPJ7PEOPU34OD2O/action/storage_attestation","attest_author":"https://pith.science/pith/K2HBB2MSOLUGPJ7PEOPU34OD2O/action/author_attestation","sign_citation":"https://pith.science/pith/K2HBB2MSOLUGPJ7PEOPU34OD2O/action/citation_signature","submit_replication":"https://pith.science/pith/K2HBB2MSOLUGPJ7PEOPU34OD2O/action/replication_record"}},"created_at":"2026-05-18T03:46:59.721505+00:00","updated_at":"2026-05-18T03:46:59.721505+00:00"}