{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:42CB6WFPOXQYUZ5REQQHKZ6VJB","short_pith_number":"pith:42CB6WFP","canonical_record":{"source":{"id":"1906.01504","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-04T15:14:36Z","cross_cats_sorted":["cs.AI","cs.DM","math.OC","stat.ML"],"title_canon_sha256":"b3c57a95621e41371b73b0a172d73afd3c57f4184b2e13612e4df54cf113423c","abstract_canon_sha256":"8f4f1d5cce7a3751e9e87aecc89c090fe87bc8b7a19958524cb1e98391c26e2e"},"schema_version":"1.0"},"canonical_sha256":"e6841f58af75e18a67b124207567d5487054709eec0f3399fa48c988ca7e4bfb","source":{"kind":"arxiv","id":"1906.01504","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01504","created_at":"2026-05-17T23:44:16Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01504v1","created_at":"2026-05-17T23:44:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01504","created_at":"2026-05-17T23:44:16Z"},{"alias_kind":"pith_short_12","alias_value":"42CB6WFPOXQY","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"42CB6WFPOXQYUZ5R","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"42CB6WFP","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:42CB6WFPOXQYUZ5REQQHKZ6VJB","target":"record","payload":{"canonical_record":{"source":{"id":"1906.01504","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-04T15:14:36Z","cross_cats_sorted":["cs.AI","cs.DM","math.OC","stat.ML"],"title_canon_sha256":"b3c57a95621e41371b73b0a172d73afd3c57f4184b2e13612e4df54cf113423c","abstract_canon_sha256":"8f4f1d5cce7a3751e9e87aecc89c090fe87bc8b7a19958524cb1e98391c26e2e"},"schema_version":"1.0"},"canonical_sha256":"e6841f58af75e18a67b124207567d5487054709eec0f3399fa48c988ca7e4bfb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:16.353243Z","signature_b64":"T/1Rl61huy5qK1RH9rup8TtC63jpwCKuxQrAHajpvVzb813cim5y9X+wE7iijezEaQ3Rz7+lQuSlxpVAhRbLBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6841f58af75e18a67b124207567d5487054709eec0f3399fa48c988ca7e4bfb","last_reissued_at":"2026-05-17T23:44:16.352830Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:16.352830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.01504","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-17T23:44:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bGdf5Zx2UwogS7f/Fr7erMyQu+Xq9vQCmd6vFnxNO5lazwcuxAy7zyL4zWx3Kl6lv4zouoPw//o3oM57wN0NCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:55:22.765710Z"},"content_sha256":"5bd89b0b3e5cb9a2c7877e67edb83ae113ec08ac02061f58f679b0281040975f","schema_version":"1.0","event_id":"sha256:5bd89b0b3e5cb9a2c7877e67edb83ae113ec08ac02061f58f679b0281040975f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:42CB6WFPOXQYUZ5REQQHKZ6VJB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Embedded hyper-parameter tuning by Simulated Annealing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DM","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Matteo Fischetti, Matteo Stringher","submitted_at":"2019-06-04T15:14:36Z","abstract_excerpt":"We propose a new metaheuristic training scheme that combines Stochastic Gradient Descent (SGD) and Discrete Optimization in an unconventional way. Our idea is to define a discrete neighborhood of the current SGD point containing a number of \"potentially good moves\" that exploit gradient information, and to search this neighborhood by using a classical metaheuristic scheme borrowed from Discrete Optimization.\n  In the present paper we investigate the use of a simple Simulated Annealing (SA) metaheuristic that accepts/rejects a candidate new solution in the neighborhood with a probability that d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01504","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-17T23:44:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3XdY9Z9et7hkm+5R8H5wb1dSQHkOvAVOtyHjWGTqd+PCFYLowgaRMyfGXOfGwZm5gdu88PaZ8BW06hg0EcPABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:55:22.766058Z"},"content_sha256":"3d0ca6a4b8181f76f04519a432d2a9877b8c4f003fdf299e100f74ff55d574e8","schema_version":"1.0","event_id":"sha256:3d0ca6a4b8181f76f04519a432d2a9877b8c4f003fdf299e100f74ff55d574e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/42CB6WFPOXQYUZ5REQQHKZ6VJB/bundle.json","state_url":"https://pith.science/pith/42CB6WFPOXQYUZ5REQQHKZ6VJB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/42CB6WFPOXQYUZ5REQQHKZ6VJB/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-03T02:55:22Z","links":{"resolver":"https://pith.science/pith/42CB6WFPOXQYUZ5REQQHKZ6VJB","bundle":"https://pith.science/pith/42CB6WFPOXQYUZ5REQQHKZ6VJB/bundle.json","state":"https://pith.science/pith/42CB6WFPOXQYUZ5REQQHKZ6VJB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/42CB6WFPOXQYUZ5REQQHKZ6VJB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:42CB6WFPOXQYUZ5REQQHKZ6VJB","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":"8f4f1d5cce7a3751e9e87aecc89c090fe87bc8b7a19958524cb1e98391c26e2e","cross_cats_sorted":["cs.AI","cs.DM","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-04T15:14:36Z","title_canon_sha256":"b3c57a95621e41371b73b0a172d73afd3c57f4184b2e13612e4df54cf113423c"},"schema_version":"1.0","source":{"id":"1906.01504","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01504","created_at":"2026-05-17T23:44:16Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01504v1","created_at":"2026-05-17T23:44:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01504","created_at":"2026-05-17T23:44:16Z"},{"alias_kind":"pith_short_12","alias_value":"42CB6WFPOXQY","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"42CB6WFPOXQYUZ5R","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"42CB6WFP","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:3d0ca6a4b8181f76f04519a432d2a9877b8c4f003fdf299e100f74ff55d574e8","target":"graph","created_at":"2026-05-17T23:44:16Z","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 propose a new metaheuristic training scheme that combines Stochastic Gradient Descent (SGD) and Discrete Optimization in an unconventional way. Our idea is to define a discrete neighborhood of the current SGD point containing a number of \"potentially good moves\" that exploit gradient information, and to search this neighborhood by using a classical metaheuristic scheme borrowed from Discrete Optimization.\n  In the present paper we investigate the use of a simple Simulated Annealing (SA) metaheuristic that accepts/rejects a candidate new solution in the neighborhood with a probability that d","authors_text":"Matteo Fischetti, Matteo Stringher","cross_cats":["cs.AI","cs.DM","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-04T15:14:36Z","title":"Embedded hyper-parameter tuning by Simulated Annealing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01504","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:5bd89b0b3e5cb9a2c7877e67edb83ae113ec08ac02061f58f679b0281040975f","target":"record","created_at":"2026-05-17T23:44:16Z","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":"8f4f1d5cce7a3751e9e87aecc89c090fe87bc8b7a19958524cb1e98391c26e2e","cross_cats_sorted":["cs.AI","cs.DM","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-04T15:14:36Z","title_canon_sha256":"b3c57a95621e41371b73b0a172d73afd3c57f4184b2e13612e4df54cf113423c"},"schema_version":"1.0","source":{"id":"1906.01504","kind":"arxiv","version":1}},"canonical_sha256":"e6841f58af75e18a67b124207567d5487054709eec0f3399fa48c988ca7e4bfb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6841f58af75e18a67b124207567d5487054709eec0f3399fa48c988ca7e4bfb","first_computed_at":"2026-05-17T23:44:16.352830Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:16.352830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T/1Rl61huy5qK1RH9rup8TtC63jpwCKuxQrAHajpvVzb813cim5y9X+wE7iijezEaQ3Rz7+lQuSlxpVAhRbLBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:16.353243Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.01504","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5bd89b0b3e5cb9a2c7877e67edb83ae113ec08ac02061f58f679b0281040975f","sha256:3d0ca6a4b8181f76f04519a432d2a9877b8c4f003fdf299e100f74ff55d574e8"],"state_sha256":"97b0edbc37d92995304976961b4c4e482d73eb1a5539e346c014393c9eb72d50"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AXNO2DtZtqq5iXdQVF/JJT4FP3+Dz5jQ9DXKo7yA39JsNJiwPSNGsvFV03OfzNU0RfwfNZ3NceUtWnNhFb+lAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:55:22.768106Z","bundle_sha256":"45b5bb2027b98d45e3699ed71a7d736493da204398e8c04649c13f4bb31a038d"}}