{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TO2LGNUYR2TFCTGRJCP2QHV6NK","short_pith_number":"pith:TO2LGNUY","schema_version":"1.0","canonical_sha256":"9bb4b336988ea6514cd1489fa81ebe6a895a2ec3762119846eb2b658959679bd","source":{"kind":"arxiv","id":"1304.3792","version":1},"attestation_state":"computed","paper":{"title":"Solving Linear Equations Using a Jacobi Based Time-Variant Adaptive Hybrid Evolutionary Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"A. R. M. Jalal Uddin Jamali, Md. Bazlar Rahman, M. M. A. Hashem","submitted_at":"2013-04-13T09:12:07Z","abstract_excerpt":"Large set of linear equations, especially for sparse and structured coefficient (matrix) equations, solutions using classical methods become arduous. And evolutionary algorithms have mostly been used to solve various optimization and learning problems. Recently, hybridization of classical methods (Jacobi method and Gauss-Seidel method) with evolutionary computation techniques have successfully been applied in linear equation solving. In the both above hybrid evolutionary methods, uniform adaptation (UA) techniques are used to adapt relaxation factor. In this paper, a new Jacobi Based Time-Vari"},"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":"1304.3792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-04-13T09:12:07Z","cross_cats_sorted":[],"title_canon_sha256":"fd77a17e71bb06042c75bdeeecb41782709e9e5e4f6ca496bdb33bdfa3d4c50e","abstract_canon_sha256":"3f9782cdea851e7427abdea17ab0628d23645913e96376c916d84f3b5c022e75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:04.324565Z","signature_b64":"md+/tVYTVTOxkKlJUUXc+68Q8y0Cv+yQNCAaEuhQwKimXYzf2YJhvK0yoaNergKShID2USGWGwTEK7ti8lokCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bb4b336988ea6514cd1489fa81ebe6a895a2ec3762119846eb2b658959679bd","last_reissued_at":"2026-05-18T03:28:04.323684Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:04.323684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Linear Equations Using a Jacobi Based Time-Variant Adaptive Hybrid Evolutionary Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"A. R. M. Jalal Uddin Jamali, Md. Bazlar Rahman, M. M. A. Hashem","submitted_at":"2013-04-13T09:12:07Z","abstract_excerpt":"Large set of linear equations, especially for sparse and structured coefficient (matrix) equations, solutions using classical methods become arduous. And evolutionary algorithms have mostly been used to solve various optimization and learning problems. Recently, hybridization of classical methods (Jacobi method and Gauss-Seidel method) with evolutionary computation techniques have successfully been applied in linear equation solving. In the both above hybrid evolutionary methods, uniform adaptation (UA) techniques are used to adapt relaxation factor. In this paper, a new Jacobi Based Time-Vari"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3792","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":"1304.3792","created_at":"2026-05-18T03:28:04.323802+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.3792v1","created_at":"2026-05-18T03:28:04.323802+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3792","created_at":"2026-05-18T03:28:04.323802+00:00"},{"alias_kind":"pith_short_12","alias_value":"TO2LGNUYR2TF","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"TO2LGNUYR2TFCTGR","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"TO2LGNUY","created_at":"2026-05-18T12:28:02.375192+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/TO2LGNUYR2TFCTGRJCP2QHV6NK","json":"https://pith.science/pith/TO2LGNUYR2TFCTGRJCP2QHV6NK.json","graph_json":"https://pith.science/api/pith-number/TO2LGNUYR2TFCTGRJCP2QHV6NK/graph.json","events_json":"https://pith.science/api/pith-number/TO2LGNUYR2TFCTGRJCP2QHV6NK/events.json","paper":"https://pith.science/paper/TO2LGNUY"},"agent_actions":{"view_html":"https://pith.science/pith/TO2LGNUYR2TFCTGRJCP2QHV6NK","download_json":"https://pith.science/pith/TO2LGNUYR2TFCTGRJCP2QHV6NK.json","view_paper":"https://pith.science/paper/TO2LGNUY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.3792&json=true","fetch_graph":"https://pith.science/api/pith-number/TO2LGNUYR2TFCTGRJCP2QHV6NK/graph.json","fetch_events":"https://pith.science/api/pith-number/TO2LGNUYR2TFCTGRJCP2QHV6NK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TO2LGNUYR2TFCTGRJCP2QHV6NK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TO2LGNUYR2TFCTGRJCP2QHV6NK/action/storage_attestation","attest_author":"https://pith.science/pith/TO2LGNUYR2TFCTGRJCP2QHV6NK/action/author_attestation","sign_citation":"https://pith.science/pith/TO2LGNUYR2TFCTGRJCP2QHV6NK/action/citation_signature","submit_replication":"https://pith.science/pith/TO2LGNUYR2TFCTGRJCP2QHV6NK/action/replication_record"}},"created_at":"2026-05-18T03:28:04.323802+00:00","updated_at":"2026-05-18T03:28:04.323802+00:00"}