{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KNKBRYEC6MH2UYAETRAEFAEITD","short_pith_number":"pith:KNKBRYEC","canonical_record":{"source":{"id":"1508.04876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-08-20T05:01:52Z","cross_cats_sorted":[],"title_canon_sha256":"801202430c89cf76c05843e30a4fd7de7d2db6919143f7a2cd677f1f72667571","abstract_canon_sha256":"2562a8d00c7c614bfb6ec7589cdde3f02d6946e72ba69c3d29614fc3b13122d2"},"schema_version":"1.0"},"canonical_sha256":"535418e082f30faa60049c4042808898d16a1f177f0bee73fc629b3b48f7c4fb","source":{"kind":"arxiv","id":"1508.04876","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04876","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04876v1","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04876","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"pith_short_12","alias_value":"KNKBRYEC6MH2","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KNKBRYEC6MH2UYAE","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KNKBRYEC","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KNKBRYEC6MH2UYAETRAEFAEITD","target":"record","payload":{"canonical_record":{"source":{"id":"1508.04876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-08-20T05:01:52Z","cross_cats_sorted":[],"title_canon_sha256":"801202430c89cf76c05843e30a4fd7de7d2db6919143f7a2cd677f1f72667571","abstract_canon_sha256":"2562a8d00c7c614bfb6ec7589cdde3f02d6946e72ba69c3d29614fc3b13122d2"},"schema_version":"1.0"},"canonical_sha256":"535418e082f30faa60049c4042808898d16a1f177f0bee73fc629b3b48f7c4fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:00.353573Z","signature_b64":"QywIfZA7IEWFB7tjJfsRrHrW4ZwVdVnlor9wx0+zhRZ4St3rocKDo6sUWR1Nyj3k10V/C3Tzli0PrgWym2DfAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"535418e082f30faa60049c4042808898d16a1f177f0bee73fc629b3b48f7c4fb","last_reissued_at":"2026-05-18T01:35:00.353058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:00.353058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.04876","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-18T01:35:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qf6b26XnoRrt2TMg0jA5obVUfJAA4Ys7gDBPYzTTlEJrwElUob4Wz8aqOAjgVxHSK+sn/Y/zH4p964draAxiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:29:13.604623Z"},"content_sha256":"7ff35333bbda4a906ebf05d384ff25cd9f701e267000b0ff6585945150667824","schema_version":"1.0","event_id":"sha256:7ff35333bbda4a906ebf05d384ff25cd9f701e267000b0ff6585945150667824"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KNKBRYEC6MH2UYAETRAEFAEITD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel and Interacting Stochastic Approximation Annealing algorithms for global optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Bledar A. Konomi, Faming Liang, Georgios Karagiannis, Guang Lin","submitted_at":"2015-08-20T05:01:52Z","abstract_excerpt":"We present the parallel and interacting stochastic approximation annealing (PISAA) algorithm, a stochastic simulation procedure for global optimisation, that extends and improves the stochastic approximation annealing (SAA) by using population Monte Carlo ideas. The standard SAA algorithm guarantees convergence to the global minimum when a square-root cooling schedule is used; however the efficiency of its performance depends crucially on its self-adjusting mechanism. Because its mechanism is based on information obtained from only a single chain, SAA may present slow convergence in complex op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04876","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-18T01:35:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TKqYIlfWQJSgdxJ8JUkZ6fFeDcPj/K9+2uodhMVPgfFRmvnfreQou6tiMmur1LeLriSAVFG4TKe9lCispN3LDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:29:13.605065Z"},"content_sha256":"23d5af246a27793dfcc247c82d3ec888085c393c2bce890b9117809a71ea8d0c","schema_version":"1.0","event_id":"sha256:23d5af246a27793dfcc247c82d3ec888085c393c2bce890b9117809a71ea8d0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KNKBRYEC6MH2UYAETRAEFAEITD/bundle.json","state_url":"https://pith.science/pith/KNKBRYEC6MH2UYAETRAEFAEITD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KNKBRYEC6MH2UYAETRAEFAEITD/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-26T12:29:13Z","links":{"resolver":"https://pith.science/pith/KNKBRYEC6MH2UYAETRAEFAEITD","bundle":"https://pith.science/pith/KNKBRYEC6MH2UYAETRAEFAEITD/bundle.json","state":"https://pith.science/pith/KNKBRYEC6MH2UYAETRAEFAEITD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KNKBRYEC6MH2UYAETRAEFAEITD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KNKBRYEC6MH2UYAETRAEFAEITD","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":"2562a8d00c7c614bfb6ec7589cdde3f02d6946e72ba69c3d29614fc3b13122d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-08-20T05:01:52Z","title_canon_sha256":"801202430c89cf76c05843e30a4fd7de7d2db6919143f7a2cd677f1f72667571"},"schema_version":"1.0","source":{"id":"1508.04876","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04876","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04876v1","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04876","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"pith_short_12","alias_value":"KNKBRYEC6MH2","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KNKBRYEC6MH2UYAE","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KNKBRYEC","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:23d5af246a27793dfcc247c82d3ec888085c393c2bce890b9117809a71ea8d0c","target":"graph","created_at":"2026-05-18T01:35:00Z","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 present the parallel and interacting stochastic approximation annealing (PISAA) algorithm, a stochastic simulation procedure for global optimisation, that extends and improves the stochastic approximation annealing (SAA) by using population Monte Carlo ideas. The standard SAA algorithm guarantees convergence to the global minimum when a square-root cooling schedule is used; however the efficiency of its performance depends crucially on its self-adjusting mechanism. Because its mechanism is based on information obtained from only a single chain, SAA may present slow convergence in complex op","authors_text":"Bledar A. Konomi, Faming Liang, Georgios Karagiannis, Guang Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-08-20T05:01:52Z","title":"Parallel and Interacting Stochastic Approximation Annealing algorithms for global optimisation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04876","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:7ff35333bbda4a906ebf05d384ff25cd9f701e267000b0ff6585945150667824","target":"record","created_at":"2026-05-18T01:35:00Z","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":"2562a8d00c7c614bfb6ec7589cdde3f02d6946e72ba69c3d29614fc3b13122d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-08-20T05:01:52Z","title_canon_sha256":"801202430c89cf76c05843e30a4fd7de7d2db6919143f7a2cd677f1f72667571"},"schema_version":"1.0","source":{"id":"1508.04876","kind":"arxiv","version":1}},"canonical_sha256":"535418e082f30faa60049c4042808898d16a1f177f0bee73fc629b3b48f7c4fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"535418e082f30faa60049c4042808898d16a1f177f0bee73fc629b3b48f7c4fb","first_computed_at":"2026-05-18T01:35:00.353058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:00.353058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QywIfZA7IEWFB7tjJfsRrHrW4ZwVdVnlor9wx0+zhRZ4St3rocKDo6sUWR1Nyj3k10V/C3Tzli0PrgWym2DfAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:00.353573Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.04876","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ff35333bbda4a906ebf05d384ff25cd9f701e267000b0ff6585945150667824","sha256:23d5af246a27793dfcc247c82d3ec888085c393c2bce890b9117809a71ea8d0c"],"state_sha256":"5dd7ca69514bb9b4f89c0545264462b5eebb54dd4946ba2141c14ca76c0b0e2e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3VR4pKHvEff5tjysRvrJDfwe/luG66haUZmtSjWlyf1OncUf49SHPxGl+G+hUzjJSPdept748W3B3M9S5x7NDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T12:29:13.608216Z","bundle_sha256":"1806d77ca82c2c0ae6239b0dd87a690ed08fa0b48f9cdb04d6226fe2b1b10996"}}