{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GJ4GVMJVJUOCXL3RQF2T5ZW6WH","short_pith_number":"pith:GJ4GVMJV","canonical_record":{"source":{"id":"1710.01163","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-02T02:38:37Z","cross_cats_sorted":[],"title_canon_sha256":"dc90efa80b77cc9375ced0269293d3bf6808c2cdd393c7305308ceb6d6680b89","abstract_canon_sha256":"679b148518ff1523159427ec158deb906e773e200c6f47838c1ecf937b5f0c40"},"schema_version":"1.0"},"canonical_sha256":"32786ab1354d1c2baf7181753ee6deb1d61584fcd03ba69bfe43191e6f54e628","source":{"kind":"arxiv","id":"1710.01163","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01163","created_at":"2026-05-18T00:33:45Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01163v1","created_at":"2026-05-18T00:33:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01163","created_at":"2026-05-18T00:33:45Z"},{"alias_kind":"pith_short_12","alias_value":"GJ4GVMJVJUOC","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GJ4GVMJVJUOCXL3R","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GJ4GVMJV","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GJ4GVMJVJUOCXL3RQF2T5ZW6WH","target":"record","payload":{"canonical_record":{"source":{"id":"1710.01163","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-02T02:38:37Z","cross_cats_sorted":[],"title_canon_sha256":"dc90efa80b77cc9375ced0269293d3bf6808c2cdd393c7305308ceb6d6680b89","abstract_canon_sha256":"679b148518ff1523159427ec158deb906e773e200c6f47838c1ecf937b5f0c40"},"schema_version":"1.0"},"canonical_sha256":"32786ab1354d1c2baf7181753ee6deb1d61584fcd03ba69bfe43191e6f54e628","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:45.127654Z","signature_b64":"4l2onOg49rhxR8oxLYIHvSa3lkSSlmUXXTtbiRDPDiLpvDkGL1cf3xm8zm4nfyvmwqhZfLdOrttaM4ecjDWLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32786ab1354d1c2baf7181753ee6deb1d61584fcd03ba69bfe43191e6f54e628","last_reissued_at":"2026-05-18T00:33:45.127063Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:45.127063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.01163","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:33:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f2ug3zPgkrmp3P5tArE3BCf9kDBntSp5Y5gH/loCIOxYnGytRUBYYtGrTh6QTMHNzgVUpHp1i2CTy3cbwSH8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:01:51.005576Z"},"content_sha256":"702a44646c7f8041a80561d7ceccdf5a484656e3172ea964b2ea9ed08dcadd82","schema_version":"1.0","event_id":"sha256:702a44646c7f8041a80561d7ceccdf5a484656e3172ea964b2ea9ed08dcadd82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GJ4GVMJVJUOCXL3RQF2T5ZW6WH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large-Scale Quadratically Constrained Quadratic Program via Low-Discrepancy Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Ankan Saha, Kinjal Basu, Shaunak Chatterjee","submitted_at":"2017-10-02T02:38:37Z","abstract_excerpt":"We consider the problem of solving a large-scale Quadratically Constrained Quadratic Program. Such problems occur naturally in many scientific and web applications. Although there are efficient methods which tackle this problem, they are mostly not scalable. In this paper, we develop a method that transforms the quadratic constraint into a linear form by sampling a set of low-discrepancy points. The transformed problem can then be solved by applying any state-of-the-art large-scale quadratic programming solvers. We show the convergence of our approximate solution to the true solution as well a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01163","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:33:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EeYJuCoT/OYL0YUOb7dNqTnrrNWQ0e+durV6vPiWEm+Ql2E41e5HFd4EOAliRTjonA63IsZEHW4JyvCOLmD3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:01:51.005920Z"},"content_sha256":"8f278d28e6c95e3799866c07aada962d0622a0e2741b478fffd6e0cb48976fc7","schema_version":"1.0","event_id":"sha256:8f278d28e6c95e3799866c07aada962d0622a0e2741b478fffd6e0cb48976fc7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GJ4GVMJVJUOCXL3RQF2T5ZW6WH/bundle.json","state_url":"https://pith.science/pith/GJ4GVMJVJUOCXL3RQF2T5ZW6WH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GJ4GVMJVJUOCXL3RQF2T5ZW6WH/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-01T18:01:51Z","links":{"resolver":"https://pith.science/pith/GJ4GVMJVJUOCXL3RQF2T5ZW6WH","bundle":"https://pith.science/pith/GJ4GVMJVJUOCXL3RQF2T5ZW6WH/bundle.json","state":"https://pith.science/pith/GJ4GVMJVJUOCXL3RQF2T5ZW6WH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GJ4GVMJVJUOCXL3RQF2T5ZW6WH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GJ4GVMJVJUOCXL3RQF2T5ZW6WH","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":"679b148518ff1523159427ec158deb906e773e200c6f47838c1ecf937b5f0c40","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-02T02:38:37Z","title_canon_sha256":"dc90efa80b77cc9375ced0269293d3bf6808c2cdd393c7305308ceb6d6680b89"},"schema_version":"1.0","source":{"id":"1710.01163","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01163","created_at":"2026-05-18T00:33:45Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01163v1","created_at":"2026-05-18T00:33:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01163","created_at":"2026-05-18T00:33:45Z"},{"alias_kind":"pith_short_12","alias_value":"GJ4GVMJVJUOC","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GJ4GVMJVJUOCXL3R","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GJ4GVMJV","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:8f278d28e6c95e3799866c07aada962d0622a0e2741b478fffd6e0cb48976fc7","target":"graph","created_at":"2026-05-18T00:33:45Z","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 consider the problem of solving a large-scale Quadratically Constrained Quadratic Program. Such problems occur naturally in many scientific and web applications. Although there are efficient methods which tackle this problem, they are mostly not scalable. In this paper, we develop a method that transforms the quadratic constraint into a linear form by sampling a set of low-discrepancy points. The transformed problem can then be solved by applying any state-of-the-art large-scale quadratic programming solvers. We show the convergence of our approximate solution to the true solution as well a","authors_text":"Ankan Saha, Kinjal Basu, Shaunak Chatterjee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-02T02:38:37Z","title":"Large-Scale Quadratically Constrained Quadratic Program via Low-Discrepancy Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01163","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:702a44646c7f8041a80561d7ceccdf5a484656e3172ea964b2ea9ed08dcadd82","target":"record","created_at":"2026-05-18T00:33:45Z","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":"679b148518ff1523159427ec158deb906e773e200c6f47838c1ecf937b5f0c40","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-02T02:38:37Z","title_canon_sha256":"dc90efa80b77cc9375ced0269293d3bf6808c2cdd393c7305308ceb6d6680b89"},"schema_version":"1.0","source":{"id":"1710.01163","kind":"arxiv","version":1}},"canonical_sha256":"32786ab1354d1c2baf7181753ee6deb1d61584fcd03ba69bfe43191e6f54e628","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32786ab1354d1c2baf7181753ee6deb1d61584fcd03ba69bfe43191e6f54e628","first_computed_at":"2026-05-18T00:33:45.127063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:45.127063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4l2onOg49rhxR8oxLYIHvSa3lkSSlmUXXTtbiRDPDiLpvDkGL1cf3xm8zm4nfyvmwqhZfLdOrttaM4ecjDWLCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:45.127654Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.01163","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:702a44646c7f8041a80561d7ceccdf5a484656e3172ea964b2ea9ed08dcadd82","sha256:8f278d28e6c95e3799866c07aada962d0622a0e2741b478fffd6e0cb48976fc7"],"state_sha256":"112f211f5f336fd499c2b747a0ec28066a63477059d2b586fc6571251eac822d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HTKTHlktpLV+87/sYBh8k1npi9RSro83A3etXptW0l2I3FN32hbpSge7Xu4RonREo3MUMhnAxtOkvvwge1JuCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:01:51.007820Z","bundle_sha256":"fb3f24ee2cdd23a814c1938bc41dc170685eb0700ab81756974cf2e819f9cbb5"}}