{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UONOSCYHHDVHWV5OJUZN66ALX6","short_pith_number":"pith:UONOSCYH","schema_version":"1.0","canonical_sha256":"a39ae90b0738ea7b57ae4d32df780bbfad65b4df5eb6bf5f5cd02e8373cfb53d","source":{"kind":"arxiv","id":"2506.12764","version":2},"attestation_state":"computed","paper":{"title":"Base3: a simple interpolation-based ensemble method for robust dynamic link prediction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Kondrup Emma","submitted_at":"2025-06-15T08:07:36Z","abstract_excerpt":"Dynamic link prediction remains a central challenge in temporal graph learning, particularly in designing models that are both effective and practical for real-world deployment. Existing approaches often rely on complex neural architectures, which are computationally intensive and difficult to interpret.\n  In this work, we build on the strong recurrence-based foundation of the EdgeBank baseline, by supplementing it with inductive capabilities. We do so by leveraging the predictive power of non-learnable signals from two complementary perspectives: historical edge recurrence, as captured by Edg"},"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":"2506.12764","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-15T08:07:36Z","cross_cats_sorted":[],"title_canon_sha256":"3be3de30e42a8fa2ced27e92b5f177d6b86e32987c3dbb093f254150b4ac27e4","abstract_canon_sha256":"001b8e7e9ba086a1253b38ad863a47c7ee4d98af0346190b4b0c054a93baf626"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:39:12.319735Z","signature_b64":"TSxvManDH85K0KnF1DlUJMI7G6walMPFjIGyNaussXjElsFWcSOypDRnCHaR4zHCY9ajO/Rct1enhJBlcuK4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a39ae90b0738ea7b57ae4d32df780bbfad65b4df5eb6bf5f5cd02e8373cfb53d","last_reissued_at":"2026-07-05T11:39:12.319175Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:39:12.319175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Base3: a simple interpolation-based ensemble method for robust dynamic link prediction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Kondrup Emma","submitted_at":"2025-06-15T08:07:36Z","abstract_excerpt":"Dynamic link prediction remains a central challenge in temporal graph learning, particularly in designing models that are both effective and practical for real-world deployment. Existing approaches often rely on complex neural architectures, which are computationally intensive and difficult to interpret.\n  In this work, we build on the strong recurrence-based foundation of the EdgeBank baseline, by supplementing it with inductive capabilities. We do so by leveraging the predictive power of non-learnable signals from two complementary perspectives: historical edge recurrence, as captured by Edg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.12764","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/2506.12764/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":"2506.12764","created_at":"2026-07-05T11:39:12.319252+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.12764v2","created_at":"2026-07-05T11:39:12.319252+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.12764","created_at":"2026-07-05T11:39:12.319252+00:00"},{"alias_kind":"pith_short_12","alias_value":"UONOSCYHHDVH","created_at":"2026-07-05T11:39:12.319252+00:00"},{"alias_kind":"pith_short_16","alias_value":"UONOSCYHHDVHWV5O","created_at":"2026-07-05T11:39:12.319252+00:00"},{"alias_kind":"pith_short_8","alias_value":"UONOSCYH","created_at":"2026-07-05T11:39:12.319252+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/UONOSCYHHDVHWV5OJUZN66ALX6","json":"https://pith.science/pith/UONOSCYHHDVHWV5OJUZN66ALX6.json","graph_json":"https://pith.science/api/pith-number/UONOSCYHHDVHWV5OJUZN66ALX6/graph.json","events_json":"https://pith.science/api/pith-number/UONOSCYHHDVHWV5OJUZN66ALX6/events.json","paper":"https://pith.science/paper/UONOSCYH"},"agent_actions":{"view_html":"https://pith.science/pith/UONOSCYHHDVHWV5OJUZN66ALX6","download_json":"https://pith.science/pith/UONOSCYHHDVHWV5OJUZN66ALX6.json","view_paper":"https://pith.science/paper/UONOSCYH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.12764&json=true","fetch_graph":"https://pith.science/api/pith-number/UONOSCYHHDVHWV5OJUZN66ALX6/graph.json","fetch_events":"https://pith.science/api/pith-number/UONOSCYHHDVHWV5OJUZN66ALX6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UONOSCYHHDVHWV5OJUZN66ALX6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UONOSCYHHDVHWV5OJUZN66ALX6/action/storage_attestation","attest_author":"https://pith.science/pith/UONOSCYHHDVHWV5OJUZN66ALX6/action/author_attestation","sign_citation":"https://pith.science/pith/UONOSCYHHDVHWV5OJUZN66ALX6/action/citation_signature","submit_replication":"https://pith.science/pith/UONOSCYHHDVHWV5OJUZN66ALX6/action/replication_record"}},"created_at":"2026-07-05T11:39:12.319252+00:00","updated_at":"2026-07-05T11:39:12.319252+00:00"}