{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KTI3DGWVNRECQZGHZFTF6YP5D5","short_pith_number":"pith:KTI3DGWV","canonical_record":{"source":{"id":"1504.04406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-04-16T23:26:35Z","cross_cats_sorted":["cs.LG","math.OC","stat.CO"],"title_canon_sha256":"cc3c481654f27690284e71ac15279b169b0a83e709059b26cd5201c67aa041f5","abstract_canon_sha256":"07f1a4d989f851eb4b915548c7e1587b6158fa178cd757acfa41bc5c92637003"},"schema_version":"1.0"},"canonical_sha256":"54d1b19ad56c482864c7c9665f61fd1f4ee1a450baefa78650ef9a2fc5355e45","source":{"kind":"arxiv","id":"1504.04406","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04406","created_at":"2026-05-18T02:18:32Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04406v1","created_at":"2026-05-18T02:18:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04406","created_at":"2026-05-18T02:18:32Z"},{"alias_kind":"pith_short_12","alias_value":"KTI3DGWVNREC","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KTI3DGWVNRECQZGH","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KTI3DGWV","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KTI3DGWVNRECQZGHZFTF6YP5D5","target":"record","payload":{"canonical_record":{"source":{"id":"1504.04406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-04-16T23:26:35Z","cross_cats_sorted":["cs.LG","math.OC","stat.CO"],"title_canon_sha256":"cc3c481654f27690284e71ac15279b169b0a83e709059b26cd5201c67aa041f5","abstract_canon_sha256":"07f1a4d989f851eb4b915548c7e1587b6158fa178cd757acfa41bc5c92637003"},"schema_version":"1.0"},"canonical_sha256":"54d1b19ad56c482864c7c9665f61fd1f4ee1a450baefa78650ef9a2fc5355e45","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:32.467423Z","signature_b64":"ttWISJG5gaAfd5TQP0bM4rKeA2VXtrbmsr1UpaEIbf37BM5oT9KKVyNzG4HrjWO67E6VrLSD29myHlqriiEIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54d1b19ad56c482864c7c9665f61fd1f4ee1a450baefa78650ef9a2fc5355e45","last_reissued_at":"2026-05-18T02:18:32.466977Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:32.466977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.04406","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-18T02:18:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E85f3Z33VgKvAK4xAvloYA5FIpNOmqLvzLQjAsuyPuBC1sJuMV1Xv+a0BTv1ONgO5RrtMcJe/47CcMGQhW2PAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T07:25:49.268721Z"},"content_sha256":"96a7605f1def73f19d6d09dabf6504cb694807929a78c581f2cadf77595b7f73","schema_version":"1.0","event_id":"sha256:96a7605f1def73f19d6d09dabf6504cb694807929a78c581f2cadf77595b7f73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KTI3DGWVNRECQZGHZFTF6YP5D5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Uniform Stochastic Average Gradient Method for Training Conditional Random Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","stat.CO"],"primary_cat":"stat.ML","authors_text":"Aaron Defazio, Ann Clifton, Anoop Sarkar, Mark Schmidt, Mohamed Osama Ahmed, Reza Babanezhad","submitted_at":"2015-04-16T23:26:35Z","abstract_excerpt":"We apply stochastic average gradient (SAG) algorithms for training conditional random fields (CRFs). We describe a practical implementation that uses structure in the CRF gradient to reduce the memory requirement of this linearly-convergent stochastic gradient method, propose a non-uniform sampling scheme that substantially improves practical performance, and analyze the rate of convergence of the SAGA variant under non-uniform sampling. Our experimental results reveal that our method often significantly outperforms existing methods in terms of the training objective, and performs as well or b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04406","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-18T02:18:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LorKcADhPQllv0hYMn4r41CCVuOEFx4jIvI4jTGjWZeOEvpl9EqbD/OD4g5YbniSHIKbeJ5RLekntB58nU0ICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T07:25:49.269070Z"},"content_sha256":"b5b50b8b211ecc84c4ff6f0abb9dfc9205bed2118f9702b5e1ce0dbf9c690246","schema_version":"1.0","event_id":"sha256:b5b50b8b211ecc84c4ff6f0abb9dfc9205bed2118f9702b5e1ce0dbf9c690246"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KTI3DGWVNRECQZGHZFTF6YP5D5/bundle.json","state_url":"https://pith.science/pith/KTI3DGWVNRECQZGHZFTF6YP5D5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KTI3DGWVNRECQZGHZFTF6YP5D5/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-25T07:25:49Z","links":{"resolver":"https://pith.science/pith/KTI3DGWVNRECQZGHZFTF6YP5D5","bundle":"https://pith.science/pith/KTI3DGWVNRECQZGHZFTF6YP5D5/bundle.json","state":"https://pith.science/pith/KTI3DGWVNRECQZGHZFTF6YP5D5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KTI3DGWVNRECQZGHZFTF6YP5D5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KTI3DGWVNRECQZGHZFTF6YP5D5","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":"07f1a4d989f851eb4b915548c7e1587b6158fa178cd757acfa41bc5c92637003","cross_cats_sorted":["cs.LG","math.OC","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-04-16T23:26:35Z","title_canon_sha256":"cc3c481654f27690284e71ac15279b169b0a83e709059b26cd5201c67aa041f5"},"schema_version":"1.0","source":{"id":"1504.04406","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04406","created_at":"2026-05-18T02:18:32Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04406v1","created_at":"2026-05-18T02:18:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04406","created_at":"2026-05-18T02:18:32Z"},{"alias_kind":"pith_short_12","alias_value":"KTI3DGWVNREC","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KTI3DGWVNRECQZGH","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KTI3DGWV","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:b5b50b8b211ecc84c4ff6f0abb9dfc9205bed2118f9702b5e1ce0dbf9c690246","target":"graph","created_at":"2026-05-18T02:18:32Z","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 apply stochastic average gradient (SAG) algorithms for training conditional random fields (CRFs). We describe a practical implementation that uses structure in the CRF gradient to reduce the memory requirement of this linearly-convergent stochastic gradient method, propose a non-uniform sampling scheme that substantially improves practical performance, and analyze the rate of convergence of the SAGA variant under non-uniform sampling. Our experimental results reveal that our method often significantly outperforms existing methods in terms of the training objective, and performs as well or b","authors_text":"Aaron Defazio, Ann Clifton, Anoop Sarkar, Mark Schmidt, Mohamed Osama Ahmed, Reza Babanezhad","cross_cats":["cs.LG","math.OC","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-04-16T23:26:35Z","title":"Non-Uniform Stochastic Average Gradient Method for Training Conditional Random Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04406","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:96a7605f1def73f19d6d09dabf6504cb694807929a78c581f2cadf77595b7f73","target":"record","created_at":"2026-05-18T02:18:32Z","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":"07f1a4d989f851eb4b915548c7e1587b6158fa178cd757acfa41bc5c92637003","cross_cats_sorted":["cs.LG","math.OC","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-04-16T23:26:35Z","title_canon_sha256":"cc3c481654f27690284e71ac15279b169b0a83e709059b26cd5201c67aa041f5"},"schema_version":"1.0","source":{"id":"1504.04406","kind":"arxiv","version":1}},"canonical_sha256":"54d1b19ad56c482864c7c9665f61fd1f4ee1a450baefa78650ef9a2fc5355e45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54d1b19ad56c482864c7c9665f61fd1f4ee1a450baefa78650ef9a2fc5355e45","first_computed_at":"2026-05-18T02:18:32.466977Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:32.466977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ttWISJG5gaAfd5TQP0bM4rKeA2VXtrbmsr1UpaEIbf37BM5oT9KKVyNzG4HrjWO67E6VrLSD29myHlqriiEIAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:32.467423Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.04406","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96a7605f1def73f19d6d09dabf6504cb694807929a78c581f2cadf77595b7f73","sha256:b5b50b8b211ecc84c4ff6f0abb9dfc9205bed2118f9702b5e1ce0dbf9c690246"],"state_sha256":"09553d49bf71ff2455347de982ab0fd9aef0582cb021d26b4aceee04ada858d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9kydBRRpfkiqBHW4i2bDpYFognv5a2+wdS5aCQqv5xZwQhUEeKQbR+FTeMkx8HhdlbXAWyEHxu3puLgofvmwAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T07:25:49.271090Z","bundle_sha256":"31eb5a0d7c9ffd8aa4746c9111dfd2084ffd77628f21fe41d18ab9cbbc865601"}}