{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:H7MU36QD363GU5OKH6ILJ42XXG","short_pith_number":"pith:H7MU36QD","schema_version":"1.0","canonical_sha256":"3fd94dfa03dfb66a75ca3f90b4f357b9ba0fa00934e0621a7f2566375e586d82","source":{"kind":"arxiv","id":"1709.03793","version":1},"attestation_state":"computed","paper":{"title":"Opportunistic Self Organizing Migrating Algorithm for Real-Time Dynamic Traveling Salesman Problem","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Rohit Sharma, Shubham Dokania, Sunyam Bagga","submitted_at":"2017-09-12T11:47:07Z","abstract_excerpt":"Self Organizing Migrating Algorithm (SOMA) is a meta-heuristic algorithm based on the self-organizing behavior of individuals in a simulated social environment. SOMA performs iterative computations on a population of potential solutions in the given search space to obtain an optimal solution. In this paper, an Opportunistic Self Organizing Migrating Algorithm (OSOMA) has been proposed that introduces a novel strategy to generate perturbations effectively. This strategy allows the individual to span across more possible solutions and thus, is able to produce better solutions. A comprehensive an"},"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":"1709.03793","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NE","submitted_at":"2017-09-12T11:47:07Z","cross_cats_sorted":[],"title_canon_sha256":"5cb10b01640edbece24a1972fdc55d63e1474f41adb777e627b892a168ef6a95","abstract_canon_sha256":"685408a6d10ab86a3b4dd56155d085b774fbbde7bbf2d780785b812c6bb90469"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:29.462379Z","signature_b64":"wFL2+rEzk8mAiM/W5CGKCgo6TiFHLxMK+b5pJmC/1D4rOyiwPYmA+0r0FudcaCJ6oiLsgdj12ZgoSRHebWIiBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fd94dfa03dfb66a75ca3f90b4f357b9ba0fa00934e0621a7f2566375e586d82","last_reissued_at":"2026-05-18T00:35:29.461746Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:29.461746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Opportunistic Self Organizing Migrating Algorithm for Real-Time Dynamic Traveling Salesman Problem","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Rohit Sharma, Shubham Dokania, Sunyam Bagga","submitted_at":"2017-09-12T11:47:07Z","abstract_excerpt":"Self Organizing Migrating Algorithm (SOMA) is a meta-heuristic algorithm based on the self-organizing behavior of individuals in a simulated social environment. SOMA performs iterative computations on a population of potential solutions in the given search space to obtain an optimal solution. In this paper, an Opportunistic Self Organizing Migrating Algorithm (OSOMA) has been proposed that introduces a novel strategy to generate perturbations effectively. This strategy allows the individual to span across more possible solutions and thus, is able to produce better solutions. A comprehensive an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03793","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":"1709.03793","created_at":"2026-05-18T00:35:29.461845+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.03793v1","created_at":"2026-05-18T00:35:29.461845+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03793","created_at":"2026-05-18T00:35:29.461845+00:00"},{"alias_kind":"pith_short_12","alias_value":"H7MU36QD363G","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"H7MU36QD363GU5OK","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"H7MU36QD","created_at":"2026-05-18T12:31:18.294218+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/H7MU36QD363GU5OKH6ILJ42XXG","json":"https://pith.science/pith/H7MU36QD363GU5OKH6ILJ42XXG.json","graph_json":"https://pith.science/api/pith-number/H7MU36QD363GU5OKH6ILJ42XXG/graph.json","events_json":"https://pith.science/api/pith-number/H7MU36QD363GU5OKH6ILJ42XXG/events.json","paper":"https://pith.science/paper/H7MU36QD"},"agent_actions":{"view_html":"https://pith.science/pith/H7MU36QD363GU5OKH6ILJ42XXG","download_json":"https://pith.science/pith/H7MU36QD363GU5OKH6ILJ42XXG.json","view_paper":"https://pith.science/paper/H7MU36QD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.03793&json=true","fetch_graph":"https://pith.science/api/pith-number/H7MU36QD363GU5OKH6ILJ42XXG/graph.json","fetch_events":"https://pith.science/api/pith-number/H7MU36QD363GU5OKH6ILJ42XXG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H7MU36QD363GU5OKH6ILJ42XXG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H7MU36QD363GU5OKH6ILJ42XXG/action/storage_attestation","attest_author":"https://pith.science/pith/H7MU36QD363GU5OKH6ILJ42XXG/action/author_attestation","sign_citation":"https://pith.science/pith/H7MU36QD363GU5OKH6ILJ42XXG/action/citation_signature","submit_replication":"https://pith.science/pith/H7MU36QD363GU5OKH6ILJ42XXG/action/replication_record"}},"created_at":"2026-05-18T00:35:29.461845+00:00","updated_at":"2026-05-18T00:35:29.461845+00:00"}