{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SU47IGQDOK45AIJPSCR3LGYNP6","short_pith_number":"pith:SU47IGQD","canonical_record":{"source":{"id":"1806.03953","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-06-11T13:13:54Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0e1ecf1d8224d8756bf242982b2e998da359a4103189c860b269a5edd67ca01e","abstract_canon_sha256":"69e48d3cad38cde4292adf4ed378725ad9cde9175b215981afa1c2939152cfaa"},"schema_version":"1.0"},"canonical_sha256":"9539f41a0372b9d0212f90a3b59b0d7f9344bd55bd728e647067f7f50dab7506","source":{"kind":"arxiv","id":"1806.03953","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03953","created_at":"2026-05-18T00:04:07Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03953v3","created_at":"2026-05-18T00:04:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03953","created_at":"2026-05-18T00:04:07Z"},{"alias_kind":"pith_short_12","alias_value":"SU47IGQDOK45","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SU47IGQDOK45AIJP","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SU47IGQD","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SU47IGQDOK45AIJPSCR3LGYNP6","target":"record","payload":{"canonical_record":{"source":{"id":"1806.03953","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-06-11T13:13:54Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0e1ecf1d8224d8756bf242982b2e998da359a4103189c860b269a5edd67ca01e","abstract_canon_sha256":"69e48d3cad38cde4292adf4ed378725ad9cde9175b215981afa1c2939152cfaa"},"schema_version":"1.0"},"canonical_sha256":"9539f41a0372b9d0212f90a3b59b0d7f9344bd55bd728e647067f7f50dab7506","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:07.605694Z","signature_b64":"78q9ALZNOyL7BvMrciMwGG4t7KrIfkIQsmNerYT4Q5woo4Iuw98ncjg1s3iNmWWNoq10wLdDhz7fCWfwmB22Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9539f41a0372b9d0212f90a3b59b0d7f9344bd55bd728e647067f7f50dab7506","last_reissued_at":"2026-05-18T00:04:07.605035Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:07.605035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.03953","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:04:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hVjPZ48qIpLYbsA58PAp+eeuQB4s+IdStBwgpyaSeljtdb5I8V8Vsq3Y+L0NhzdNC+mvorZ3hpiTYVOGTuvOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:57:21.384301Z"},"content_sha256":"fad29e782ae36bc33154042b9a47eee0042456fcc23f899d04471a95d8103edb","schema_version":"1.0","event_id":"sha256:fad29e782ae36bc33154042b9a47eee0042456fcc23f899d04471a95d8103edb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SU47IGQDOK45AIJPSCR3LGYNP6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Linear Temporal Properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.LO","authors_text":"Daniel Neider, Ivan Gavran","submitted_at":"2018-06-11T13:13:54Z","abstract_excerpt":"We present two novel algorithms for learning formulas in Linear Temporal Logic (LTL) from examples. The first learning algorithm reduces the learning task to a series of satisfiability problems in propositional Boolean logic and produces a smallest LTL formula (in terms of the number of subformulas) that is consistent with the given data. Our second learning algorithm, on the other hand, combines the SAT-based learning algorithm with classical algorithms for learning decision trees. The result is a learning algorithm that scales to real-world scenarios with hundreds of examples, but can no lon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03953","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:04:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b2EhMUsCfsIBpZYylW0bHv8jGWLxpzbpsMcbVBP4WCwImzjNtzlzHe2VzBZ3QqLVqJpZ2QQgz++qOznWAKo4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:57:21.385003Z"},"content_sha256":"e6d60a6e94d30d40d2415046f6d75982ccae352602345245a6029c0268b2a458","schema_version":"1.0","event_id":"sha256:e6d60a6e94d30d40d2415046f6d75982ccae352602345245a6029c0268b2a458"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SU47IGQDOK45AIJPSCR3LGYNP6/bundle.json","state_url":"https://pith.science/pith/SU47IGQDOK45AIJPSCR3LGYNP6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SU47IGQDOK45AIJPSCR3LGYNP6/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-27T09:57:21Z","links":{"resolver":"https://pith.science/pith/SU47IGQDOK45AIJPSCR3LGYNP6","bundle":"https://pith.science/pith/SU47IGQDOK45AIJPSCR3LGYNP6/bundle.json","state":"https://pith.science/pith/SU47IGQDOK45AIJPSCR3LGYNP6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SU47IGQDOK45AIJPSCR3LGYNP6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SU47IGQDOK45AIJPSCR3LGYNP6","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":"69e48d3cad38cde4292adf4ed378725ad9cde9175b215981afa1c2939152cfaa","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-06-11T13:13:54Z","title_canon_sha256":"0e1ecf1d8224d8756bf242982b2e998da359a4103189c860b269a5edd67ca01e"},"schema_version":"1.0","source":{"id":"1806.03953","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03953","created_at":"2026-05-18T00:04:07Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03953v3","created_at":"2026-05-18T00:04:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03953","created_at":"2026-05-18T00:04:07Z"},{"alias_kind":"pith_short_12","alias_value":"SU47IGQDOK45","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SU47IGQDOK45AIJP","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SU47IGQD","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:e6d60a6e94d30d40d2415046f6d75982ccae352602345245a6029c0268b2a458","target":"graph","created_at":"2026-05-18T00:04: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":"We present two novel algorithms for learning formulas in Linear Temporal Logic (LTL) from examples. The first learning algorithm reduces the learning task to a series of satisfiability problems in propositional Boolean logic and produces a smallest LTL formula (in terms of the number of subformulas) that is consistent with the given data. Our second learning algorithm, on the other hand, combines the SAT-based learning algorithm with classical algorithms for learning decision trees. The result is a learning algorithm that scales to real-world scenarios with hundreds of examples, but can no lon","authors_text":"Daniel Neider, Ivan Gavran","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-06-11T13:13:54Z","title":"Learning Linear Temporal Properties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03953","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:fad29e782ae36bc33154042b9a47eee0042456fcc23f899d04471a95d8103edb","target":"record","created_at":"2026-05-18T00:04: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":"69e48d3cad38cde4292adf4ed378725ad9cde9175b215981afa1c2939152cfaa","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-06-11T13:13:54Z","title_canon_sha256":"0e1ecf1d8224d8756bf242982b2e998da359a4103189c860b269a5edd67ca01e"},"schema_version":"1.0","source":{"id":"1806.03953","kind":"arxiv","version":3}},"canonical_sha256":"9539f41a0372b9d0212f90a3b59b0d7f9344bd55bd728e647067f7f50dab7506","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9539f41a0372b9d0212f90a3b59b0d7f9344bd55bd728e647067f7f50dab7506","first_computed_at":"2026-05-18T00:04:07.605035Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:07.605035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"78q9ALZNOyL7BvMrciMwGG4t7KrIfkIQsmNerYT4Q5woo4Iuw98ncjg1s3iNmWWNoq10wLdDhz7fCWfwmB22Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:07.605694Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.03953","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fad29e782ae36bc33154042b9a47eee0042456fcc23f899d04471a95d8103edb","sha256:e6d60a6e94d30d40d2415046f6d75982ccae352602345245a6029c0268b2a458"],"state_sha256":"4f4905b8bb28e19c52d27757212170fe946822ea36037cb47b6b9e3790fc66d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DAbPl74ovc/7qzL6oPOOS2cfZMwz8wxLV0ruJpgbhp1DBS94jjkd5v8Mqa/A4or0d9lev0TwNbFukELUecLHAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:57:21.387791Z","bundle_sha256":"42f43667991cb25686070d7bfe5936c4a5d0ad429909e3239f56eabc9240a077"}}