{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YVTXOPA3NZ45H6WEEZRCRTMYIJ","short_pith_number":"pith:YVTXOPA3","schema_version":"1.0","canonical_sha256":"c567773c1b6e79d3fac4266228cd984279e33984d2ef93a64dd250416878b8df","source":{"kind":"arxiv","id":"2504.17861","version":1},"attestation_state":"computed","paper":{"title":"Efficient iterative techniques for solving tensor problems with the T-product","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Hamidreza Afshin, Malihe Nobakht Kooshkghazi, Salman Ahmadi-Asl","submitted_at":"2025-04-24T18:06:06Z","abstract_excerpt":"This paper presents iterative methods for solving tensor equations involving the T-product. The proposed approaches apply tensor computations without matrix construction. For each initial tensor, these algorithms solve related problems in a finite number of iterations, with negligible errors. The theoretical analysis is validated by numerical examples that demonstrate the practicality and effectiveness of these algorithms."},"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":"2504.17861","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-04-24T18:06:06Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"06c09f2dc8b7621dd3675885c559d771669091de49579abe00ea9e295946f6d5","abstract_canon_sha256":"476c2374a6a06a67f6b8fd26edfa1d2e36d8c8c19812fe2de5e402af0f454e5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:57.269575Z","signature_b64":"w50Fb5VjBDMvX3hUPC7sqR8qPTKoq94oidLDZv8LhdPJpSiHfnyPyHMs5UcVuNJNWC0we58VeMJo7eMuFvlUCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c567773c1b6e79d3fac4266228cd984279e33984d2ef93a64dd250416878b8df","last_reissued_at":"2026-07-05T10:53:57.269075Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:57.269075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient iterative techniques for solving tensor problems with the T-product","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Hamidreza Afshin, Malihe Nobakht Kooshkghazi, Salman Ahmadi-Asl","submitted_at":"2025-04-24T18:06:06Z","abstract_excerpt":"This paper presents iterative methods for solving tensor equations involving the T-product. The proposed approaches apply tensor computations without matrix construction. For each initial tensor, these algorithms solve related problems in a finite number of iterations, with negligible errors. The theoretical analysis is validated by numerical examples that demonstrate the practicality and effectiveness of these algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.17861","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.17861/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2504.17861","created_at":"2026-07-05T10:53:57.269132+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.17861v1","created_at":"2026-07-05T10:53:57.269132+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.17861","created_at":"2026-07-05T10:53:57.269132+00:00"},{"alias_kind":"pith_short_12","alias_value":"YVTXOPA3NZ45","created_at":"2026-07-05T10:53:57.269132+00:00"},{"alias_kind":"pith_short_16","alias_value":"YVTXOPA3NZ45H6WE","created_at":"2026-07-05T10:53:57.269132+00:00"},{"alias_kind":"pith_short_8","alias_value":"YVTXOPA3","created_at":"2026-07-05T10:53:57.269132+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.15970","citing_title":"Copositive Matrices with Ordered Off-Diagonal Entries","ref_index":213,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YVTXOPA3NZ45H6WEEZRCRTMYIJ","json":"https://pith.science/pith/YVTXOPA3NZ45H6WEEZRCRTMYIJ.json","graph_json":"https://pith.science/api/pith-number/YVTXOPA3NZ45H6WEEZRCRTMYIJ/graph.json","events_json":"https://pith.science/api/pith-number/YVTXOPA3NZ45H6WEEZRCRTMYIJ/events.json","paper":"https://pith.science/paper/YVTXOPA3"},"agent_actions":{"view_html":"https://pith.science/pith/YVTXOPA3NZ45H6WEEZRCRTMYIJ","download_json":"https://pith.science/pith/YVTXOPA3NZ45H6WEEZRCRTMYIJ.json","view_paper":"https://pith.science/paper/YVTXOPA3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.17861&json=true","fetch_graph":"https://pith.science/api/pith-number/YVTXOPA3NZ45H6WEEZRCRTMYIJ/graph.json","fetch_events":"https://pith.science/api/pith-number/YVTXOPA3NZ45H6WEEZRCRTMYIJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YVTXOPA3NZ45H6WEEZRCRTMYIJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YVTXOPA3NZ45H6WEEZRCRTMYIJ/action/storage_attestation","attest_author":"https://pith.science/pith/YVTXOPA3NZ45H6WEEZRCRTMYIJ/action/author_attestation","sign_citation":"https://pith.science/pith/YVTXOPA3NZ45H6WEEZRCRTMYIJ/action/citation_signature","submit_replication":"https://pith.science/pith/YVTXOPA3NZ45H6WEEZRCRTMYIJ/action/replication_record"}},"created_at":"2026-07-05T10:53:57.269132+00:00","updated_at":"2026-07-05T10:53:57.269132+00:00"}