{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CEKCVBWQT45EJASCAJDDYLXTWP","short_pith_number":"pith:CEKCVBWQ","canonical_record":{"source":{"id":"1709.07149","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-21T03:51:16Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1c5eb28ebf211a89520209a4595d95f26a8c44b5ed72766003012ce91ffffd1f","abstract_canon_sha256":"31d59b3b89a69e6749162bec52f43756f419451b9bec943b367c1e2d83308611"},"schema_version":"1.0"},"canonical_sha256":"11142a86d09f3a44824202463c2ef3b3fd59624532faa0753dc98e16bfec46bf","source":{"kind":"arxiv","id":"1709.07149","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07149","created_at":"2026-05-18T00:33:38Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07149v2","created_at":"2026-05-18T00:33:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07149","created_at":"2026-05-18T00:33:38Z"},{"alias_kind":"pith_short_12","alias_value":"CEKCVBWQT45E","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CEKCVBWQT45EJASC","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CEKCVBWQ","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CEKCVBWQT45EJASCAJDDYLXTWP","target":"record","payload":{"canonical_record":{"source":{"id":"1709.07149","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-21T03:51:16Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1c5eb28ebf211a89520209a4595d95f26a8c44b5ed72766003012ce91ffffd1f","abstract_canon_sha256":"31d59b3b89a69e6749162bec52f43756f419451b9bec943b367c1e2d83308611"},"schema_version":"1.0"},"canonical_sha256":"11142a86d09f3a44824202463c2ef3b3fd59624532faa0753dc98e16bfec46bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:38.806207Z","signature_b64":"KYqWc4B36cZBRxOjypJiWKrce1p7B/PeNrz/pSxaVvMgKpo5O7aLiwh5ch9XV7UphZpz1OlrZmiqLqbUKX/6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11142a86d09f3a44824202463c2ef3b3fd59624532faa0753dc98e16bfec46bf","last_reissued_at":"2026-05-18T00:33:38.805600Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:38.805600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.07149","source_version":2,"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:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2KoUrgzZ0xJdytVP1Gp/+abTbDKUTl2k4206bpdazP1HTzc5Wv1ahiJLivHU6Qbce3ghdH9kvWc4p26gdYeKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:02:24.792957Z"},"content_sha256":"6f8a0145aab04871ebbb594cbfa53cf1e4e2284caad0fa76ac49ac3d37a556d4","schema_version":"1.0","event_id":"sha256:6f8a0145aab04871ebbb594cbfa53cf1e4e2284caad0fa76ac49ac3d37a556d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CEKCVBWQT45EJASCAJDDYLXTWP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning RBM with a DC programming Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"P. S. Sastry, Vidyadhar Upadhya","submitted_at":"2017-09-21T03:51:16Z","abstract_excerpt":"By exploiting the property that the RBM log-likelihood function is the difference of convex functions, we formulate a stochastic variant of the difference of convex functions (DC) programming to minimize the negative log-likelihood. Interestingly, the traditional contrastive divergence algorithm is a special case of the above formulation and the hyperparameters of the two algorithms can be chosen such that the amount of computation per mini-batch is identical. We show that for a given computational budget the proposed algorithm almost always reaches a higher log-likelihood more rapidly, compar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07149","kind":"arxiv","version":2},"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:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RGQ/+0eNYeCHH5bnil8cVdD3tRxqtvs6/41yMmyGJFdKnNNXZ5i8cKsL96OM+6fV4Hy2vclSPvWkZaQtTzGvBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:02:24.794083Z"},"content_sha256":"2ada024e6c6d560ada060222bb2e25b8ab60966406afb11a6d056df8fb9aabc2","schema_version":"1.0","event_id":"sha256:2ada024e6c6d560ada060222bb2e25b8ab60966406afb11a6d056df8fb9aabc2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CEKCVBWQT45EJASCAJDDYLXTWP/bundle.json","state_url":"https://pith.science/pith/CEKCVBWQT45EJASCAJDDYLXTWP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CEKCVBWQT45EJASCAJDDYLXTWP/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-11T06:02:24Z","links":{"resolver":"https://pith.science/pith/CEKCVBWQT45EJASCAJDDYLXTWP","bundle":"https://pith.science/pith/CEKCVBWQT45EJASCAJDDYLXTWP/bundle.json","state":"https://pith.science/pith/CEKCVBWQT45EJASCAJDDYLXTWP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CEKCVBWQT45EJASCAJDDYLXTWP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CEKCVBWQT45EJASCAJDDYLXTWP","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":"31d59b3b89a69e6749162bec52f43756f419451b9bec943b367c1e2d83308611","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-21T03:51:16Z","title_canon_sha256":"1c5eb28ebf211a89520209a4595d95f26a8c44b5ed72766003012ce91ffffd1f"},"schema_version":"1.0","source":{"id":"1709.07149","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07149","created_at":"2026-05-18T00:33:38Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07149v2","created_at":"2026-05-18T00:33:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07149","created_at":"2026-05-18T00:33:38Z"},{"alias_kind":"pith_short_12","alias_value":"CEKCVBWQT45E","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CEKCVBWQT45EJASC","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CEKCVBWQ","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:2ada024e6c6d560ada060222bb2e25b8ab60966406afb11a6d056df8fb9aabc2","target":"graph","created_at":"2026-05-18T00:33:38Z","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":"By exploiting the property that the RBM log-likelihood function is the difference of convex functions, we formulate a stochastic variant of the difference of convex functions (DC) programming to minimize the negative log-likelihood. Interestingly, the traditional contrastive divergence algorithm is a special case of the above formulation and the hyperparameters of the two algorithms can be chosen such that the amount of computation per mini-batch is identical. We show that for a given computational budget the proposed algorithm almost always reaches a higher log-likelihood more rapidly, compar","authors_text":"P. S. Sastry, Vidyadhar Upadhya","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-21T03:51:16Z","title":"Learning RBM with a DC programming Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07149","kind":"arxiv","version":2},"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:6f8a0145aab04871ebbb594cbfa53cf1e4e2284caad0fa76ac49ac3d37a556d4","target":"record","created_at":"2026-05-18T00:33:38Z","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":"31d59b3b89a69e6749162bec52f43756f419451b9bec943b367c1e2d83308611","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-21T03:51:16Z","title_canon_sha256":"1c5eb28ebf211a89520209a4595d95f26a8c44b5ed72766003012ce91ffffd1f"},"schema_version":"1.0","source":{"id":"1709.07149","kind":"arxiv","version":2}},"canonical_sha256":"11142a86d09f3a44824202463c2ef3b3fd59624532faa0753dc98e16bfec46bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11142a86d09f3a44824202463c2ef3b3fd59624532faa0753dc98e16bfec46bf","first_computed_at":"2026-05-18T00:33:38.805600Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:38.805600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KYqWc4B36cZBRxOjypJiWKrce1p7B/PeNrz/pSxaVvMgKpo5O7aLiwh5ch9XV7UphZpz1OlrZmiqLqbUKX/6Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:38.806207Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.07149","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f8a0145aab04871ebbb594cbfa53cf1e4e2284caad0fa76ac49ac3d37a556d4","sha256:2ada024e6c6d560ada060222bb2e25b8ab60966406afb11a6d056df8fb9aabc2"],"state_sha256":"7b9273039cc5caca11dbcc67a06c72d3cd7e44c47193e50a0e61f05354f4d809"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2n3EqggKXLeqQa0QL9GtV2vQap4jCz31yhHU/xlJUIBMNqkIjoaKOAy2Mf9i96DKZwmOYwcbUWc30UAHbROCBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:02:24.798069Z","bundle_sha256":"e53a997e2342175e9cf3576e5ed67d455b9cbed07c7a62085ece12f9f9194ad2"}}