{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SKY2VNLDLPKPJ67IEIE263JQIE","short_pith_number":"pith:SKY2VNLD","canonical_record":{"source":{"id":"1711.06202","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-11-13T17:31:08Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"50b9a788e9c0449bb949e71b6b2a6b959f744b79af3b7db9a1f94e7e5c2330d4","abstract_canon_sha256":"62379b82da8b7064a9f030812e0bd5ce0618a970bcf545d1a306ec77c63b0399"},"schema_version":"1.0"},"canonical_sha256":"92b1aab5635bd4f4fbe82209af6d304120a831c43a7feeae9612d29c8e17333c","source":{"kind":"arxiv","id":"1711.06202","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06202","created_at":"2026-05-18T00:09:09Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06202v3","created_at":"2026-05-18T00:09:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06202","created_at":"2026-05-18T00:09:09Z"},{"alias_kind":"pith_short_12","alias_value":"SKY2VNLDLPKP","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SKY2VNLDLPKPJ67I","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SKY2VNLD","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SKY2VNLDLPKPJ67IEIE263JQIE","target":"record","payload":{"canonical_record":{"source":{"id":"1711.06202","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-11-13T17:31:08Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"50b9a788e9c0449bb949e71b6b2a6b959f744b79af3b7db9a1f94e7e5c2330d4","abstract_canon_sha256":"62379b82da8b7064a9f030812e0bd5ce0618a970bcf545d1a306ec77c63b0399"},"schema_version":"1.0"},"canonical_sha256":"92b1aab5635bd4f4fbe82209af6d304120a831c43a7feeae9612d29c8e17333c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:09.791396Z","signature_b64":"CvbgpECDj2is4+wwZXKRw7Med1+dDq+X45uFnFxAUHvwR/V8wvFohgwVGsRXxYoAfiYqMKFgHCwspCEvQba6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92b1aab5635bd4f4fbe82209af6d304120a831c43a7feeae9612d29c8e17333c","last_reissued_at":"2026-05-18T00:09:09.790659Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:09.790659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.06202","source_version":3,"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:09:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rXPbrQE8KVueN3/IQpQqVwY/RdK4OouJEmfrPA5nqhUzvSV0DlEKncAVuzdUaAgcsvQ+IMe3Yrd2MVAe9W/QCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:28:58.762490Z"},"content_sha256":"a54930ec51f197e6b4e5a4e53520d137ff5ca75adfe163b68330e5827c67431a","schema_version":"1.0","event_id":"sha256:a54930ec51f197e6b4e5a4e53520d137ff5ca75adfe163b68330e5827c67431a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SKY2VNLDLPKPJ67IEIE263JQIE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Robust Genetic Algorithm for Learning Temporal Specifications from Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Ezio Bartocci, Laura Nenzi, Luca Bortolussi, Simone Silvetti","submitted_at":"2017-11-13T17:31:08Z","abstract_excerpt":"We consider the problem of mining signal temporal logical requirements from a dataset of regular (good) and anomalous (bad) trajectories of a dynamical system. We assume the training set to be labeled by human experts and that we have access only to a limited amount of data, typically noisy. We provide a systematic approach to synthesize both the syntactical structure and the parameters of the temporal logic formula using a two-steps procedure: first, we leverage a novel evolutionary algorithm for learning the structure of the formula; second, we perform the parameter synthesis operating on th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06202","kind":"arxiv","version":3},"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:09:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GUtkHN4TZIK6rOiI6o/aX0nV5HRJFsU0taCNQuf5Tun6TF5YmY9ekxT/ppTCiH05PcAc83VWUA1Ajg386Qo+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:28:58.763168Z"},"content_sha256":"fc7967ae13c5320ec605685e990a0e60b50dfcd305952188852830a8b526e7dc","schema_version":"1.0","event_id":"sha256:fc7967ae13c5320ec605685e990a0e60b50dfcd305952188852830a8b526e7dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SKY2VNLDLPKPJ67IEIE263JQIE/bundle.json","state_url":"https://pith.science/pith/SKY2VNLDLPKPJ67IEIE263JQIE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SKY2VNLDLPKPJ67IEIE263JQIE/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-28T20:28:58Z","links":{"resolver":"https://pith.science/pith/SKY2VNLDLPKPJ67IEIE263JQIE","bundle":"https://pith.science/pith/SKY2VNLDLPKPJ67IEIE263JQIE/bundle.json","state":"https://pith.science/pith/SKY2VNLDLPKPJ67IEIE263JQIE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SKY2VNLDLPKPJ67IEIE263JQIE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SKY2VNLDLPKPJ67IEIE263JQIE","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":"62379b82da8b7064a9f030812e0bd5ce0618a970bcf545d1a306ec77c63b0399","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-11-13T17:31:08Z","title_canon_sha256":"50b9a788e9c0449bb949e71b6b2a6b959f744b79af3b7db9a1f94e7e5c2330d4"},"schema_version":"1.0","source":{"id":"1711.06202","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06202","created_at":"2026-05-18T00:09:09Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06202v3","created_at":"2026-05-18T00:09:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06202","created_at":"2026-05-18T00:09:09Z"},{"alias_kind":"pith_short_12","alias_value":"SKY2VNLDLPKP","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SKY2VNLDLPKPJ67I","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SKY2VNLD","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:fc7967ae13c5320ec605685e990a0e60b50dfcd305952188852830a8b526e7dc","target":"graph","created_at":"2026-05-18T00:09:09Z","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 consider the problem of mining signal temporal logical requirements from a dataset of regular (good) and anomalous (bad) trajectories of a dynamical system. We assume the training set to be labeled by human experts and that we have access only to a limited amount of data, typically noisy. We provide a systematic approach to synthesize both the syntactical structure and the parameters of the temporal logic formula using a two-steps procedure: first, we leverage a novel evolutionary algorithm for learning the structure of the formula; second, we perform the parameter synthesis operating on th","authors_text":"Ezio Bartocci, Laura Nenzi, Luca Bortolussi, Simone Silvetti","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-11-13T17:31:08Z","title":"A Robust Genetic Algorithm for Learning Temporal Specifications from Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06202","kind":"arxiv","version":3},"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:a54930ec51f197e6b4e5a4e53520d137ff5ca75adfe163b68330e5827c67431a","target":"record","created_at":"2026-05-18T00:09:09Z","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":"62379b82da8b7064a9f030812e0bd5ce0618a970bcf545d1a306ec77c63b0399","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-11-13T17:31:08Z","title_canon_sha256":"50b9a788e9c0449bb949e71b6b2a6b959f744b79af3b7db9a1f94e7e5c2330d4"},"schema_version":"1.0","source":{"id":"1711.06202","kind":"arxiv","version":3}},"canonical_sha256":"92b1aab5635bd4f4fbe82209af6d304120a831c43a7feeae9612d29c8e17333c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92b1aab5635bd4f4fbe82209af6d304120a831c43a7feeae9612d29c8e17333c","first_computed_at":"2026-05-18T00:09:09.790659Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:09.790659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CvbgpECDj2is4+wwZXKRw7Med1+dDq+X45uFnFxAUHvwR/V8wvFohgwVGsRXxYoAfiYqMKFgHCwspCEvQba6DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:09.791396Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.06202","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a54930ec51f197e6b4e5a4e53520d137ff5ca75adfe163b68330e5827c67431a","sha256:fc7967ae13c5320ec605685e990a0e60b50dfcd305952188852830a8b526e7dc"],"state_sha256":"26d689249e5f1c8a80ea4c1190d4c1b11d330f4587d71559c4f21c917a5b6583"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7TC7fRAcWd10mOAo3P1oX4m6DDtwbgq6SF8Co+APto2hCB8zaobtNkqrVP5igIB7KipaT7hvz4Tl6gxquYRlBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:28:58.766783Z","bundle_sha256":"d4c545e83cd13233e7eeedd8061aaa08b561362f3b57e25d08d3077b7758aeb8"}}