{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OI3OPNH2BBSD6GRV2EZIR6TM7E","short_pith_number":"pith:OI3OPNH2","canonical_record":{"source":{"id":"1705.09210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-25T14:57:46Z","cross_cats_sorted":[],"title_canon_sha256":"c53048bd20966ac5c9404ca84ee4b0cffa88e3e390da647f184b2601c9383513","abstract_canon_sha256":"a50d1d24358c61aea4957a3a24b37735a796ac364181118edc99c3216ef5ef91"},"schema_version":"1.0"},"canonical_sha256":"7236e7b4fa08643f1a35d13288fa6cf932d33b2ba159b09f87190b7ee3429df5","source":{"kind":"arxiv","id":"1705.09210","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09210","created_at":"2026-05-18T00:43:40Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09210v1","created_at":"2026-05-18T00:43:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09210","created_at":"2026-05-18T00:43:40Z"},{"alias_kind":"pith_short_12","alias_value":"OI3OPNH2BBSD","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OI3OPNH2BBSD6GRV","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OI3OPNH2","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OI3OPNH2BBSD6GRV2EZIR6TM7E","target":"record","payload":{"canonical_record":{"source":{"id":"1705.09210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-25T14:57:46Z","cross_cats_sorted":[],"title_canon_sha256":"c53048bd20966ac5c9404ca84ee4b0cffa88e3e390da647f184b2601c9383513","abstract_canon_sha256":"a50d1d24358c61aea4957a3a24b37735a796ac364181118edc99c3216ef5ef91"},"schema_version":"1.0"},"canonical_sha256":"7236e7b4fa08643f1a35d13288fa6cf932d33b2ba159b09f87190b7ee3429df5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:40.148872Z","signature_b64":"DxKFJ+cIm0zoIdq91wnhTAptB0B4fc4zL1n2XI9OBVP8TPDzmrlZ3V5+KQE31kVGWRNU2CK2rHj4y8HQTGnrDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7236e7b4fa08643f1a35d13288fa6cf932d33b2ba159b09f87190b7ee3429df5","last_reissued_at":"2026-05-18T00:43:40.148350Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:40.148350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.09210","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-18T00:43:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5sSmE/THmfBoMMRSoJSafNmxywVHXwhIiL5q0uKzgp4ozA4/NxsLR1URQOAJM8gWVB/T0yip/FTLexRkd1qUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:43:18.566632Z"},"content_sha256":"418d329915b2fa074bea9b034ab58701a526e4853feb9227ec2f6645324df472","schema_version":"1.0","event_id":"sha256:418d329915b2fa074bea9b034ab58701a526e4853feb9227ec2f6645324df472"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OI3OPNH2BBSD6GRV2EZIR6TM7E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A simplicial decomposition framework for large scale convex quadratic programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Emiliano Traversi, Enrico Bettiol, Francesco Rinaldi, Lucas L\\'etocart","submitted_at":"2017-05-25T14:57:46Z","abstract_excerpt":"In this paper, we analyze in depth a simplicial decomposition like algorithmic framework for large scale convex quadratic programming. In particular, we first propose two tailored strategies for handling the master problem. Then, we describe a few techniques for speeding up the solution of the pricing problem. We report extensive numerical experiments on both real portfolio optimization and general quadratic programming problems, showing the efficiency and robustness of the method when compared to Cplex."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09210","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":""},"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-18T00:43:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZK8cd7mslXPCrsBI7n9QFiFgtTp3b72GQidl9/9MOvZZp6UWhMtfyV2u7XPdC+khm+MziD68DYCEHuwODvgkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:43:18.566971Z"},"content_sha256":"abcc6548aaedd2152ced20ed91aca9bec4455b6260e3cfb57360368960554bbe","schema_version":"1.0","event_id":"sha256:abcc6548aaedd2152ced20ed91aca9bec4455b6260e3cfb57360368960554bbe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OI3OPNH2BBSD6GRV2EZIR6TM7E/bundle.json","state_url":"https://pith.science/pith/OI3OPNH2BBSD6GRV2EZIR6TM7E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OI3OPNH2BBSD6GRV2EZIR6TM7E/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-05T01:43:18Z","links":{"resolver":"https://pith.science/pith/OI3OPNH2BBSD6GRV2EZIR6TM7E","bundle":"https://pith.science/pith/OI3OPNH2BBSD6GRV2EZIR6TM7E/bundle.json","state":"https://pith.science/pith/OI3OPNH2BBSD6GRV2EZIR6TM7E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OI3OPNH2BBSD6GRV2EZIR6TM7E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OI3OPNH2BBSD6GRV2EZIR6TM7E","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":"a50d1d24358c61aea4957a3a24b37735a796ac364181118edc99c3216ef5ef91","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-25T14:57:46Z","title_canon_sha256":"c53048bd20966ac5c9404ca84ee4b0cffa88e3e390da647f184b2601c9383513"},"schema_version":"1.0","source":{"id":"1705.09210","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09210","created_at":"2026-05-18T00:43:40Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09210v1","created_at":"2026-05-18T00:43:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09210","created_at":"2026-05-18T00:43:40Z"},{"alias_kind":"pith_short_12","alias_value":"OI3OPNH2BBSD","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OI3OPNH2BBSD6GRV","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OI3OPNH2","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:abcc6548aaedd2152ced20ed91aca9bec4455b6260e3cfb57360368960554bbe","target":"graph","created_at":"2026-05-18T00:43: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"},"paper":{"abstract_excerpt":"In this paper, we analyze in depth a simplicial decomposition like algorithmic framework for large scale convex quadratic programming. In particular, we first propose two tailored strategies for handling the master problem. Then, we describe a few techniques for speeding up the solution of the pricing problem. We report extensive numerical experiments on both real portfolio optimization and general quadratic programming problems, showing the efficiency and robustness of the method when compared to Cplex.","authors_text":"Emiliano Traversi, Enrico Bettiol, Francesco Rinaldi, Lucas L\\'etocart","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-25T14:57:46Z","title":"A simplicial decomposition framework for large scale convex quadratic programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09210","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:418d329915b2fa074bea9b034ab58701a526e4853feb9227ec2f6645324df472","target":"record","created_at":"2026-05-18T00:43: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":"a50d1d24358c61aea4957a3a24b37735a796ac364181118edc99c3216ef5ef91","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-25T14:57:46Z","title_canon_sha256":"c53048bd20966ac5c9404ca84ee4b0cffa88e3e390da647f184b2601c9383513"},"schema_version":"1.0","source":{"id":"1705.09210","kind":"arxiv","version":1}},"canonical_sha256":"7236e7b4fa08643f1a35d13288fa6cf932d33b2ba159b09f87190b7ee3429df5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7236e7b4fa08643f1a35d13288fa6cf932d33b2ba159b09f87190b7ee3429df5","first_computed_at":"2026-05-18T00:43:40.148350Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:40.148350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DxKFJ+cIm0zoIdq91wnhTAptB0B4fc4zL1n2XI9OBVP8TPDzmrlZ3V5+KQE31kVGWRNU2CK2rHj4y8HQTGnrDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:40.148872Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09210","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:418d329915b2fa074bea9b034ab58701a526e4853feb9227ec2f6645324df472","sha256:abcc6548aaedd2152ced20ed91aca9bec4455b6260e3cfb57360368960554bbe"],"state_sha256":"3c71b980d027b796c1ba959ec0343cb70d7bc6b7c88f36ac74cc717522b644c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WauR9DfVdGTioShcWPWwkBichWRLrEgvYciEqsJjsC4ym2hBM7+A8elZXFuGxYUUc04QxeEHvJfEdtblr++nCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:43:18.568888Z","bundle_sha256":"5e32c6244335d3fbe879eac7cddd925434c52897db3e19565d67f8fd67a3f1b2"}}