{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:R5IKN34YDOWLPIRW3HPB5RJ656","short_pith_number":"pith:R5IKN34Y","schema_version":"1.0","canonical_sha256":"8f50a6ef981bacb7a236d9de1ec53eefb09258f604e5e9763c80917dde2cac58","source":{"kind":"arxiv","id":"1303.7015","version":1},"attestation_state":"computed","paper":{"title":"A Multiobjective State Transition Algorithm for Single Machine Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT"],"primary_cat":"math.OC","authors_text":"Xiaojun Zhou","submitted_at":"2013-03-28T00:47:17Z","abstract_excerpt":"In this paper, a discrete state transition algorithm is introduced to solve a multiobjective single machine job shop scheduling problem. In the proposed approach, a non-dominated sort technique is used to select the best from a candidate state set, and a Pareto archived strategy is adopted to keep all the non-dominated solutions. Compared with the enumeration and other heuristics, experimental results have demonstrated the effectiveness of the multiobjective state transition algorithm."},"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":"1303.7015","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-28T00:47:17Z","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"title_canon_sha256":"cd5baad0e992dde48d44985585201ecb5bfc99586e57790011eda79f91c39915","abstract_canon_sha256":"a2a894ac07bc2a53b6a6ce6a18ab62ad33a8f2bbf82d59135589ca17c4b87287"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:42.087622Z","signature_b64":"3XXr5rSnR451oqnJ7+Q/EFEFECN5M2D9FDXHmkvTyGC/BN1D1F0MNW09SP24zmyHEDrIGGS1NSJ0D4ldWKr0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f50a6ef981bacb7a236d9de1ec53eefb09258f604e5e9763c80917dde2cac58","last_reissued_at":"2026-05-18T01:32:42.086928Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:42.086928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Multiobjective State Transition Algorithm for Single Machine Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT"],"primary_cat":"math.OC","authors_text":"Xiaojun Zhou","submitted_at":"2013-03-28T00:47:17Z","abstract_excerpt":"In this paper, a discrete state transition algorithm is introduced to solve a multiobjective single machine job shop scheduling problem. In the proposed approach, a non-dominated sort technique is used to select the best from a candidate state set, and a Pareto archived strategy is adopted to keep all the non-dominated solutions. Compared with the enumeration and other heuristics, experimental results have demonstrated the effectiveness of the multiobjective state transition algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.7015","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":"1303.7015","created_at":"2026-05-18T01:32:42.087032+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.7015v1","created_at":"2026-05-18T01:32:42.087032+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.7015","created_at":"2026-05-18T01:32:42.087032+00:00"},{"alias_kind":"pith_short_12","alias_value":"R5IKN34YDOWL","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"R5IKN34YDOWLPIRW","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"R5IKN34Y","created_at":"2026-05-18T12:27:57.521954+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/R5IKN34YDOWLPIRW3HPB5RJ656","json":"https://pith.science/pith/R5IKN34YDOWLPIRW3HPB5RJ656.json","graph_json":"https://pith.science/api/pith-number/R5IKN34YDOWLPIRW3HPB5RJ656/graph.json","events_json":"https://pith.science/api/pith-number/R5IKN34YDOWLPIRW3HPB5RJ656/events.json","paper":"https://pith.science/paper/R5IKN34Y"},"agent_actions":{"view_html":"https://pith.science/pith/R5IKN34YDOWLPIRW3HPB5RJ656","download_json":"https://pith.science/pith/R5IKN34YDOWLPIRW3HPB5RJ656.json","view_paper":"https://pith.science/paper/R5IKN34Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.7015&json=true","fetch_graph":"https://pith.science/api/pith-number/R5IKN34YDOWLPIRW3HPB5RJ656/graph.json","fetch_events":"https://pith.science/api/pith-number/R5IKN34YDOWLPIRW3HPB5RJ656/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R5IKN34YDOWLPIRW3HPB5RJ656/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R5IKN34YDOWLPIRW3HPB5RJ656/action/storage_attestation","attest_author":"https://pith.science/pith/R5IKN34YDOWLPIRW3HPB5RJ656/action/author_attestation","sign_citation":"https://pith.science/pith/R5IKN34YDOWLPIRW3HPB5RJ656/action/citation_signature","submit_replication":"https://pith.science/pith/R5IKN34YDOWLPIRW3HPB5RJ656/action/replication_record"}},"created_at":"2026-05-18T01:32:42.087032+00:00","updated_at":"2026-05-18T01:32:42.087032+00:00"}