{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:H26XABK3QMRFBANKLUYZYRQ22Z","short_pith_number":"pith:H26XABK3","schema_version":"1.0","canonical_sha256":"3ebd70055b83225081aa5d319c461ad6593616b3c519ca4cd4ac741d8a491f9a","source":{"kind":"arxiv","id":"2606.26132","version":1},"attestation_state":"computed","paper":{"title":"Code evolution for link prediction in complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Alexey Vlaskin, Eduardo G. Altmann","submitted_at":"2026-06-18T05:46:19Z","abstract_excerpt":"The problem of predicting links in complex networks appears in different disciplines and has led to a variety of ingenious human-designed methods. We use this rich program space to explore the performance and behavior of automated code-evolution systems tasked to obtain machine-designed methods for link prediction. Despite being trained on limited data, algorithms evolved through code evolution outperform human-designed methods (with an average AUC score of 0.915 vs. 0.783, computed over 580 networks) and show improved computational efficiency, allowing them to be applied to networks with mill"},"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":"2606.26132","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2026-06-18T05:46:19Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5a9eabc64bf5887686c2b488eb752519b03f0e231a97cf0b6f121dd39ff3d087","abstract_canon_sha256":"826c39ea1746540ed1f96717dbebe8c91a85b137691a64d52f48856a5851cf57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T00:15:27.000849Z","signature_b64":"1/9xg1pXFzD30uESi1DQkUwWubvpLE5xCxDLAD5XJTx2qsKL7UvzziVJleH9QmnwRkZQROZ4WvMAVE0t3ePFCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ebd70055b83225081aa5d319c461ad6593616b3c519ca4cd4ac741d8a491f9a","last_reissued_at":"2026-06-26T00:15:27.000488Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T00:15:27.000488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Code evolution for link prediction in complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Alexey Vlaskin, Eduardo G. Altmann","submitted_at":"2026-06-18T05:46:19Z","abstract_excerpt":"The problem of predicting links in complex networks appears in different disciplines and has led to a variety of ingenious human-designed methods. We use this rich program space to explore the performance and behavior of automated code-evolution systems tasked to obtain machine-designed methods for link prediction. Despite being trained on limited data, algorithms evolved through code evolution outperform human-designed methods (with an average AUC score of 0.915 vs. 0.783, computed over 580 networks) and show improved computational efficiency, allowing them to be applied to networks with mill"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.26132","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/2606.26132/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.26132","created_at":"2026-06-26T00:15:27.000547+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.26132v1","created_at":"2026-06-26T00:15:27.000547+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.26132","created_at":"2026-06-26T00:15:27.000547+00:00"},{"alias_kind":"pith_short_12","alias_value":"H26XABK3QMRF","created_at":"2026-06-26T00:15:27.000547+00:00"},{"alias_kind":"pith_short_16","alias_value":"H26XABK3QMRFBANK","created_at":"2026-06-26T00:15:27.000547+00:00"},{"alias_kind":"pith_short_8","alias_value":"H26XABK3","created_at":"2026-06-26T00:15:27.000547+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/H26XABK3QMRFBANKLUYZYRQ22Z","json":"https://pith.science/pith/H26XABK3QMRFBANKLUYZYRQ22Z.json","graph_json":"https://pith.science/api/pith-number/H26XABK3QMRFBANKLUYZYRQ22Z/graph.json","events_json":"https://pith.science/api/pith-number/H26XABK3QMRFBANKLUYZYRQ22Z/events.json","paper":"https://pith.science/paper/H26XABK3"},"agent_actions":{"view_html":"https://pith.science/pith/H26XABK3QMRFBANKLUYZYRQ22Z","download_json":"https://pith.science/pith/H26XABK3QMRFBANKLUYZYRQ22Z.json","view_paper":"https://pith.science/paper/H26XABK3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.26132&json=true","fetch_graph":"https://pith.science/api/pith-number/H26XABK3QMRFBANKLUYZYRQ22Z/graph.json","fetch_events":"https://pith.science/api/pith-number/H26XABK3QMRFBANKLUYZYRQ22Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H26XABK3QMRFBANKLUYZYRQ22Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H26XABK3QMRFBANKLUYZYRQ22Z/action/storage_attestation","attest_author":"https://pith.science/pith/H26XABK3QMRFBANKLUYZYRQ22Z/action/author_attestation","sign_citation":"https://pith.science/pith/H26XABK3QMRFBANKLUYZYRQ22Z/action/citation_signature","submit_replication":"https://pith.science/pith/H26XABK3QMRFBANKLUYZYRQ22Z/action/replication_record"}},"created_at":"2026-06-26T00:15:27.000547+00:00","updated_at":"2026-06-26T00:15:27.000547+00:00"}