{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:7ACORWSFXHZYERRCZUIS76R76D","short_pith_number":"pith:7ACORWSF","canonical_record":{"source":{"id":"2411.11889","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SC","submitted_at":"2024-11-06T10:43:28Z","cross_cats_sorted":[],"title_canon_sha256":"3561351319146133e6f42ddc56f9eb529e2dbd545da7f6d32a0234c66b960081","abstract_canon_sha256":"14d92be12e8dda6a3940ad0734d98b991a65e61801f7bf55400f9e7b3ff4c9fa"},"schema_version":"1.0"},"canonical_sha256":"f804e8da45b9f3824622cd112ffa3ff0c7104fad63d6209ed02e1b57d8368ac3","source":{"kind":"arxiv","id":"2411.11889","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.11889","created_at":"2026-05-22T01:03:40Z"},{"alias_kind":"arxiv_version","alias_value":"2411.11889v1","created_at":"2026-05-22T01:03:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.11889","created_at":"2026-05-22T01:03:40Z"},{"alias_kind":"pith_short_12","alias_value":"7ACORWSFXHZY","created_at":"2026-05-22T01:03:40Z"},{"alias_kind":"pith_short_16","alias_value":"7ACORWSFXHZYERRC","created_at":"2026-05-22T01:03:40Z"},{"alias_kind":"pith_short_8","alias_value":"7ACORWSF","created_at":"2026-05-22T01:03:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:7ACORWSFXHZYERRCZUIS76R76D","target":"record","payload":{"canonical_record":{"source":{"id":"2411.11889","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SC","submitted_at":"2024-11-06T10:43:28Z","cross_cats_sorted":[],"title_canon_sha256":"3561351319146133e6f42ddc56f9eb529e2dbd545da7f6d32a0234c66b960081","abstract_canon_sha256":"14d92be12e8dda6a3940ad0734d98b991a65e61801f7bf55400f9e7b3ff4c9fa"},"schema_version":"1.0"},"canonical_sha256":"f804e8da45b9f3824622cd112ffa3ff0c7104fad63d6209ed02e1b57d8368ac3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:03:40.813148Z","signature_b64":"GRySqm+PijdhiTh+eukOqwdJ4ZIf/TRR454nLm8M0FMQN+5kfhoYFHNVQm6uXIPVneLe9aIJISYMf8LqUCiwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f804e8da45b9f3824622cd112ffa3ff0c7104fad63d6209ed02e1b57d8368ac3","last_reissued_at":"2026-05-22T01:03:40.812384Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:03:40.812384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.11889","source_version":1,"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-22T01:03:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"93RFcDy+c0vbsIjLwR4vGYG8DL9q0euFJ13Ygi3/FI2Z8KqNIKGs9SQWbWdpKkmdK7+Z5BGsoJ1Z1veFczW6Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:58:15.288462Z"},"content_sha256":"efd3401ec485a6301d789edad31b44b6fd1b5e420ec4cc8bc5b3ff08a902c181","schema_version":"1.0","event_id":"sha256:efd3401ec485a6301d789edad31b44b6fd1b5e420ec4cc8bc5b3ff08a902c181"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:7ACORWSFXHZYERRCZUIS76R76D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Symbolic Algorithm for Solving SLAEs with Multi-Diagonal Coefficient Matrices","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Milena Veneva","submitted_at":"2024-11-06T10:43:28Z","abstract_excerpt":"This paper presents a generalised symbolic algorithm for solving systems of linear algebraic equations with multi-diagonal coefficient matrices. The algorithm is given in a pseudocode. A theorem which gives the condition for correctness of the algorithm is formulated and proven. Formula for the complexity of the multi-diagonal numerical algorithm is obtained."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.11889","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/2411.11889/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"},"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-22T01:03:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v/vVnnIXXLWryrocKaza5/lEUJ5k5gWOTZOPIYfMMf/Wmyub41j2xbG2Z5dMDr44/6oBpDdTVOsAVwh1I0PFBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:58:15.288840Z"},"content_sha256":"171c7727e8f9eda98c84a0adda583029712e2ba78c957e50d2afb7254317af59","schema_version":"1.0","event_id":"sha256:171c7727e8f9eda98c84a0adda583029712e2ba78c957e50d2afb7254317af59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7ACORWSFXHZYERRCZUIS76R76D/bundle.json","state_url":"https://pith.science/pith/7ACORWSFXHZYERRCZUIS76R76D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7ACORWSFXHZYERRCZUIS76R76D/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-03T18:58:15Z","links":{"resolver":"https://pith.science/pith/7ACORWSFXHZYERRCZUIS76R76D","bundle":"https://pith.science/pith/7ACORWSFXHZYERRCZUIS76R76D/bundle.json","state":"https://pith.science/pith/7ACORWSFXHZYERRCZUIS76R76D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7ACORWSFXHZYERRCZUIS76R76D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:7ACORWSFXHZYERRCZUIS76R76D","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":"14d92be12e8dda6a3940ad0734d98b991a65e61801f7bf55400f9e7b3ff4c9fa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SC","submitted_at":"2024-11-06T10:43:28Z","title_canon_sha256":"3561351319146133e6f42ddc56f9eb529e2dbd545da7f6d32a0234c66b960081"},"schema_version":"1.0","source":{"id":"2411.11889","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.11889","created_at":"2026-05-22T01:03:40Z"},{"alias_kind":"arxiv_version","alias_value":"2411.11889v1","created_at":"2026-05-22T01:03:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.11889","created_at":"2026-05-22T01:03:40Z"},{"alias_kind":"pith_short_12","alias_value":"7ACORWSFXHZY","created_at":"2026-05-22T01:03:40Z"},{"alias_kind":"pith_short_16","alias_value":"7ACORWSFXHZYERRC","created_at":"2026-05-22T01:03:40Z"},{"alias_kind":"pith_short_8","alias_value":"7ACORWSF","created_at":"2026-05-22T01:03:40Z"}],"graph_snapshots":[{"event_id":"sha256:171c7727e8f9eda98c84a0adda583029712e2ba78c957e50d2afb7254317af59","target":"graph","created_at":"2026-05-22T01:03:40Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.11889/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents a generalised symbolic algorithm for solving systems of linear algebraic equations with multi-diagonal coefficient matrices. The algorithm is given in a pseudocode. A theorem which gives the condition for correctness of the algorithm is formulated and proven. Formula for the complexity of the multi-diagonal numerical algorithm is obtained.","authors_text":"Milena Veneva","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SC","submitted_at":"2024-11-06T10:43:28Z","title":"Symbolic Algorithm for Solving SLAEs with Multi-Diagonal Coefficient Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.11889","kind":"arxiv","version":1},"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:efd3401ec485a6301d789edad31b44b6fd1b5e420ec4cc8bc5b3ff08a902c181","target":"record","created_at":"2026-05-22T01:03:40Z","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":"14d92be12e8dda6a3940ad0734d98b991a65e61801f7bf55400f9e7b3ff4c9fa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SC","submitted_at":"2024-11-06T10:43:28Z","title_canon_sha256":"3561351319146133e6f42ddc56f9eb529e2dbd545da7f6d32a0234c66b960081"},"schema_version":"1.0","source":{"id":"2411.11889","kind":"arxiv","version":1}},"canonical_sha256":"f804e8da45b9f3824622cd112ffa3ff0c7104fad63d6209ed02e1b57d8368ac3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f804e8da45b9f3824622cd112ffa3ff0c7104fad63d6209ed02e1b57d8368ac3","first_computed_at":"2026-05-22T01:03:40.812384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:03:40.812384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GRySqm+PijdhiTh+eukOqwdJ4ZIf/TRR454nLm8M0FMQN+5kfhoYFHNVQm6uXIPVneLe9aIJISYMf8LqUCiwAg==","signature_status":"signed_v1","signed_at":"2026-05-22T01:03:40.813148Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.11889","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efd3401ec485a6301d789edad31b44b6fd1b5e420ec4cc8bc5b3ff08a902c181","sha256:171c7727e8f9eda98c84a0adda583029712e2ba78c957e50d2afb7254317af59"],"state_sha256":"5954ff1980006e1ab1eb6f56f4b3311f27ba6a4717dc601eea5148da4c7c4fa2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dRv2L9l2BJJRKxZdS2fms9vJlFnMrqcTnc1BAXcjUZ7kcohYZKic4hxIsh9+TPCEI4KnWvBjnxL1vJNtjVb0Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T18:58:15.290937Z","bundle_sha256":"8d565cf0e3baf5cddee5a7480a22b00bf6c69a4e6f5e4d6fc20689a5bda84f36"}}