{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LEO5NOXQCSV3U3H26ZLZJWTIV5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8ebced344f86e38fa83c72583813077024443214f846ec08e413be7c1d926fe7","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-03-26T09:34:18Z","title_canon_sha256":"f2428bad487abfe13fbe586419ad597dc1ce26f224d5b705a6f4e077803af6da"},"schema_version":"1.0","source":{"id":"2603.25233","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.25233","created_at":"2026-07-15T01:20:58Z"},{"alias_kind":"arxiv_version","alias_value":"2603.25233v3","created_at":"2026-07-15T01:20:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.25233","created_at":"2026-07-15T01:20:58Z"},{"alias_kind":"pith_short_12","alias_value":"LEO5NOXQCSV3","created_at":"2026-07-15T01:20:58Z"},{"alias_kind":"pith_short_16","alias_value":"LEO5NOXQCSV3U3H2","created_at":"2026-07-15T01:20:58Z"},{"alias_kind":"pith_short_8","alias_value":"LEO5NOXQ","created_at":"2026-07-15T01:20:58Z"}],"graph_snapshots":[{"event_id":"sha256:05a45c3e26c789e5975ed341a2cf4d06abbf036b97ec9480664d4c12b53e7d5a","target":"graph","created_at":"2026-07-15T01:20:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Numerical experiments show that the proposed solver achieves accuracy and iteration counts comparable to those of full-rank SI-DSA while substantially reducing memory usage and runtime, even for challenging multiscale problems in which the effective rank reaches 30-45% of the full rank."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the residual-based greedy angular subsampling combined with mild augmentation will preserve stability and convergence rate across all problem classes without problem-specific tuning or hidden post-hoc adjustments."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A sweep-based SI-DSA solver for the RTE uses mild space augmentation and residual-driven subsampling to match full-rank accuracy while cutting memory and runtime even when the effective rank reaches 30-45 percent of full rank."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A mild-augmentation approach lets rank-adaptive SI-DSA match full-rank accuracy for the radiative transfer equation while cutting memory and time."}],"snapshot_sha256":"b3828cf49c022330120c74e6751d352fdd1c8b56ae3d3bcfe48ee1970a8dfa3b"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2603.25233/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Low-rank methods have emerged as a promising strategy for reducing the memory footprint and computational cost of discrete-ordinates discretizations of the radiative transfer equation (RTE). However, most existing rank-adaptive approaches rely on rank-proportional space augmentation, which can negate efficiency gains when the effective solution rank becomes moderately large. To overcome this limitation, we develop a rank-adaptive sweep-based source iteration with diffusion synthetic acceleration (SI-DSA) for the first-order steady-state RTE. The core of our method is a sweep-based low-rank SI ","authors_text":"Wei Guo, Zhichao Peng","cross_cats":["cs.NA"],"headline":"A mild-augmentation approach lets rank-adaptive SI-DSA match full-rank accuracy for the radiative transfer equation while cutting memory and time.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-03-26T09:34:18Z","title":"Highly Efficient Rank-Adaptive Sweep-based SI-DSA for the Radiative Transfer Equation via Mild Space Augmentation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.25233","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-15T00:40:06.996261Z","id":"3035510e-621e-46c0-91c8-b81069e49749","model_set":{"reader":"grok-4.3"},"one_line_summary":"A sweep-based SI-DSA solver for the RTE uses mild space augmentation and residual-driven subsampling to match full-rank accuracy while cutting memory and runtime even when the effective rank reaches 30-45 percent of full rank.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A mild-augmentation approach lets rank-adaptive SI-DSA match full-rank accuracy for the radiative transfer equation while cutting memory and time.","strongest_claim":"Numerical experiments show that the proposed solver achieves accuracy and iteration counts comparable to those of full-rank SI-DSA while substantially reducing memory usage and runtime, even for challenging multiscale problems in which the effective rank reaches 30-45% of the full rank.","weakest_assumption":"That the residual-based greedy angular subsampling combined with mild augmentation will preserve stability and convergence rate across all problem classes without problem-specific tuning or hidden post-hoc adjustments."}},"verdict_id":"3035510e-621e-46c0-91c8-b81069e49749"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:48cc0cb99c12590d336046d2bbcaf02eb4ff7ea2734ec78ed4ced7172f5740c6","target":"record","created_at":"2026-07-15T01:20:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8ebced344f86e38fa83c72583813077024443214f846ec08e413be7c1d926fe7","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-03-26T09:34:18Z","title_canon_sha256":"f2428bad487abfe13fbe586419ad597dc1ce26f224d5b705a6f4e077803af6da"},"schema_version":"1.0","source":{"id":"2603.25233","kind":"arxiv","version":3}},"canonical_sha256":"591dd6baf014abba6cfaf65794da68af683f128e0a22a290cb8f52e83261f60f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"591dd6baf014abba6cfaf65794da68af683f128e0a22a290cb8f52e83261f60f","first_computed_at":"2026-07-15T01:20:58.317173Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-15T01:20:58.317173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CIwhJ+q4cgsGKIWjC/tGS5ekVOVNZ7OyD4nkwAkJcH6YY4bh0rhOsqjBiNG04eMtIbdpNTcjjK4B924TqNlZBw==","signature_status":"signed_v1","signed_at":"2026-07-15T01:20:58.318026Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.25233","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48cc0cb99c12590d336046d2bbcaf02eb4ff7ea2734ec78ed4ced7172f5740c6","sha256:05a45c3e26c789e5975ed341a2cf4d06abbf036b97ec9480664d4c12b53e7d5a"],"state_sha256":"484ca366411db27ea8f513c2748df5767c29b7097154db6c6cb61aeb6fe8250e"}