{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SU47IGQDOK45AIJPSCR3LGYNP6","short_pith_number":"pith:SU47IGQD","schema_version":"1.0","canonical_sha256":"9539f41a0372b9d0212f90a3b59b0d7f9344bd55bd728e647067f7f50dab7506","source":{"kind":"arxiv","id":"1806.03953","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.03953","created_at":"2026-05-18T00:04:07.605138+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.03953v3","created_at":"2026-05-18T00:04:07.605138+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03953","created_at":"2026-05-18T00:04:07.605138+00:00"},{"alias_kind":"pith_short_12","alias_value":"SU47IGQDOK45","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SU47IGQDOK45AIJP","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SU47IGQD","created_at":"2026-05-18T12:32:53.628368+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SU47IGQDOK45AIJPSCR3LGYNP6","json":"https://pith.science/pith/SU47IGQDOK45AIJPSCR3LGYNP6.json","graph_json":"https://pith.science/api/pith-number/SU47IGQDOK45AIJPSCR3LGYNP6/graph.json","events_json":"https://pith.science/api/pith-number/SU47IGQDOK45AIJPSCR3LGYNP6/events.json","paper":"https://pith.science/paper/SU47IGQD"},"agent_actions":{"view_html":"https://pith.science/pith/SU47IGQDOK45AIJPSCR3LGYNP6","download_json":"https://pith.science/pith/SU47IGQDOK45AIJPSCR3LGYNP6.json","view_paper":"https://pith.science/paper/SU47IGQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.03953&json=true","fetch_graph":"https://pith.science/api/pith-number/SU47IGQDOK45AIJPSCR3LGYNP6/graph.json","fetch_events":"https://pith.science/api/pith-number/SU47IGQDOK45AIJPSCR3LGYNP6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SU47IGQDOK45AIJPSCR3LGYNP6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SU47IGQDOK45AIJPSCR3LGYNP6/action/storage_attestation","attest_author":"https://pith.science/pith/SU47IGQDOK45AIJPSCR3LGYNP6/action/author_attestation","sign_citation":"https://pith.science/pith/SU47IGQDOK45AIJPSCR3LGYNP6/action/citation_signature","submit_replication":"https://pith.science/pith/SU47IGQDOK45AIJPSCR3LGYNP6/action/replication_record"}},"created_at":"2026-05-18T00:04:07.605138+00:00","updated_at":"2026-05-18T00:04:07.605138+00:00"}