{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:633CBH4QMN76UWT2Z4YW2OAFY2","short_pith_number":"pith:633CBH4Q","canonical_record":{"source":{"id":"2011.05785","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-11-11T14:01:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"06252de0317dbea6ddff1f77e8a2bcc7d76e1691c92e5e9b8f11efab6d6f43f4","abstract_canon_sha256":"ae0d2e991e29724fc46077fc3b78a92819c2288af66a8cb0fbaa15a49dc0f2bc"},"schema_version":"1.0"},"canonical_sha256":"f6f6209f90637fea5a7acf316d3805c6ae419bb672bc1a72b8b598bf3cb31b86","source":{"kind":"arxiv","id":"2011.05785","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.05785","created_at":"2026-07-05T03:53:34Z"},{"alias_kind":"arxiv_version","alias_value":"2011.05785v2","created_at":"2026-07-05T03:53:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.05785","created_at":"2026-07-05T03:53:34Z"},{"alias_kind":"pith_short_12","alias_value":"633CBH4QMN76","created_at":"2026-07-05T03:53:34Z"},{"alias_kind":"pith_short_16","alias_value":"633CBH4QMN76UWT2","created_at":"2026-07-05T03:53:34Z"},{"alias_kind":"pith_short_8","alias_value":"633CBH4Q","created_at":"2026-07-05T03:53:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:633CBH4QMN76UWT2Z4YW2OAFY2","target":"record","payload":{"canonical_record":{"source":{"id":"2011.05785","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-11-11T14:01:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"06252de0317dbea6ddff1f77e8a2bcc7d76e1691c92e5e9b8f11efab6d6f43f4","abstract_canon_sha256":"ae0d2e991e29724fc46077fc3b78a92819c2288af66a8cb0fbaa15a49dc0f2bc"},"schema_version":"1.0"},"canonical_sha256":"f6f6209f90637fea5a7acf316d3805c6ae419bb672bc1a72b8b598bf3cb31b86","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:53:34.403890Z","signature_b64":"WIqMEhMX4DEA5ErA4oodkeAedjAqE+SgVjbUdJcWgjhE5RNd4iT5P/zIwszu/M2YjRzdOM0S3dBxv2j05t2nAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6f6209f90637fea5a7acf316d3805c6ae419bb672bc1a72b8b598bf3cb31b86","last_reissued_at":"2026-07-05T03:53:34.403417Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:53:34.403417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.05785","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-07-05T03:53:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UmkQ9IEX30woCM0ecoGqzuyXIKSuQeuEaT5e9IHLxMvA9Br+KdlOHtJKcsl69jQS0O0G4jXzl8E2caQoQVLbBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T03:39:22.163412Z"},"content_sha256":"56058a0c9c6de0187c41f64ddc3891823eb61d05095a09fc902875e4ab8a36a5","schema_version":"1.0","event_id":"sha256:56058a0c9c6de0187c41f64ddc3891823eb61d05095a09fc902875e4ab8a36a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:633CBH4QMN76UWT2Z4YW2OAFY2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast semidefinite programming with feedforward neural networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Daniel Cavalcanti, Joseph Bowles, Nicolas Brunner, Tam\\'as Kriv\\'achy, Yu Cai","submitted_at":"2020-11-11T14:01:34Z","abstract_excerpt":"Semidefinite programming is an important optimization task, often used in time-sensitive applications. Though they are solvable in polynomial time, in practice they can be too slow to be used in online, i.e. real-time applications. Here we propose to solve feasibility semidefinite programs using artificial neural networks. Given the optimization constraints as an input, a neural network outputs values for the optimization parameters such that the constraints are satisfied, both for the primal and the dual formulations of the task. We train the network without having to exactly solve the semide"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.05785","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.05785/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-05T03:53:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Pof+VQ8nvjCnl/qEe3bQPqmQGvKcX1FgKVSmCiPeaad2ewfot3+zQu1RwkroGJaI9YvKaE+bBNB4LAMFm8lCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T03:39:22.163912Z"},"content_sha256":"56dfcbd9d9b0054b0e55ca91b29d170d2e758060f5dfaef3433eddd77b96adc7","schema_version":"1.0","event_id":"sha256:56dfcbd9d9b0054b0e55ca91b29d170d2e758060f5dfaef3433eddd77b96adc7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/633CBH4QMN76UWT2Z4YW2OAFY2/bundle.json","state_url":"https://pith.science/pith/633CBH4QMN76UWT2Z4YW2OAFY2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/633CBH4QMN76UWT2Z4YW2OAFY2/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-07T03:39:22Z","links":{"resolver":"https://pith.science/pith/633CBH4QMN76UWT2Z4YW2OAFY2","bundle":"https://pith.science/pith/633CBH4QMN76UWT2Z4YW2OAFY2/bundle.json","state":"https://pith.science/pith/633CBH4QMN76UWT2Z4YW2OAFY2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/633CBH4QMN76UWT2Z4YW2OAFY2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:633CBH4QMN76UWT2Z4YW2OAFY2","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":"ae0d2e991e29724fc46077fc3b78a92819c2288af66a8cb0fbaa15a49dc0f2bc","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-11-11T14:01:34Z","title_canon_sha256":"06252de0317dbea6ddff1f77e8a2bcc7d76e1691c92e5e9b8f11efab6d6f43f4"},"schema_version":"1.0","source":{"id":"2011.05785","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.05785","created_at":"2026-07-05T03:53:34Z"},{"alias_kind":"arxiv_version","alias_value":"2011.05785v2","created_at":"2026-07-05T03:53:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.05785","created_at":"2026-07-05T03:53:34Z"},{"alias_kind":"pith_short_12","alias_value":"633CBH4QMN76","created_at":"2026-07-05T03:53:34Z"},{"alias_kind":"pith_short_16","alias_value":"633CBH4QMN76UWT2","created_at":"2026-07-05T03:53:34Z"},{"alias_kind":"pith_short_8","alias_value":"633CBH4Q","created_at":"2026-07-05T03:53:34Z"}],"graph_snapshots":[{"event_id":"sha256:56dfcbd9d9b0054b0e55ca91b29d170d2e758060f5dfaef3433eddd77b96adc7","target":"graph","created_at":"2026-07-05T03:53:34Z","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/2011.05785/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Semidefinite programming is an important optimization task, often used in time-sensitive applications. Though they are solvable in polynomial time, in practice they can be too slow to be used in online, i.e. real-time applications. Here we propose to solve feasibility semidefinite programs using artificial neural networks. Given the optimization constraints as an input, a neural network outputs values for the optimization parameters such that the constraints are satisfied, both for the primal and the dual formulations of the task. We train the network without having to exactly solve the semide","authors_text":"Daniel Cavalcanti, Joseph Bowles, Nicolas Brunner, Tam\\'as Kriv\\'achy, Yu Cai","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-11-11T14:01:34Z","title":"Fast semidefinite programming with feedforward neural networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.05785","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:56058a0c9c6de0187c41f64ddc3891823eb61d05095a09fc902875e4ab8a36a5","target":"record","created_at":"2026-07-05T03:53:34Z","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":"ae0d2e991e29724fc46077fc3b78a92819c2288af66a8cb0fbaa15a49dc0f2bc","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-11-11T14:01:34Z","title_canon_sha256":"06252de0317dbea6ddff1f77e8a2bcc7d76e1691c92e5e9b8f11efab6d6f43f4"},"schema_version":"1.0","source":{"id":"2011.05785","kind":"arxiv","version":2}},"canonical_sha256":"f6f6209f90637fea5a7acf316d3805c6ae419bb672bc1a72b8b598bf3cb31b86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6f6209f90637fea5a7acf316d3805c6ae419bb672bc1a72b8b598bf3cb31b86","first_computed_at":"2026-07-05T03:53:34.403417Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:53:34.403417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WIqMEhMX4DEA5ErA4oodkeAedjAqE+SgVjbUdJcWgjhE5RNd4iT5P/zIwszu/M2YjRzdOM0S3dBxv2j05t2nAA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:53:34.403890Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.05785","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56058a0c9c6de0187c41f64ddc3891823eb61d05095a09fc902875e4ab8a36a5","sha256:56dfcbd9d9b0054b0e55ca91b29d170d2e758060f5dfaef3433eddd77b96adc7"],"state_sha256":"945a55b4376b93235ff37160cba81c762cb2002f96e08cae5f3af9e5a8e33428"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h1pbpA2zUjnCNAl+jmwQ9OWQpya+N71Gvp6WScUHNnIFYIRKagPGvYYHPawzL+sUVKH65529zA4FguNyIyhPBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T03:39:22.168222Z","bundle_sha256":"fd9aedc5e289c7e56a8dcff83fded1aeb18afae8884179a8a8463e782ef3f0b7"}}