{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:2PN5NJRNGGGH6HO5KZ7K56BDCX","short_pith_number":"pith:2PN5NJRN","canonical_record":{"source":{"id":"2212.04596","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2022-12-08T23:00:08Z","cross_cats_sorted":[],"title_canon_sha256":"de1ed8fb08e7a01ba531ea84137e7761516640ffcfe9e2118acb3df87877ee7e","abstract_canon_sha256":"869e12d1d107d1f79580abf57f6d64c04812856d46d7cfe063a9796c5e6281d9"},"schema_version":"1.0"},"canonical_sha256":"d3dbd6a62d318c7f1ddd567eaef82315ec250891070038b9256d0ffb73848708","source":{"kind":"arxiv","id":"2212.04596","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.04596","created_at":"2026-07-05T05:23:49Z"},{"alias_kind":"arxiv_version","alias_value":"2212.04596v1","created_at":"2026-07-05T05:23:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.04596","created_at":"2026-07-05T05:23:49Z"},{"alias_kind":"pith_short_12","alias_value":"2PN5NJRNGGGH","created_at":"2026-07-05T05:23:49Z"},{"alias_kind":"pith_short_16","alias_value":"2PN5NJRNGGGH6HO5","created_at":"2026-07-05T05:23:49Z"},{"alias_kind":"pith_short_8","alias_value":"2PN5NJRN","created_at":"2026-07-05T05:23:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:2PN5NJRNGGGH6HO5KZ7K56BDCX","target":"record","payload":{"canonical_record":{"source":{"id":"2212.04596","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2022-12-08T23:00:08Z","cross_cats_sorted":[],"title_canon_sha256":"de1ed8fb08e7a01ba531ea84137e7761516640ffcfe9e2118acb3df87877ee7e","abstract_canon_sha256":"869e12d1d107d1f79580abf57f6d64c04812856d46d7cfe063a9796c5e6281d9"},"schema_version":"1.0"},"canonical_sha256":"d3dbd6a62d318c7f1ddd567eaef82315ec250891070038b9256d0ffb73848708","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:23:49.503451Z","signature_b64":"JTBcPc5SUAlxU5fHi4CkPboShQFEJK4RlB4LecsVI9Q6fssFjvtJhCgHP3CuhOTEU/yB5Usx6PoBRe6AZoOTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3dbd6a62d318c7f1ddd567eaef82315ec250891070038b9256d0ffb73848708","last_reissued_at":"2026-07-05T05:23:49.503032Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:23:49.503032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.04596","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-07-05T05:23:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DZmHsVqFo2u2kb79vU/nhIuF3LOTwpqGQFO7I412CXoduLiv6igsGyIGgOzqF8j+Ql++Ml51CS8B/NKJxn+NAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:51:11.256854Z"},"content_sha256":"452a4a6aac93ed004df992146c3d08aacad5dab6919223a72c372b7162449173","schema_version":"1.0","event_id":"sha256:452a4a6aac93ed004df992146c3d08aacad5dab6919223a72c372b7162449173"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:2PN5NJRNGGGH6HO5KZ7K56BDCX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"babble: Learning Better Abstractions with E-Graphs and Anti-Unification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Chandrakana Nandi, David Cao, Max Willsey, Nadia Polikarpova, Rose Kunkel, Zachary Tatlock","submitted_at":"2022-12-08T23:00:08Z","abstract_excerpt":"Library learning compresses a given corpus of programs by extracting common structure from the corpus into reusable library functions. Prior work on library learning suffers from two limitations that prevent it from scaling to larger, more complex inputs. First, it explores too many candidate library functions that are not useful for compression. Second, it is not robust to syntactic variation in the input.\n  We propose library learning modulo theory (LLMT), a new library learning algorithm that additionally takes as input an equational theory for a given problem domain. LLMT uses e-graphs and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.04596","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2212.04596/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:23:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rAkA2t9dSNjIALvVuPUaOXtdtweqjttjab8y8lcI8NOTgtG0VJ2d5dNj12gKfvl78+UK0uETR5dvWO5IhoacBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:51:11.257748Z"},"content_sha256":"84d09338df8738b2610a69d9173ce9ad15d01d70578db59631a10bccfd075ac5","schema_version":"1.0","event_id":"sha256:84d09338df8738b2610a69d9173ce9ad15d01d70578db59631a10bccfd075ac5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2PN5NJRNGGGH6HO5KZ7K56BDCX/bundle.json","state_url":"https://pith.science/pith/2PN5NJRNGGGH6HO5KZ7K56BDCX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2PN5NJRNGGGH6HO5KZ7K56BDCX/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-03T16:51:11Z","links":{"resolver":"https://pith.science/pith/2PN5NJRNGGGH6HO5KZ7K56BDCX","bundle":"https://pith.science/pith/2PN5NJRNGGGH6HO5KZ7K56BDCX/bundle.json","state":"https://pith.science/pith/2PN5NJRNGGGH6HO5KZ7K56BDCX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2PN5NJRNGGGH6HO5KZ7K56BDCX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:2PN5NJRNGGGH6HO5KZ7K56BDCX","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":"869e12d1d107d1f79580abf57f6d64c04812856d46d7cfe063a9796c5e6281d9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2022-12-08T23:00:08Z","title_canon_sha256":"de1ed8fb08e7a01ba531ea84137e7761516640ffcfe9e2118acb3df87877ee7e"},"schema_version":"1.0","source":{"id":"2212.04596","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.04596","created_at":"2026-07-05T05:23:49Z"},{"alias_kind":"arxiv_version","alias_value":"2212.04596v1","created_at":"2026-07-05T05:23:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.04596","created_at":"2026-07-05T05:23:49Z"},{"alias_kind":"pith_short_12","alias_value":"2PN5NJRNGGGH","created_at":"2026-07-05T05:23:49Z"},{"alias_kind":"pith_short_16","alias_value":"2PN5NJRNGGGH6HO5","created_at":"2026-07-05T05:23:49Z"},{"alias_kind":"pith_short_8","alias_value":"2PN5NJRN","created_at":"2026-07-05T05:23:49Z"}],"graph_snapshots":[{"event_id":"sha256:84d09338df8738b2610a69d9173ce9ad15d01d70578db59631a10bccfd075ac5","target":"graph","created_at":"2026-07-05T05:23:49Z","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/2212.04596/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Library learning compresses a given corpus of programs by extracting common structure from the corpus into reusable library functions. Prior work on library learning suffers from two limitations that prevent it from scaling to larger, more complex inputs. First, it explores too many candidate library functions that are not useful for compression. Second, it is not robust to syntactic variation in the input.\n  We propose library learning modulo theory (LLMT), a new library learning algorithm that additionally takes as input an equational theory for a given problem domain. LLMT uses e-graphs and","authors_text":"Chandrakana Nandi, David Cao, Max Willsey, Nadia Polikarpova, Rose Kunkel, Zachary Tatlock","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2022-12-08T23:00:08Z","title":"babble: Learning Better Abstractions with E-Graphs and Anti-Unification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.04596","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:452a4a6aac93ed004df992146c3d08aacad5dab6919223a72c372b7162449173","target":"record","created_at":"2026-07-05T05:23:49Z","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":"869e12d1d107d1f79580abf57f6d64c04812856d46d7cfe063a9796c5e6281d9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2022-12-08T23:00:08Z","title_canon_sha256":"de1ed8fb08e7a01ba531ea84137e7761516640ffcfe9e2118acb3df87877ee7e"},"schema_version":"1.0","source":{"id":"2212.04596","kind":"arxiv","version":1}},"canonical_sha256":"d3dbd6a62d318c7f1ddd567eaef82315ec250891070038b9256d0ffb73848708","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3dbd6a62d318c7f1ddd567eaef82315ec250891070038b9256d0ffb73848708","first_computed_at":"2026-07-05T05:23:49.503032Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:23:49.503032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JTBcPc5SUAlxU5fHi4CkPboShQFEJK4RlB4LecsVI9Q6fssFjvtJhCgHP3CuhOTEU/yB5Usx6PoBRe6AZoOTAA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:23:49.503451Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.04596","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:452a4a6aac93ed004df992146c3d08aacad5dab6919223a72c372b7162449173","sha256:84d09338df8738b2610a69d9173ce9ad15d01d70578db59631a10bccfd075ac5"],"state_sha256":"707159352a295a77ea8bf582842db9ca2c3bb01a45a04a8180d35969162a83e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KmApU9FWgxXNhpJ/I/lTdo9P2De5Vi8Wp4VO9ZKJ8TnvnTLCwvR0eK5W3Kz2xzgTEvgkbo0h1l8xTGhRNf+IDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T16:51:11.263135Z","bundle_sha256":"a271a38a36792f53f498b7be3025d28903bca05f87880ba01565aefc2dd78d3d"}}