{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7FHTXZOL4AFHKIBVEFS5VSO2QE","short_pith_number":"pith:7FHTXZOL","schema_version":"1.0","canonical_sha256":"f94f3be5cbe00a7520352165dac9da8129b0d662751c885e5351b45e113abd97","source":{"kind":"arxiv","id":"1807.10268","version":1},"attestation_state":"computed","paper":{"title":"Premise selection with neural networks and distributed representation of features","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.LO"],"primary_cat":"cs.AI","authors_text":"Andrzej Stanis{\\l}aw Kucik, Konstantin Korovin","submitted_at":"2018-07-26T17:54:58Z","abstract_excerpt":"We present the problem of selecting relevant premises for a proof of a given statement. When stated as a binary classification task for pairs (conjecture, axiom), it can be efficiently solved using artificial neural networks. The key difference between our advance to solve this problem and previous approaches is the use of just functional signatures of premises. To further improve the performance of the model, we use dimensionality reduction technique, to replace long and sparse signature vectors with their compact and dense embedded versions. These are obtained by firstly defining the concept"},"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":"1807.10268","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-07-26T17:54:58Z","cross_cats_sorted":["cs.LG","cs.LO"],"title_canon_sha256":"4362e76fd66db0c06fdfb8ef8ed405dbd0d5f9ef63e21f9cf1d57bb51438a471","abstract_canon_sha256":"94f5ecffca7a4fe522c2cb57e92dde9955de52b7676f5c6e6721809cc24cfa04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:42.711465Z","signature_b64":"lPvGb+6Qb+x/rhLBYf8fzmVLq3tqlelT1esO/s2U3qiIH6lc5ktq9ImNhbzOrDnE/XQoGfLrtHRQmVREVpl5CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f94f3be5cbe00a7520352165dac9da8129b0d662751c885e5351b45e113abd97","last_reissued_at":"2026-05-18T00:09:42.710820Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:42.710820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Premise selection with neural networks and distributed representation of features","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.LO"],"primary_cat":"cs.AI","authors_text":"Andrzej Stanis{\\l}aw Kucik, Konstantin Korovin","submitted_at":"2018-07-26T17:54:58Z","abstract_excerpt":"We present the problem of selecting relevant premises for a proof of a given statement. When stated as a binary classification task for pairs (conjecture, axiom), it can be efficiently solved using artificial neural networks. The key difference between our advance to solve this problem and previous approaches is the use of just functional signatures of premises. To further improve the performance of the model, we use dimensionality reduction technique, to replace long and sparse signature vectors with their compact and dense embedded versions. These are obtained by firstly defining the concept"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10268","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":""},"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":"1807.10268","created_at":"2026-05-18T00:09:42.710914+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.10268v1","created_at":"2026-05-18T00:09:42.710914+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10268","created_at":"2026-05-18T00:09:42.710914+00:00"},{"alias_kind":"pith_short_12","alias_value":"7FHTXZOL4AFH","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7FHTXZOL4AFHKIBV","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7FHTXZOL","created_at":"2026-05-18T12:32:11.075285+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.19188","citing_title":"Hierarchical Attention Generates Better Proofs","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7FHTXZOL4AFHKIBVEFS5VSO2QE","json":"https://pith.science/pith/7FHTXZOL4AFHKIBVEFS5VSO2QE.json","graph_json":"https://pith.science/api/pith-number/7FHTXZOL4AFHKIBVEFS5VSO2QE/graph.json","events_json":"https://pith.science/api/pith-number/7FHTXZOL4AFHKIBVEFS5VSO2QE/events.json","paper":"https://pith.science/paper/7FHTXZOL"},"agent_actions":{"view_html":"https://pith.science/pith/7FHTXZOL4AFHKIBVEFS5VSO2QE","download_json":"https://pith.science/pith/7FHTXZOL4AFHKIBVEFS5VSO2QE.json","view_paper":"https://pith.science/paper/7FHTXZOL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.10268&json=true","fetch_graph":"https://pith.science/api/pith-number/7FHTXZOL4AFHKIBVEFS5VSO2QE/graph.json","fetch_events":"https://pith.science/api/pith-number/7FHTXZOL4AFHKIBVEFS5VSO2QE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7FHTXZOL4AFHKIBVEFS5VSO2QE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7FHTXZOL4AFHKIBVEFS5VSO2QE/action/storage_attestation","attest_author":"https://pith.science/pith/7FHTXZOL4AFHKIBVEFS5VSO2QE/action/author_attestation","sign_citation":"https://pith.science/pith/7FHTXZOL4AFHKIBVEFS5VSO2QE/action/citation_signature","submit_replication":"https://pith.science/pith/7FHTXZOL4AFHKIBVEFS5VSO2QE/action/replication_record"}},"created_at":"2026-05-18T00:09:42.710914+00:00","updated_at":"2026-05-18T00:09:42.710914+00:00"}