{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ITI7FUXNO4FIIGXVEABUZOA2VN","short_pith_number":"pith:ITI7FUXN","canonical_record":{"source":{"id":"1506.00760","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-02T06:04:04Z","cross_cats_sorted":[],"title_canon_sha256":"6c72c01450eaa2e4da2ba52ac24a2b85f7b2da923014a2b6b88787a22275c0e4","abstract_canon_sha256":"244ef91bd0f323425ad5f74df8ef61de520a9962a8d0305c68209820f5d18427"},"schema_version":"1.0"},"canonical_sha256":"44d1f2d2ed770a841af520034cb81aab4e3572e00f31cd3da015b034b8dfaa11","source":{"kind":"arxiv","id":"1506.00760","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00760","created_at":"2026-05-18T01:27:54Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00760v2","created_at":"2026-05-18T01:27:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00760","created_at":"2026-05-18T01:27:54Z"},{"alias_kind":"pith_short_12","alias_value":"ITI7FUXNO4FI","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"ITI7FUXNO4FIIGXV","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"ITI7FUXN","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ITI7FUXNO4FIIGXVEABUZOA2VN","target":"record","payload":{"canonical_record":{"source":{"id":"1506.00760","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-02T06:04:04Z","cross_cats_sorted":[],"title_canon_sha256":"6c72c01450eaa2e4da2ba52ac24a2b85f7b2da923014a2b6b88787a22275c0e4","abstract_canon_sha256":"244ef91bd0f323425ad5f74df8ef61de520a9962a8d0305c68209820f5d18427"},"schema_version":"1.0"},"canonical_sha256":"44d1f2d2ed770a841af520034cb81aab4e3572e00f31cd3da015b034b8dfaa11","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:54.031724Z","signature_b64":"avSVfFWwDspePeXcVihSIxHkIqMfP5YzKMxDzWLOptzu4OvRl6GHEDRt5axZETnEU1JdjsSqJNSKP/jYLYOjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44d1f2d2ed770a841af520034cb81aab4e3572e00f31cd3da015b034b8dfaa11","last_reissued_at":"2026-05-18T01:27:54.031034Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:54.031034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.00760","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-18T01:27:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W9kLmG9sPBORF/8E8CRV0zQKr1b68O09S7HatAvPXB0KblH12UcCcHU5ebyGroDZReGy9f/1z8RuJRH18d1IDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:29:33.943065Z"},"content_sha256":"b77f0600bc0ca0b569651979adb1eac35be39acc5d18e12eff393653406783df","schema_version":"1.0","event_id":"sha256:b77f0600bc0ca0b569651979adb1eac35be39acc5d18e12eff393653406783df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ITI7FUXNO4FIIGXVEABUZOA2VN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matrix-Free Convex Optimization Modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Stephen Boyd, Steven Diamond","submitted_at":"2015-06-02T06:04:04Z","abstract_excerpt":"We introduce a convex optimization modeling framework that transforms a convex optimization problem expressed in a form natural and convenient for the user into an equivalent cone program in a way that preserves fast linear transforms in the original problem. By representing linear functions in the transformation process not as matrices, but as graphs that encode composition of linear operators, we arrive at a matrix-free cone program, i.e., one whose data matrix is represented by a linear operator and its adjoint. This cone program can then be solved by a matrix-free cone solver. By combining"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00760","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-18T01:27:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QyWbHPxCak3z+1Gxz+5a8lBQTyhC7aSOVoDP5l1gIEdCdmm9PO6Qyyq9Xzc9FehB7KFrqG3rhKWrkMg+ozA4CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:29:33.943430Z"},"content_sha256":"6ba8e8fe8578cecff3864dfbd434ded31ba22352fc79e82fa73642bc79cd2e6f","schema_version":"1.0","event_id":"sha256:6ba8e8fe8578cecff3864dfbd434ded31ba22352fc79e82fa73642bc79cd2e6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ITI7FUXNO4FIIGXVEABUZOA2VN/bundle.json","state_url":"https://pith.science/pith/ITI7FUXNO4FIIGXVEABUZOA2VN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ITI7FUXNO4FIIGXVEABUZOA2VN/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-05-30T20:29:33Z","links":{"resolver":"https://pith.science/pith/ITI7FUXNO4FIIGXVEABUZOA2VN","bundle":"https://pith.science/pith/ITI7FUXNO4FIIGXVEABUZOA2VN/bundle.json","state":"https://pith.science/pith/ITI7FUXNO4FIIGXVEABUZOA2VN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ITI7FUXNO4FIIGXVEABUZOA2VN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ITI7FUXNO4FIIGXVEABUZOA2VN","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":"244ef91bd0f323425ad5f74df8ef61de520a9962a8d0305c68209820f5d18427","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-02T06:04:04Z","title_canon_sha256":"6c72c01450eaa2e4da2ba52ac24a2b85f7b2da923014a2b6b88787a22275c0e4"},"schema_version":"1.0","source":{"id":"1506.00760","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00760","created_at":"2026-05-18T01:27:54Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00760v2","created_at":"2026-05-18T01:27:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00760","created_at":"2026-05-18T01:27:54Z"},{"alias_kind":"pith_short_12","alias_value":"ITI7FUXNO4FI","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"ITI7FUXNO4FIIGXV","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"ITI7FUXN","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:6ba8e8fe8578cecff3864dfbd434ded31ba22352fc79e82fa73642bc79cd2e6f","target":"graph","created_at":"2026-05-18T01:27:54Z","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":"We introduce a convex optimization modeling framework that transforms a convex optimization problem expressed in a form natural and convenient for the user into an equivalent cone program in a way that preserves fast linear transforms in the original problem. By representing linear functions in the transformation process not as matrices, but as graphs that encode composition of linear operators, we arrive at a matrix-free cone program, i.e., one whose data matrix is represented by a linear operator and its adjoint. This cone program can then be solved by a matrix-free cone solver. By combining","authors_text":"Stephen Boyd, Steven Diamond","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-02T06:04:04Z","title":"Matrix-Free Convex Optimization Modeling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00760","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:b77f0600bc0ca0b569651979adb1eac35be39acc5d18e12eff393653406783df","target":"record","created_at":"2026-05-18T01:27:54Z","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":"244ef91bd0f323425ad5f74df8ef61de520a9962a8d0305c68209820f5d18427","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-02T06:04:04Z","title_canon_sha256":"6c72c01450eaa2e4da2ba52ac24a2b85f7b2da923014a2b6b88787a22275c0e4"},"schema_version":"1.0","source":{"id":"1506.00760","kind":"arxiv","version":2}},"canonical_sha256":"44d1f2d2ed770a841af520034cb81aab4e3572e00f31cd3da015b034b8dfaa11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44d1f2d2ed770a841af520034cb81aab4e3572e00f31cd3da015b034b8dfaa11","first_computed_at":"2026-05-18T01:27:54.031034Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:54.031034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"avSVfFWwDspePeXcVihSIxHkIqMfP5YzKMxDzWLOptzu4OvRl6GHEDRt5axZETnEU1JdjsSqJNSKP/jYLYOjDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:54.031724Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.00760","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b77f0600bc0ca0b569651979adb1eac35be39acc5d18e12eff393653406783df","sha256:6ba8e8fe8578cecff3864dfbd434ded31ba22352fc79e82fa73642bc79cd2e6f"],"state_sha256":"a2d784398e2e230a40f7fc55c63a6b3ac4d73e3c05975ca1bf09208801b488eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zwqTm/Orx5I02R/3fARvmCPZnJHE7u2DCOMVtnr+CLQQQ+x9Wptv82d/Qs8pswDsGBJV3KmNQ+izkvq5tn79Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:29:33.945327Z","bundle_sha256":"ed5e310f6d23951f4fe2aa8021c5d4a9411f10e09869e45585945609bfc4741c"}}