{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DXNNYFPTGGXIYY3EC5CKEKQRBP","short_pith_number":"pith:DXNNYFPT","schema_version":"1.0","canonical_sha256":"1ddadc15f331ae8c63641744a22a110bf5fe3011ed6c3458e7f32f2e3a4f9a4b","source":{"kind":"arxiv","id":"1504.06667","version":2},"attestation_state":"computed","paper":{"title":"Handling oversampling in dynamic networks using link prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Benjamin Fish, Rajmonda S. Caceres","submitted_at":"2015-04-24T23:38:30Z","abstract_excerpt":"Oversampling is a common characteristic of data representing dynamic networks. It introduces noise into representations of dynamic networks, but there has been little work so far to compensate for it. Oversampling can affect the quality of many important algorithmic problems on dynamic networks, including link prediction. Link prediction seeks to predict edges that will be added to the network given previous snapshots. We show that not only does oversampling affect the quality of link prediction, but that we can use link prediction to recover from the effects of oversampling. We also introduce"},"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":"1504.06667","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-04-24T23:38:30Z","cross_cats_sorted":["cs.LG","physics.soc-ph"],"title_canon_sha256":"e8a33f3f52e0a344eb7618004770f0d51d84a53eac334f7ea35785dede64b792","abstract_canon_sha256":"8cb0cb9b78ac91c5251085b87c35ff26f0503c14c6c26d1cf0835a6d9bb2ef65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:30.303132Z","signature_b64":"EWz6MgiowPO5K4Gl8oVu82qUlW1SKikI4saT+a2mtHCjzI4e+72EUlEJudn8RYuhHJiptzPe1lAct3gslNAdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ddadc15f331ae8c63641744a22a110bf5fe3011ed6c3458e7f32f2e3a4f9a4b","last_reissued_at":"2026-05-18T01:35:30.302684Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:30.302684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Handling oversampling in dynamic networks using link prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Benjamin Fish, Rajmonda S. Caceres","submitted_at":"2015-04-24T23:38:30Z","abstract_excerpt":"Oversampling is a common characteristic of data representing dynamic networks. It introduces noise into representations of dynamic networks, but there has been little work so far to compensate for it. Oversampling can affect the quality of many important algorithmic problems on dynamic networks, including link prediction. Link prediction seeks to predict edges that will be added to the network given previous snapshots. We show that not only does oversampling affect the quality of link prediction, but that we can use link prediction to recover from the effects of oversampling. We also introduce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06667","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":""},"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":"1504.06667","created_at":"2026-05-18T01:35:30.302764+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.06667v2","created_at":"2026-05-18T01:35:30.302764+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06667","created_at":"2026-05-18T01:35:30.302764+00:00"},{"alias_kind":"pith_short_12","alias_value":"DXNNYFPTGGXI","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DXNNYFPTGGXIYY3E","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DXNNYFPT","created_at":"2026-05-18T12:29:17.054201+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/DXNNYFPTGGXIYY3EC5CKEKQRBP","json":"https://pith.science/pith/DXNNYFPTGGXIYY3EC5CKEKQRBP.json","graph_json":"https://pith.science/api/pith-number/DXNNYFPTGGXIYY3EC5CKEKQRBP/graph.json","events_json":"https://pith.science/api/pith-number/DXNNYFPTGGXIYY3EC5CKEKQRBP/events.json","paper":"https://pith.science/paper/DXNNYFPT"},"agent_actions":{"view_html":"https://pith.science/pith/DXNNYFPTGGXIYY3EC5CKEKQRBP","download_json":"https://pith.science/pith/DXNNYFPTGGXIYY3EC5CKEKQRBP.json","view_paper":"https://pith.science/paper/DXNNYFPT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.06667&json=true","fetch_graph":"https://pith.science/api/pith-number/DXNNYFPTGGXIYY3EC5CKEKQRBP/graph.json","fetch_events":"https://pith.science/api/pith-number/DXNNYFPTGGXIYY3EC5CKEKQRBP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DXNNYFPTGGXIYY3EC5CKEKQRBP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DXNNYFPTGGXIYY3EC5CKEKQRBP/action/storage_attestation","attest_author":"https://pith.science/pith/DXNNYFPTGGXIYY3EC5CKEKQRBP/action/author_attestation","sign_citation":"https://pith.science/pith/DXNNYFPTGGXIYY3EC5CKEKQRBP/action/citation_signature","submit_replication":"https://pith.science/pith/DXNNYFPTGGXIYY3EC5CKEKQRBP/action/replication_record"}},"created_at":"2026-05-18T01:35:30.302764+00:00","updated_at":"2026-05-18T01:35:30.302764+00:00"}