{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BTF353BZ3VLIMWQFCCCGTTKHCE","short_pith_number":"pith:BTF353BZ","canonical_record":{"source":{"id":"1304.1222","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-04T01:30:23Z","cross_cats_sorted":[],"title_canon_sha256":"7742e7468268df7b3d3666492e93b63f2ea360f9e3513ba09a2592959967b7df","abstract_canon_sha256":"d1a3a5d50ec1fa863607cf308d86b2bc7c9abf64b8afe55906f509264ec30d71"},"schema_version":"1.0"},"canonical_sha256":"0ccbbeec39dd56865a05108469cd47112a5eddb6363288cfb6f363cf2bad8a07","source":{"kind":"arxiv","id":"1304.1222","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1222","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1222v2","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1222","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"pith_short_12","alias_value":"BTF353BZ3VLI","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BTF353BZ3VLIMWQF","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BTF353BZ","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BTF353BZ3VLIMWQFCCCGTTKHCE","target":"record","payload":{"canonical_record":{"source":{"id":"1304.1222","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-04T01:30:23Z","cross_cats_sorted":[],"title_canon_sha256":"7742e7468268df7b3d3666492e93b63f2ea360f9e3513ba09a2592959967b7df","abstract_canon_sha256":"d1a3a5d50ec1fa863607cf308d86b2bc7c9abf64b8afe55906f509264ec30d71"},"schema_version":"1.0"},"canonical_sha256":"0ccbbeec39dd56865a05108469cd47112a5eddb6363288cfb6f363cf2bad8a07","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:09.095471Z","signature_b64":"1irxA3rhbWmGZ0XNBwlt+lDbPCR/+xMdQe63ptX75dYZxcti+usMrf/jRQfyZjYszDYzkcREW92ykymMxaucBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ccbbeec39dd56865a05108469cd47112a5eddb6363288cfb6f363cf2bad8a07","last_reissued_at":"2026-05-18T02:41:09.094936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:09.094936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.1222","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:41:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d5IgZs/bfw8VITO2VaujxYwd3gsQRNajNYzvVJu3KG9SByXewyUosO73+O1zjm/VNTewXFa/iWllw0A2ZeDuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:04:16.970570Z"},"content_sha256":"402f06bc620f53f92c2f5d1d6d6113e265be1f189228046d19b0035bfa1b5088","schema_version":"1.0","event_id":"sha256:402f06bc620f53f92c2f5d1d6d6113e265be1f189228046d19b0035bfa1b5088"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BTF353BZ3VLIMWQFCCCGTTKHCE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Alternating minimal energy methods for linear systems in higher dimensions. Part II: Faster algorithm and application to nonsymmetric systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Dmitry V. Savostyanov, Sergey V. Dolgov","submitted_at":"2013-04-04T01:30:23Z","abstract_excerpt":"In this paper we accomplish the development of the fast rank-adaptive solver for tensor-structured symmetric positive definite linear systems in higher dimensions. In [arXiv:1301.6068] this problem is approached by alternating minimization of the energy function, which we combine with steps of the basis expansion in accordance with the steepest descent algorithm. In this paper we combine the same steps in such a way that the resulted algorithm works with one or two neighboring cores at a time. The recurrent interpretation of the algorithm allows to prove the global convergence and to estimate "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1222","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:41:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2cbEDCgnJymYbSpwDSKyvlqHHAv/Mv00sMyg7ixm1hI26wc6TFSU1h4cRK3wjKiL1ir62L1xG7KN5sn94CmfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:04:16.970909Z"},"content_sha256":"3b998a340eac92626b5511a89b309e21eff9fad1602c70c21452d263dcdc4ff1","schema_version":"1.0","event_id":"sha256:3b998a340eac92626b5511a89b309e21eff9fad1602c70c21452d263dcdc4ff1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BTF353BZ3VLIMWQFCCCGTTKHCE/bundle.json","state_url":"https://pith.science/pith/BTF353BZ3VLIMWQFCCCGTTKHCE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BTF353BZ3VLIMWQFCCCGTTKHCE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T06:04:16Z","links":{"resolver":"https://pith.science/pith/BTF353BZ3VLIMWQFCCCGTTKHCE","bundle":"https://pith.science/pith/BTF353BZ3VLIMWQFCCCGTTKHCE/bundle.json","state":"https://pith.science/pith/BTF353BZ3VLIMWQFCCCGTTKHCE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BTF353BZ3VLIMWQFCCCGTTKHCE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BTF353BZ3VLIMWQFCCCGTTKHCE","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":"d1a3a5d50ec1fa863607cf308d86b2bc7c9abf64b8afe55906f509264ec30d71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-04T01:30:23Z","title_canon_sha256":"7742e7468268df7b3d3666492e93b63f2ea360f9e3513ba09a2592959967b7df"},"schema_version":"1.0","source":{"id":"1304.1222","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1222","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1222v2","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1222","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"pith_short_12","alias_value":"BTF353BZ3VLI","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BTF353BZ3VLIMWQF","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BTF353BZ","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:3b998a340eac92626b5511a89b309e21eff9fad1602c70c21452d263dcdc4ff1","target":"graph","created_at":"2026-05-18T02:41:09Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper we accomplish the development of the fast rank-adaptive solver for tensor-structured symmetric positive definite linear systems in higher dimensions. In [arXiv:1301.6068] this problem is approached by alternating minimization of the energy function, which we combine with steps of the basis expansion in accordance with the steepest descent algorithm. In this paper we combine the same steps in such a way that the resulted algorithm works with one or two neighboring cores at a time. The recurrent interpretation of the algorithm allows to prove the global convergence and to estimate ","authors_text":"Dmitry V. Savostyanov, Sergey V. Dolgov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-04T01:30:23Z","title":"Alternating minimal energy methods for linear systems in higher dimensions. Part II: Faster algorithm and application to nonsymmetric systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1222","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:402f06bc620f53f92c2f5d1d6d6113e265be1f189228046d19b0035bfa1b5088","target":"record","created_at":"2026-05-18T02:41:09Z","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":"d1a3a5d50ec1fa863607cf308d86b2bc7c9abf64b8afe55906f509264ec30d71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-04T01:30:23Z","title_canon_sha256":"7742e7468268df7b3d3666492e93b63f2ea360f9e3513ba09a2592959967b7df"},"schema_version":"1.0","source":{"id":"1304.1222","kind":"arxiv","version":2}},"canonical_sha256":"0ccbbeec39dd56865a05108469cd47112a5eddb6363288cfb6f363cf2bad8a07","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ccbbeec39dd56865a05108469cd47112a5eddb6363288cfb6f363cf2bad8a07","first_computed_at":"2026-05-18T02:41:09.094936Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:09.094936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1irxA3rhbWmGZ0XNBwlt+lDbPCR/+xMdQe63ptX75dYZxcti+usMrf/jRQfyZjYszDYzkcREW92ykymMxaucBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:09.095471Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.1222","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:402f06bc620f53f92c2f5d1d6d6113e265be1f189228046d19b0035bfa1b5088","sha256:3b998a340eac92626b5511a89b309e21eff9fad1602c70c21452d263dcdc4ff1"],"state_sha256":"a10181b52bfec4cb6466d166c078f88c8d0ad62f704df856cc4d59a17af64f57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JAJaTjXPPyXiuOgjJSa7W/X8KaY852HQtTVtAmluFJY2wyriHOZN/I+/Wqkw2raqzx4AGK3Ki6OiaIBTxEmiBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T06:04:16.975506Z","bundle_sha256":"f91ba7c345d7985a6e940c58104308e65e1a496937eb4143de7bf16b66651853"}}