{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:J3Z25MED5CPY7FA23ZJ2COZ5TM","short_pith_number":"pith:J3Z25MED","canonical_record":{"source":{"id":"2001.05786","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2020-01-16T13:20:43Z","cross_cats_sorted":[],"title_canon_sha256":"4b51c6c9f3c939df86111f6893568659371c20dffd16e713764854f7ae6dd499","abstract_canon_sha256":"957f6abeafdf2913ad23b119822b922866d80cdd7be436a76c6a17fe068b4f9d"},"schema_version":"1.0"},"canonical_sha256":"4ef3aeb083e89f8f941ade53a13b3d9b0c0217984fb29af6f548df519d084556","source":{"kind":"arxiv","id":"2001.05786","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.05786","created_at":"2026-07-05T05:38:06Z"},{"alias_kind":"arxiv_version","alias_value":"2001.05786v2","created_at":"2026-07-05T05:38:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.05786","created_at":"2026-07-05T05:38:06Z"},{"alias_kind":"pith_short_12","alias_value":"J3Z25MED5CPY","created_at":"2026-07-05T05:38:06Z"},{"alias_kind":"pith_short_16","alias_value":"J3Z25MED5CPY7FA2","created_at":"2026-07-05T05:38:06Z"},{"alias_kind":"pith_short_8","alias_value":"J3Z25MED","created_at":"2026-07-05T05:38:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:J3Z25MED5CPY7FA23ZJ2COZ5TM","target":"record","payload":{"canonical_record":{"source":{"id":"2001.05786","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2020-01-16T13:20:43Z","cross_cats_sorted":[],"title_canon_sha256":"4b51c6c9f3c939df86111f6893568659371c20dffd16e713764854f7ae6dd499","abstract_canon_sha256":"957f6abeafdf2913ad23b119822b922866d80cdd7be436a76c6a17fe068b4f9d"},"schema_version":"1.0"},"canonical_sha256":"4ef3aeb083e89f8f941ade53a13b3d9b0c0217984fb29af6f548df519d084556","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:38:06.515487Z","signature_b64":"G16RY8ya1ca6zZKOerEzBTXls0QZ6XPYKqHDNcamDwmAeIapoyTlft6ZkbnSWazyeMKDmOQ5mTwMs5EtZDT3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ef3aeb083e89f8f941ade53a13b3d9b0c0217984fb29af6f548df519d084556","last_reissued_at":"2026-07-05T05:38:06.515066Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:38:06.515066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2001.05786","source_version":2,"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-07-05T05:38:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"22FzLXHSUBXE9hThkBZipHplEbRfiLvlL/zgIkKQKKB5i9Rw/ADLnRt3pQAVvw2p297F+U0oQi3Verb7wyivBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T11:24:36.996945Z"},"content_sha256":"bc6a189749333be998c1c506e754747a709cb90c7fa55219077c8b2979680e89","schema_version":"1.0","event_id":"sha256:bc6a189749333be998c1c506e754747a709cb90c7fa55219077c8b2979680e89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:J3Z25MED5CPY7FA23ZJ2COZ5TM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Categorical Framework for Learning Generalised Tree Automata","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Alexandra Silva, Gerco van Heerdt, Jurriaan Rot, Matteo Sammartino, Tobias Kapp\\'e","submitted_at":"2020-01-16T13:20:43Z","abstract_excerpt":"Automata learning is a popular technique used to automatically construct an automaton model from queries. Much research went into devising ad hoc adaptations of algorithms for different types of automata. The CALF project seeks to unify these using category theory in order to ease correctness proofs and guide the design of new algorithms. In this paper, we extend CALF to cover learning of algebraic structures that may not have a coalgebraic presentation. Furthermore, we provide a detailed algorithmic account of an abstract version of the popular L* algorithm, which was missing from CALF. We in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.05786","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2001.05786/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:38:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MKKPDksgwG4LKeZpPJraKo51T3gGPaDcZFvuWzUtvts/a4o7WNBRo2Su/3wNV4ap/RC/9vSC5vEO7gSiRJWnCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T11:24:36.997326Z"},"content_sha256":"d3bdbdfb339876dac4079d9434906bba1463590bfb5ab0737c94d01e51e07f29","schema_version":"1.0","event_id":"sha256:d3bdbdfb339876dac4079d9434906bba1463590bfb5ab0737c94d01e51e07f29"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J3Z25MED5CPY7FA23ZJ2COZ5TM/bundle.json","state_url":"https://pith.science/pith/J3Z25MED5CPY7FA23ZJ2COZ5TM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J3Z25MED5CPY7FA23ZJ2COZ5TM/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-08-22T11:24:36Z","links":{"resolver":"https://pith.science/pith/J3Z25MED5CPY7FA23ZJ2COZ5TM","bundle":"https://pith.science/pith/J3Z25MED5CPY7FA23ZJ2COZ5TM/bundle.json","state":"https://pith.science/pith/J3Z25MED5CPY7FA23ZJ2COZ5TM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J3Z25MED5CPY7FA23ZJ2COZ5TM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:J3Z25MED5CPY7FA23ZJ2COZ5TM","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":"957f6abeafdf2913ad23b119822b922866d80cdd7be436a76c6a17fe068b4f9d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2020-01-16T13:20:43Z","title_canon_sha256":"4b51c6c9f3c939df86111f6893568659371c20dffd16e713764854f7ae6dd499"},"schema_version":"1.0","source":{"id":"2001.05786","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.05786","created_at":"2026-07-05T05:38:06Z"},{"alias_kind":"arxiv_version","alias_value":"2001.05786v2","created_at":"2026-07-05T05:38:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.05786","created_at":"2026-07-05T05:38:06Z"},{"alias_kind":"pith_short_12","alias_value":"J3Z25MED5CPY","created_at":"2026-07-05T05:38:06Z"},{"alias_kind":"pith_short_16","alias_value":"J3Z25MED5CPY7FA2","created_at":"2026-07-05T05:38:06Z"},{"alias_kind":"pith_short_8","alias_value":"J3Z25MED","created_at":"2026-07-05T05:38:06Z"}],"graph_snapshots":[{"event_id":"sha256:d3bdbdfb339876dac4079d9434906bba1463590bfb5ab0737c94d01e51e07f29","target":"graph","created_at":"2026-07-05T05:38:06Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2001.05786/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Automata learning is a popular technique used to automatically construct an automaton model from queries. Much research went into devising ad hoc adaptations of algorithms for different types of automata. The CALF project seeks to unify these using category theory in order to ease correctness proofs and guide the design of new algorithms. In this paper, we extend CALF to cover learning of algebraic structures that may not have a coalgebraic presentation. Furthermore, we provide a detailed algorithmic account of an abstract version of the popular L* algorithm, which was missing from CALF. We in","authors_text":"Alexandra Silva, Gerco van Heerdt, Jurriaan Rot, Matteo Sammartino, Tobias Kapp\\'e","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2020-01-16T13:20:43Z","title":"A Categorical Framework for Learning Generalised Tree Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.05786","kind":"arxiv","version":2},"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:bc6a189749333be998c1c506e754747a709cb90c7fa55219077c8b2979680e89","target":"record","created_at":"2026-07-05T05:38:06Z","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":"957f6abeafdf2913ad23b119822b922866d80cdd7be436a76c6a17fe068b4f9d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2020-01-16T13:20:43Z","title_canon_sha256":"4b51c6c9f3c939df86111f6893568659371c20dffd16e713764854f7ae6dd499"},"schema_version":"1.0","source":{"id":"2001.05786","kind":"arxiv","version":2}},"canonical_sha256":"4ef3aeb083e89f8f941ade53a13b3d9b0c0217984fb29af6f548df519d084556","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ef3aeb083e89f8f941ade53a13b3d9b0c0217984fb29af6f548df519d084556","first_computed_at":"2026-07-05T05:38:06.515066Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:38:06.515066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G16RY8ya1ca6zZKOerEzBTXls0QZ6XPYKqHDNcamDwmAeIapoyTlft6ZkbnSWazyeMKDmOQ5mTwMs5EtZDT3BA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:38:06.515487Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.05786","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc6a189749333be998c1c506e754747a709cb90c7fa55219077c8b2979680e89","sha256:d3bdbdfb339876dac4079d9434906bba1463590bfb5ab0737c94d01e51e07f29"],"state_sha256":"ff21002545b3813dc9489e81275baacddfc3533b92ebe7596ea72c2b6ac88812"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M/DTEuQIuv8wEFyyCzxwSoZhZBZMoI8jTazn6aqJ2PjJWX43SZ5QBFtjp9ALJk5rqKcu706CMfB+NbCWNHD2Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T11:24:37.000021Z","bundle_sha256":"10e31b1dc1f83ff75bbedef0522df606b1ccd87653a57466a30a862c2478133a"}}