{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:3XCYGKAOZL3FWEJONHYW2EDD5P","short_pith_number":"pith:3XCYGKAO","canonical_record":{"source":{"id":"2203.05027","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-03-09T20:00:09Z","cross_cats_sorted":[],"title_canon_sha256":"b548cfe47816333d3f719e492dbd026e98880f4757a27458866cb0b79dfaa58b","abstract_canon_sha256":"8b465c7bf3b77772744cb1175986a30bf730c89c9b0aad1213c30dd3d7c1f55e"},"schema_version":"1.0"},"canonical_sha256":"ddc583280ecaf65b112e69f16d1063ebf6c7808b295fa571c96f3bebfc4feb63","source":{"kind":"arxiv","id":"2203.05027","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.05027","created_at":"2026-07-05T04:03:29Z"},{"alias_kind":"arxiv_version","alias_value":"2203.05027v1","created_at":"2026-07-05T04:03:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.05027","created_at":"2026-07-05T04:03:29Z"},{"alias_kind":"pith_short_12","alias_value":"3XCYGKAOZL3F","created_at":"2026-07-05T04:03:29Z"},{"alias_kind":"pith_short_16","alias_value":"3XCYGKAOZL3FWEJO","created_at":"2026-07-05T04:03:29Z"},{"alias_kind":"pith_short_8","alias_value":"3XCYGKAO","created_at":"2026-07-05T04:03:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:3XCYGKAOZL3FWEJONHYW2EDD5P","target":"record","payload":{"canonical_record":{"source":{"id":"2203.05027","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-03-09T20:00:09Z","cross_cats_sorted":[],"title_canon_sha256":"b548cfe47816333d3f719e492dbd026e98880f4757a27458866cb0b79dfaa58b","abstract_canon_sha256":"8b465c7bf3b77772744cb1175986a30bf730c89c9b0aad1213c30dd3d7c1f55e"},"schema_version":"1.0"},"canonical_sha256":"ddc583280ecaf65b112e69f16d1063ebf6c7808b295fa571c96f3bebfc4feb63","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:03:29.031888Z","signature_b64":"dsM0mjuDgUnhLtkWiVU6oSSCc06Icsyt7tAq/ABjNdeyzSSJiG/Awn2vifqCjKkgXtqqIxxDfuGEz7UZ4ad+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddc583280ecaf65b112e69f16d1063ebf6c7808b295fa571c96f3bebfc4feb63","last_reissued_at":"2026-07-05T04:03:29.031457Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:03:29.031457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.05027","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-07-05T04:03:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XPSqjDngm/Niih037R79klzue5P+pc7uwqFAcq7s06F51F3caHAiSwUyKgQo4Lrk7ri58C7OH7Jy022GFDUPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T14:54:16.014828Z"},"content_sha256":"0fc699e04b5f7caeb7c6c5dae167ccc1da5c1d68a3475a2dcb9a1970322d898e","schema_version":"1.0","event_id":"sha256:0fc699e04b5f7caeb7c6c5dae167ccc1da5c1d68a3475a2dcb9a1970322d898e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:3XCYGKAOZL3FWEJONHYW2EDD5P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A First-Order Numerical Algorithm without Matrix Operations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ali Davoudi, Muhammad Adil, Ramtin Madani, Sasan Tavakkol","submitted_at":"2022-03-09T20:00:09Z","abstract_excerpt":"This paper offers a matrix-free first-order numerical method to solve large-scale conic optimization problems. Solving systems of linear equations pose the most computationally challenging part in both first-order and second-order numerical algorithms. Existing direct and indirect methods are either computationally expensive or compromise on solution accuracy. Alternatively, we propose an easy-to-compute decomposition method to solve sparse linear systems that arise in conic optimization problems. Its iterations are tractable, highly parallelizable, with closed-form solutions. This algorithm c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.05027","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/2203.05027/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-07-05T04:03:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tZQc7LcPyQ/w2w+Pix9gd8yUjpyCSsW9nCccJ//WViff9xZTejwIfxWQM4J3okWOB29xShCEa5ODFAzrPnoRDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T14:54:16.015322Z"},"content_sha256":"6a3cae6d066d6c31065aa84f56786c11b2b15c620dd466833248b9bbc094866b","schema_version":"1.0","event_id":"sha256:6a3cae6d066d6c31065aa84f56786c11b2b15c620dd466833248b9bbc094866b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3XCYGKAOZL3FWEJONHYW2EDD5P/bundle.json","state_url":"https://pith.science/pith/3XCYGKAOZL3FWEJONHYW2EDD5P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3XCYGKAOZL3FWEJONHYW2EDD5P/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-08-15T14:54:16Z","links":{"resolver":"https://pith.science/pith/3XCYGKAOZL3FWEJONHYW2EDD5P","bundle":"https://pith.science/pith/3XCYGKAOZL3FWEJONHYW2EDD5P/bundle.json","state":"https://pith.science/pith/3XCYGKAOZL3FWEJONHYW2EDD5P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3XCYGKAOZL3FWEJONHYW2EDD5P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:3XCYGKAOZL3FWEJONHYW2EDD5P","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":"8b465c7bf3b77772744cb1175986a30bf730c89c9b0aad1213c30dd3d7c1f55e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-03-09T20:00:09Z","title_canon_sha256":"b548cfe47816333d3f719e492dbd026e98880f4757a27458866cb0b79dfaa58b"},"schema_version":"1.0","source":{"id":"2203.05027","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.05027","created_at":"2026-07-05T04:03:29Z"},{"alias_kind":"arxiv_version","alias_value":"2203.05027v1","created_at":"2026-07-05T04:03:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.05027","created_at":"2026-07-05T04:03:29Z"},{"alias_kind":"pith_short_12","alias_value":"3XCYGKAOZL3F","created_at":"2026-07-05T04:03:29Z"},{"alias_kind":"pith_short_16","alias_value":"3XCYGKAOZL3FWEJO","created_at":"2026-07-05T04:03:29Z"},{"alias_kind":"pith_short_8","alias_value":"3XCYGKAO","created_at":"2026-07-05T04:03:29Z"}],"graph_snapshots":[{"event_id":"sha256:6a3cae6d066d6c31065aa84f56786c11b2b15c620dd466833248b9bbc094866b","target":"graph","created_at":"2026-07-05T04:03:29Z","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/2203.05027/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper offers a matrix-free first-order numerical method to solve large-scale conic optimization problems. Solving systems of linear equations pose the most computationally challenging part in both first-order and second-order numerical algorithms. Existing direct and indirect methods are either computationally expensive or compromise on solution accuracy. Alternatively, we propose an easy-to-compute decomposition method to solve sparse linear systems that arise in conic optimization problems. Its iterations are tractable, highly parallelizable, with closed-form solutions. This algorithm c","authors_text":"Ali Davoudi, Muhammad Adil, Ramtin Madani, Sasan Tavakkol","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-03-09T20:00:09Z","title":"A First-Order Numerical Algorithm without Matrix Operations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.05027","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:0fc699e04b5f7caeb7c6c5dae167ccc1da5c1d68a3475a2dcb9a1970322d898e","target":"record","created_at":"2026-07-05T04:03:29Z","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":"8b465c7bf3b77772744cb1175986a30bf730c89c9b0aad1213c30dd3d7c1f55e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-03-09T20:00:09Z","title_canon_sha256":"b548cfe47816333d3f719e492dbd026e98880f4757a27458866cb0b79dfaa58b"},"schema_version":"1.0","source":{"id":"2203.05027","kind":"arxiv","version":1}},"canonical_sha256":"ddc583280ecaf65b112e69f16d1063ebf6c7808b295fa571c96f3bebfc4feb63","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ddc583280ecaf65b112e69f16d1063ebf6c7808b295fa571c96f3bebfc4feb63","first_computed_at":"2026-07-05T04:03:29.031457Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:03:29.031457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dsM0mjuDgUnhLtkWiVU6oSSCc06Icsyt7tAq/ABjNdeyzSSJiG/Awn2vifqCjKkgXtqqIxxDfuGEz7UZ4ad+CA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:03:29.031888Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.05027","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fc699e04b5f7caeb7c6c5dae167ccc1da5c1d68a3475a2dcb9a1970322d898e","sha256:6a3cae6d066d6c31065aa84f56786c11b2b15c620dd466833248b9bbc094866b"],"state_sha256":"58e343bb30647db6cc290c37b7abfd267d51b479f5416fd0312b9aea53faad3d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lnLEd8ggiNPfnmfpqX9XbM7901NbrMF/KZ5LD7aE4/wncyjrM/0Ns+MQxCQDQeai7q/cnRwFjZJHD+tCR5fADQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T14:54:16.018945Z","bundle_sha256":"d07ff5fc0547d691c2a1853bbf80b7a8ca60099501e694ba36727fd86f6fb0fe"}}