{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BB3YGQ4BCCGTCXNSAGRJHBLUJZ","short_pith_number":"pith:BB3YGQ4B","canonical_record":{"source":{"id":"1711.02637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-07T17:56:57Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"0d0a921f70c978ecb9c1c4506d6dbf1da69c057a1f7b792fc63581b69bee70e2","abstract_canon_sha256":"e5e4ff53a95248d2b7734060faab00d8919b912d8d8a2486113db3dc1b9ee8d8"},"schema_version":"1.0"},"canonical_sha256":"0877834381108d315db201a29385744e7f182e54e8149006353168da1730144f","source":{"kind":"arxiv","id":"1711.02637","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02637","created_at":"2026-05-18T00:31:07Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02637v1","created_at":"2026-05-18T00:31:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02637","created_at":"2026-05-18T00:31:07Z"},{"alias_kind":"pith_short_12","alias_value":"BB3YGQ4BCCGT","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BB3YGQ4BCCGTCXNS","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BB3YGQ4B","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BB3YGQ4BCCGTCXNSAGRJHBLUJZ","target":"record","payload":{"canonical_record":{"source":{"id":"1711.02637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-07T17:56:57Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"0d0a921f70c978ecb9c1c4506d6dbf1da69c057a1f7b792fc63581b69bee70e2","abstract_canon_sha256":"e5e4ff53a95248d2b7734060faab00d8919b912d8d8a2486113db3dc1b9ee8d8"},"schema_version":"1.0"},"canonical_sha256":"0877834381108d315db201a29385744e7f182e54e8149006353168da1730144f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:07.387608Z","signature_b64":"4HXBvGh3Oa6jrxKp/8vCjCzu3AaywAcFkXLZl8gk/yECfcLNu4ahc5iBIteCcj34IVaKhRyGq68iD758ErQyDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0877834381108d315db201a29385744e7f182e54e8149006353168da1730144f","last_reissued_at":"2026-05-18T00:31:07.386916Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:07.386916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.02637","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:31:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JrjO8EQas1cu/YrwZVHanIVaCR7u/k4cmzQ3f+APqX8YUlPts0FVfA2qIUEjAyVxAw+El3uJrgFAS/przAujBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:17:50.319941Z"},"content_sha256":"d7a516fde0690c4bce6ccd06fe5fd9fcb701f19f0b5c6e9a03334697014caecf","schema_version":"1.0","event_id":"sha256:d7a516fde0690c4bce6ccd06fe5fd9fcb701f19f0b5c6e9a03334697014caecf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BB3YGQ4BCCGTCXNSAGRJHBLUJZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Safe Adaptive Importance Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Anant Raj, Martin Jaggi, Sebastian U. Stich","submitted_at":"2017-11-07T17:56:57Z","abstract_excerpt":"Importance sampling has become an indispensable strategy to speed up optimization algorithms for large-scale applications. Improved adaptive variants - using importance values defined by the complete gradient information which changes during optimization - enjoy favorable theoretical properties, but are typically computationally infeasible. In this paper we propose an efficient approximation of gradient-based sampling, which is based on safe bounds on the gradient. The proposed sampling distribution is (i) provably the best sampling with respect to the given bounds, (ii) always better than uni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02637","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:31:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gwRuMm8QgHtvwknKkRcfm3yAYnVX4E1fvXWaUWJwhrm81hsGugDbgQE/FxzqKUBFGT/BNbNmAltSCIXQKo4OBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:17:50.320498Z"},"content_sha256":"7b1aea719a447353d183ed3a6be2831b285fc1e6468383b6a4a99f34744a288d","schema_version":"1.0","event_id":"sha256:7b1aea719a447353d183ed3a6be2831b285fc1e6468383b6a4a99f34744a288d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BB3YGQ4BCCGTCXNSAGRJHBLUJZ/bundle.json","state_url":"https://pith.science/pith/BB3YGQ4BCCGTCXNSAGRJHBLUJZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BB3YGQ4BCCGTCXNSAGRJHBLUJZ/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-05-30T18:17:50Z","links":{"resolver":"https://pith.science/pith/BB3YGQ4BCCGTCXNSAGRJHBLUJZ","bundle":"https://pith.science/pith/BB3YGQ4BCCGTCXNSAGRJHBLUJZ/bundle.json","state":"https://pith.science/pith/BB3YGQ4BCCGTCXNSAGRJHBLUJZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BB3YGQ4BCCGTCXNSAGRJHBLUJZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BB3YGQ4BCCGTCXNSAGRJHBLUJZ","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":"e5e4ff53a95248d2b7734060faab00d8919b912d8d8a2486113db3dc1b9ee8d8","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-07T17:56:57Z","title_canon_sha256":"0d0a921f70c978ecb9c1c4506d6dbf1da69c057a1f7b792fc63581b69bee70e2"},"schema_version":"1.0","source":{"id":"1711.02637","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02637","created_at":"2026-05-18T00:31:07Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02637v1","created_at":"2026-05-18T00:31:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02637","created_at":"2026-05-18T00:31:07Z"},{"alias_kind":"pith_short_12","alias_value":"BB3YGQ4BCCGT","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BB3YGQ4BCCGTCXNS","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BB3YGQ4B","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:7b1aea719a447353d183ed3a6be2831b285fc1e6468383b6a4a99f34744a288d","target":"graph","created_at":"2026-05-18T00:31:07Z","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":"Importance sampling has become an indispensable strategy to speed up optimization algorithms for large-scale applications. Improved adaptive variants - using importance values defined by the complete gradient information which changes during optimization - enjoy favorable theoretical properties, but are typically computationally infeasible. In this paper we propose an efficient approximation of gradient-based sampling, which is based on safe bounds on the gradient. The proposed sampling distribution is (i) provably the best sampling with respect to the given bounds, (ii) always better than uni","authors_text":"Anant Raj, Martin Jaggi, Sebastian U. Stich","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-07T17:56:57Z","title":"Safe Adaptive Importance Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02637","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:d7a516fde0690c4bce6ccd06fe5fd9fcb701f19f0b5c6e9a03334697014caecf","target":"record","created_at":"2026-05-18T00:31:07Z","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":"e5e4ff53a95248d2b7734060faab00d8919b912d8d8a2486113db3dc1b9ee8d8","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-07T17:56:57Z","title_canon_sha256":"0d0a921f70c978ecb9c1c4506d6dbf1da69c057a1f7b792fc63581b69bee70e2"},"schema_version":"1.0","source":{"id":"1711.02637","kind":"arxiv","version":1}},"canonical_sha256":"0877834381108d315db201a29385744e7f182e54e8149006353168da1730144f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0877834381108d315db201a29385744e7f182e54e8149006353168da1730144f","first_computed_at":"2026-05-18T00:31:07.386916Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:07.386916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4HXBvGh3Oa6jrxKp/8vCjCzu3AaywAcFkXLZl8gk/yECfcLNu4ahc5iBIteCcj34IVaKhRyGq68iD758ErQyDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:07.387608Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.02637","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7a516fde0690c4bce6ccd06fe5fd9fcb701f19f0b5c6e9a03334697014caecf","sha256:7b1aea719a447353d183ed3a6be2831b285fc1e6468383b6a4a99f34744a288d"],"state_sha256":"45b18e3fa05283ea1d9e49bba9eb53eab3ab576de20c3a0f19ecc54cbf7cc89f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b8hO3IzrlK8kUiIFWCKzmlmFUx6uWhPFhy161k3Q2UY9+OPfEANjl1w5ydprosxugflfulBM/4ecpEAe6Ly7Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:17:50.323278Z","bundle_sha256":"001edeb6dcd3c1122e83fc029dbae50c13f0e3688cd50754df14cb23731504de"}}