{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WBRXEJUKILQCVMIINOF4VK2BNH","short_pith_number":"pith:WBRXEJUK","canonical_record":{"source":{"id":"1309.1369","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-09-05T15:12:11Z","cross_cats_sorted":["cs.LG","math.NA","stat.CO"],"title_canon_sha256":"95d330ff43e5a72d2f66494e794cba599a1338e8d8ffca38312ff7fb8c80cfae","abstract_canon_sha256":"bac1fc634bf628cba5a97d85007aa84ca1a730f7ee438baf46d7c93fd5477997"},"schema_version":"1.0"},"canonical_sha256":"b06372268a42e02ab1086b8bcaab4169e894a721b1cf535a15467ec4279a86f8","source":{"kind":"arxiv","id":"1309.1369","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1369","created_at":"2026-05-18T02:58:45Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1369v4","created_at":"2026-05-18T02:58:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1369","created_at":"2026-05-18T02:58:45Z"},{"alias_kind":"pith_short_12","alias_value":"WBRXEJUKILQC","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WBRXEJUKILQCVMII","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WBRXEJUK","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WBRXEJUKILQCVMIINOF4VK2BNH","target":"record","payload":{"canonical_record":{"source":{"id":"1309.1369","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-09-05T15:12:11Z","cross_cats_sorted":["cs.LG","math.NA","stat.CO"],"title_canon_sha256":"95d330ff43e5a72d2f66494e794cba599a1338e8d8ffca38312ff7fb8c80cfae","abstract_canon_sha256":"bac1fc634bf628cba5a97d85007aa84ca1a730f7ee438baf46d7c93fd5477997"},"schema_version":"1.0"},"canonical_sha256":"b06372268a42e02ab1086b8bcaab4169e894a721b1cf535a15467ec4279a86f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:45.812379Z","signature_b64":"upuT3wJy3bGlxwcn7t0draGOMOyAmkjn98JBLt9FEF7CBViAO1GnkpjluxcrftBx3omQSj90fymVKz2J8qmLDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b06372268a42e02ab1086b8bcaab4169e894a721b1cf535a15467ec4279a86f8","last_reissued_at":"2026-05-18T02:58:45.811612Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:45.811612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.1369","source_version":4,"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-18T02:58:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0bXSFF3hhsRupTC6X/YhPAeBg4GwOlkbEaoyWZs1FJNSsIg881SsaIps19VtxS9l59j77GnIR7V8UMeRjV84AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:10:33.353375Z"},"content_sha256":"b2e1d65ffc1534efe4aaab2460c3a8bd3322810ca01df6d8cd98b87721c8467a","schema_version":"1.0","event_id":"sha256:b2e1d65ffc1534efe4aaab2460c3a8bd3322810ca01df6d8cd98b87721c8467a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WBRXEJUKILQCVMIINOF4VK2BNH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semistochastic Quadratic Bound Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.NA","stat.CO"],"primary_cat":"stat.ML","authors_text":"Aleksandr Y. Aravkin, Anna Choromanska, Dimitri Kanevsky, Tony Jebara","submitted_at":"2013-09-05T15:12:11Z","abstract_excerpt":"Partition functions arise in a variety of settings, including conditional random fields, logistic regression, and latent gaussian models. In this paper, we consider semistochastic quadratic bound (SQB) methods for maximum likelihood inference based on partition function optimization. Batch methods based on the quadratic bound were recently proposed for this class of problems, and performed favorably in comparison to state-of-the-art techniques. Semistochastic methods fall in between batch algorithms, which use all the data, and stochastic gradient type methods, which use small random selection"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1369","kind":"arxiv","version":4},"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-18T02:58:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gxi/AznPiMJXQI+dVF8vHrJ18YfMArDeMZLicIvBT357OEpVHy8O81ZoBoHl0MK4uki3ISp25xS2CFIEdIKuDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:10:33.354225Z"},"content_sha256":"147a9fbe8a8d90b627ec265f87106826e8791c2f3041863ca812a9937b0f819d","schema_version":"1.0","event_id":"sha256:147a9fbe8a8d90b627ec265f87106826e8791c2f3041863ca812a9937b0f819d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WBRXEJUKILQCVMIINOF4VK2BNH/bundle.json","state_url":"https://pith.science/pith/WBRXEJUKILQCVMIINOF4VK2BNH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WBRXEJUKILQCVMIINOF4VK2BNH/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-01T20:10:33Z","links":{"resolver":"https://pith.science/pith/WBRXEJUKILQCVMIINOF4VK2BNH","bundle":"https://pith.science/pith/WBRXEJUKILQCVMIINOF4VK2BNH/bundle.json","state":"https://pith.science/pith/WBRXEJUKILQCVMIINOF4VK2BNH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WBRXEJUKILQCVMIINOF4VK2BNH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WBRXEJUKILQCVMIINOF4VK2BNH","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":"bac1fc634bf628cba5a97d85007aa84ca1a730f7ee438baf46d7c93fd5477997","cross_cats_sorted":["cs.LG","math.NA","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-09-05T15:12:11Z","title_canon_sha256":"95d330ff43e5a72d2f66494e794cba599a1338e8d8ffca38312ff7fb8c80cfae"},"schema_version":"1.0","source":{"id":"1309.1369","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1369","created_at":"2026-05-18T02:58:45Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1369v4","created_at":"2026-05-18T02:58:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1369","created_at":"2026-05-18T02:58:45Z"},{"alias_kind":"pith_short_12","alias_value":"WBRXEJUKILQC","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WBRXEJUKILQCVMII","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WBRXEJUK","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:147a9fbe8a8d90b627ec265f87106826e8791c2f3041863ca812a9937b0f819d","target":"graph","created_at":"2026-05-18T02:58: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":"Partition functions arise in a variety of settings, including conditional random fields, logistic regression, and latent gaussian models. In this paper, we consider semistochastic quadratic bound (SQB) methods for maximum likelihood inference based on partition function optimization. Batch methods based on the quadratic bound were recently proposed for this class of problems, and performed favorably in comparison to state-of-the-art techniques. Semistochastic methods fall in between batch algorithms, which use all the data, and stochastic gradient type methods, which use small random selection","authors_text":"Aleksandr Y. Aravkin, Anna Choromanska, Dimitri Kanevsky, Tony Jebara","cross_cats":["cs.LG","math.NA","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-09-05T15:12:11Z","title":"Semistochastic Quadratic Bound Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1369","kind":"arxiv","version":4},"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:b2e1d65ffc1534efe4aaab2460c3a8bd3322810ca01df6d8cd98b87721c8467a","target":"record","created_at":"2026-05-18T02:58: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":"bac1fc634bf628cba5a97d85007aa84ca1a730f7ee438baf46d7c93fd5477997","cross_cats_sorted":["cs.LG","math.NA","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-09-05T15:12:11Z","title_canon_sha256":"95d330ff43e5a72d2f66494e794cba599a1338e8d8ffca38312ff7fb8c80cfae"},"schema_version":"1.0","source":{"id":"1309.1369","kind":"arxiv","version":4}},"canonical_sha256":"b06372268a42e02ab1086b8bcaab4169e894a721b1cf535a15467ec4279a86f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b06372268a42e02ab1086b8bcaab4169e894a721b1cf535a15467ec4279a86f8","first_computed_at":"2026-05-18T02:58:45.811612Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:45.811612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"upuT3wJy3bGlxwcn7t0draGOMOyAmkjn98JBLt9FEF7CBViAO1GnkpjluxcrftBx3omQSj90fymVKz2J8qmLDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:45.812379Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.1369","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2e1d65ffc1534efe4aaab2460c3a8bd3322810ca01df6d8cd98b87721c8467a","sha256:147a9fbe8a8d90b627ec265f87106826e8791c2f3041863ca812a9937b0f819d"],"state_sha256":"e3f5aa48ab7e93b5952df4b4f51ed5edb4b523450c9edc714ece0efae641a4bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TAtWf9YBb72IMPG22oFCRqOB8vBDUdyi9ivZCUd0CniPxwBagFLRmxrqEBGTQQ/9kpufA2M1Qxz0ycGDJupXCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:10:33.356189Z","bundle_sha256":"a6dc24afbe772e3cd27751a142c8eb091e12d84fc818871b9a5f848c25509b37"}}