{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2T6CWVM55MKHGXX2HG24WAOEM2","short_pith_number":"pith:2T6CWVM5","canonical_record":{"source":{"id":"1406.1584","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-06-06T05:28:48Z","cross_cats_sorted":[],"title_canon_sha256":"82313a0747f0aec605e93492f804bdf724d7c992cf1cc57546f3a32b601724a1","abstract_canon_sha256":"4aea8979682a963d36e5356c8458387f8d7c1406f89da45f725136f6cde3781e"},"schema_version":"1.0"},"canonical_sha256":"d4fc2b559deb14735efa39b5cb01c466bc5f8fd789f72e89b6650e2d91b37b99","source":{"kind":"arxiv","id":"1406.1584","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1584","created_at":"2026-05-18T02:38:29Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1584v3","created_at":"2026-05-18T02:38:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1584","created_at":"2026-05-18T02:38:29Z"},{"alias_kind":"pith_short_12","alias_value":"2T6CWVM55MKH","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2T6CWVM55MKHGXX2","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2T6CWVM5","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2T6CWVM55MKHGXX2HG24WAOEM2","target":"record","payload":{"canonical_record":{"source":{"id":"1406.1584","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-06-06T05:28:48Z","cross_cats_sorted":[],"title_canon_sha256":"82313a0747f0aec605e93492f804bdf724d7c992cf1cc57546f3a32b601724a1","abstract_canon_sha256":"4aea8979682a963d36e5356c8458387f8d7c1406f89da45f725136f6cde3781e"},"schema_version":"1.0"},"canonical_sha256":"d4fc2b559deb14735efa39b5cb01c466bc5f8fd789f72e89b6650e2d91b37b99","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:29.510447Z","signature_b64":"v75AOHan4L/drg0qClEHzauNau+NEWciGeWLYvPldseI7wr4byoVgTRShrI14oBN9/+ulqsoatr111m/9ZIFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4fc2b559deb14735efa39b5cb01c466bc5f8fd789f72e89b6650e2d91b37b99","last_reissued_at":"2026-05-18T02:38:29.509724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:29.509724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.1584","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-18T02:38:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Su9dMGnimwn/nErqNGj8//EbGZB9RBNRg5PkWPuYOZU0BiSRfUmSTa7mAtgFp3R8A8eFjfu7C3rv6efjpzSoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:08:33.422147Z"},"content_sha256":"8d560475f1b4de739692e88328ea327c5c1a5db7d34a14078acf096aa6173be8","schema_version":"1.0","event_id":"sha256:8d560475f1b4de739692e88328ea327c5c1a5db7d34a14078acf096aa6173be8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2T6CWVM55MKHGXX2HG24WAOEM2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning to Discover Efficient Mathematical Identities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Karol Kurach, Rob Fergus, Wojciech Zaremba","submitted_at":"2014-06-06T05:28:48Z","abstract_excerpt":"In this paper we explore how machine learning techniques can be applied to the discovery of efficient mathematical identities. We introduce an attribute grammar framework for representing symbolic expressions. Given a set of grammar rules we build trees that combine different rules, looking for branches which yield compositions that are analytically equivalent to a target expression, but of lower computational complexity. However, as the size of the trees grows exponentially with the complexity of the target expression, brute force search is impractical for all but the simplest of expressions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1584","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-18T02:38:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rdEti8yO7bZ9staSa08I85hLLTVe5hg/GYNfo7upN+AT45RovWVNxwSO9MzBNelCg1NbOzGibtLA4iYE0b2ZCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:08:33.422495Z"},"content_sha256":"b4952eb6f585b6de031f090b3aafe69e4b36f6b95dffb50e7a6f0fba381340d9","schema_version":"1.0","event_id":"sha256:b4952eb6f585b6de031f090b3aafe69e4b36f6b95dffb50e7a6f0fba381340d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2T6CWVM55MKHGXX2HG24WAOEM2/bundle.json","state_url":"https://pith.science/pith/2T6CWVM55MKHGXX2HG24WAOEM2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2T6CWVM55MKHGXX2HG24WAOEM2/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-06-03T22:08:33Z","links":{"resolver":"https://pith.science/pith/2T6CWVM55MKHGXX2HG24WAOEM2","bundle":"https://pith.science/pith/2T6CWVM55MKHGXX2HG24WAOEM2/bundle.json","state":"https://pith.science/pith/2T6CWVM55MKHGXX2HG24WAOEM2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2T6CWVM55MKHGXX2HG24WAOEM2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2T6CWVM55MKHGXX2HG24WAOEM2","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":"4aea8979682a963d36e5356c8458387f8d7c1406f89da45f725136f6cde3781e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-06-06T05:28:48Z","title_canon_sha256":"82313a0747f0aec605e93492f804bdf724d7c992cf1cc57546f3a32b601724a1"},"schema_version":"1.0","source":{"id":"1406.1584","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1584","created_at":"2026-05-18T02:38:29Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1584v3","created_at":"2026-05-18T02:38:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1584","created_at":"2026-05-18T02:38:29Z"},{"alias_kind":"pith_short_12","alias_value":"2T6CWVM55MKH","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2T6CWVM55MKHGXX2","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2T6CWVM5","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:b4952eb6f585b6de031f090b3aafe69e4b36f6b95dffb50e7a6f0fba381340d9","target":"graph","created_at":"2026-05-18T02:38:29Z","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":"In this paper we explore how machine learning techniques can be applied to the discovery of efficient mathematical identities. We introduce an attribute grammar framework for representing symbolic expressions. Given a set of grammar rules we build trees that combine different rules, looking for branches which yield compositions that are analytically equivalent to a target expression, but of lower computational complexity. However, as the size of the trees grows exponentially with the complexity of the target expression, brute force search is impractical for all but the simplest of expressions.","authors_text":"Karol Kurach, Rob Fergus, Wojciech Zaremba","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-06-06T05:28:48Z","title":"Learning to Discover Efficient Mathematical Identities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1584","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:8d560475f1b4de739692e88328ea327c5c1a5db7d34a14078acf096aa6173be8","target":"record","created_at":"2026-05-18T02:38:29Z","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":"4aea8979682a963d36e5356c8458387f8d7c1406f89da45f725136f6cde3781e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-06-06T05:28:48Z","title_canon_sha256":"82313a0747f0aec605e93492f804bdf724d7c992cf1cc57546f3a32b601724a1"},"schema_version":"1.0","source":{"id":"1406.1584","kind":"arxiv","version":3}},"canonical_sha256":"d4fc2b559deb14735efa39b5cb01c466bc5f8fd789f72e89b6650e2d91b37b99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4fc2b559deb14735efa39b5cb01c466bc5f8fd789f72e89b6650e2d91b37b99","first_computed_at":"2026-05-18T02:38:29.509724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:29.509724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v75AOHan4L/drg0qClEHzauNau+NEWciGeWLYvPldseI7wr4byoVgTRShrI14oBN9/+ulqsoatr111m/9ZIFAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:29.510447Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.1584","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d560475f1b4de739692e88328ea327c5c1a5db7d34a14078acf096aa6173be8","sha256:b4952eb6f585b6de031f090b3aafe69e4b36f6b95dffb50e7a6f0fba381340d9"],"state_sha256":"78d15bbfd9a695613c2dc535d53b0717afdc45c02ee05e5f3206a90e524039bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r0L9Yf5zRxNXcaWGEmCPOOhV3U07yXLV65rLTwPEgFEVoSwTxgiE4DHb8VH8s3EKvJ62XON48fnito2eDkZqDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:08:33.424430Z","bundle_sha256":"7c39aa9bd4e4d23fb1ed021c0d2f20c8d9ecd99ef11e967b5770e71a6ec386a1"}}