{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SRCKO7MKV33DWMGZSUWNGAIFGR","short_pith_number":"pith:SRCKO7MK","schema_version":"1.0","canonical_sha256":"9444a77d8aaef63b30d9952cd301053463400d6a4f91146f8f51fc9a06e45f2f","source":{"kind":"arxiv","id":"2508.08557","version":1},"attestation_state":"computed","paper":{"title":"Fast adaptive tubal rank-revealing algorithm for t-product based tensor approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Jiehui Gu, Qiaohua Liu","submitted_at":"2025-08-12T01:51:34Z","abstract_excerpt":"Color images and video sequences can be modeled as three-way tensors, which admit low tubal-rank approximations via convex surrogate minimization. This optimization problem is efficiently addressed by tensor singular value thresholding (t-SVT). To mitigate the computational burden of tensor singular value decomposition (t-SVD) in each iteration, this paper introduces an adaptive randomized algorithm for tubal rank revelation in data tensors \\(\\mathcal{A}\\). Our method selectively captures the principal information from frontal slices in the Fourier domain using a predefined threshold, obviatin"},"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":"2508.08557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2025-08-12T01:51:34Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"e89484ea8e531eb435a9a031768726b5792f4ad82531a63bf0410d45f8a17bf6","abstract_canon_sha256":"ff0e3579eeb7750413abffb3d4b2c1a9be53b7eb20ffa44337bd32040773af2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:52:30.478542Z","signature_b64":"pUoU+APM+GO0K3aH7BSBR5OJqW3Sehs6siqzdtgK7YOLJ7XPBr2X1nHfcHLKCI/WSTLX5HNhAtWm5vPwOe0IBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9444a77d8aaef63b30d9952cd301053463400d6a4f91146f8f51fc9a06e45f2f","last_reissued_at":"2026-07-05T11:52:30.478096Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:52:30.478096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast adaptive tubal rank-revealing algorithm for t-product based tensor approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Jiehui Gu, Qiaohua Liu","submitted_at":"2025-08-12T01:51:34Z","abstract_excerpt":"Color images and video sequences can be modeled as three-way tensors, which admit low tubal-rank approximations via convex surrogate minimization. This optimization problem is efficiently addressed by tensor singular value thresholding (t-SVT). To mitigate the computational burden of tensor singular value decomposition (t-SVD) in each iteration, this paper introduces an adaptive randomized algorithm for tubal rank revelation in data tensors \\(\\mathcal{A}\\). Our method selectively captures the principal information from frontal slices in the Fourier domain using a predefined threshold, obviatin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.08557","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/2508.08557/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":"2508.08557","created_at":"2026-07-05T11:52:30.478154+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.08557v1","created_at":"2026-07-05T11:52:30.478154+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.08557","created_at":"2026-07-05T11:52:30.478154+00:00"},{"alias_kind":"pith_short_12","alias_value":"SRCKO7MKV33D","created_at":"2026-07-05T11:52:30.478154+00:00"},{"alias_kind":"pith_short_16","alias_value":"SRCKO7MKV33DWMGZ","created_at":"2026-07-05T11:52:30.478154+00:00"},{"alias_kind":"pith_short_8","alias_value":"SRCKO7MK","created_at":"2026-07-05T11:52:30.478154+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/SRCKO7MKV33DWMGZSUWNGAIFGR","json":"https://pith.science/pith/SRCKO7MKV33DWMGZSUWNGAIFGR.json","graph_json":"https://pith.science/api/pith-number/SRCKO7MKV33DWMGZSUWNGAIFGR/graph.json","events_json":"https://pith.science/api/pith-number/SRCKO7MKV33DWMGZSUWNGAIFGR/events.json","paper":"https://pith.science/paper/SRCKO7MK"},"agent_actions":{"view_html":"https://pith.science/pith/SRCKO7MKV33DWMGZSUWNGAIFGR","download_json":"https://pith.science/pith/SRCKO7MKV33DWMGZSUWNGAIFGR.json","view_paper":"https://pith.science/paper/SRCKO7MK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.08557&json=true","fetch_graph":"https://pith.science/api/pith-number/SRCKO7MKV33DWMGZSUWNGAIFGR/graph.json","fetch_events":"https://pith.science/api/pith-number/SRCKO7MKV33DWMGZSUWNGAIFGR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SRCKO7MKV33DWMGZSUWNGAIFGR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SRCKO7MKV33DWMGZSUWNGAIFGR/action/storage_attestation","attest_author":"https://pith.science/pith/SRCKO7MKV33DWMGZSUWNGAIFGR/action/author_attestation","sign_citation":"https://pith.science/pith/SRCKO7MKV33DWMGZSUWNGAIFGR/action/citation_signature","submit_replication":"https://pith.science/pith/SRCKO7MKV33DWMGZSUWNGAIFGR/action/replication_record"}},"created_at":"2026-07-05T11:52:30.478154+00:00","updated_at":"2026-07-05T11:52:30.478154+00:00"}