{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5AHETLHCUCEVJV42CHJD3RSFYN","short_pith_number":"pith:5AHETLHC","schema_version":"1.0","canonical_sha256":"e80e49ace2a08954d79a11d23dc645c357956ed78a569294bb78f576c431cb34","source":{"kind":"arxiv","id":"1705.07967","version":2},"attestation_state":"computed","paper":{"title":"Consistencies and inconsistencies between model selection and link prediction in networks","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech"],"primary_cat":"stat.ML","authors_text":"Marta Sales-Pardo, Roger Guimer\\`a, Tiago P. Peixoto, Toni Vall\\`es-Catal\\`a","submitted_at":"2017-05-22T22:43:23Z","abstract_excerpt":"A principled approach to understand network structures is to formulate generative models. Given a collection of models, however, an outstanding key task is to determine which one provides a more accurate description of the network at hand, discounting statistical fluctuations. This problem can be approached using two principled criteria that at first may seem equivalent: selecting the most plausible model in terms of its posterior probability; or selecting the model with the highest predictive performance in terms of identifying missing links. Here we show that while these two approaches yield"},"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":"1705.07967","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2017-05-22T22:43:23Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech"],"title_canon_sha256":"f7fdf5c203b5d067c08fae3546272ac8ec96f68a8882491ced738be3241a9c9d","abstract_canon_sha256":"c71de289a8d4a88dbd20db897843815884ee526c5d276ce1d603f4660dfece70"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:11.360796Z","signature_b64":"zVUiCTrzlipAGfkSgYVXQMFqiyzYAeoWUn3aQ4Dy3Y945Xy/pxEQKLX8Efsbanggdf3rGHaObj2ywK8pvqlHBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e80e49ace2a08954d79a11d23dc645c357956ed78a569294bb78f576c431cb34","last_reissued_at":"2026-05-18T00:12:11.360004Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:11.360004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Consistencies and inconsistencies between model selection and link prediction in networks","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech"],"primary_cat":"stat.ML","authors_text":"Marta Sales-Pardo, Roger Guimer\\`a, Tiago P. Peixoto, Toni Vall\\`es-Catal\\`a","submitted_at":"2017-05-22T22:43:23Z","abstract_excerpt":"A principled approach to understand network structures is to formulate generative models. Given a collection of models, however, an outstanding key task is to determine which one provides a more accurate description of the network at hand, discounting statistical fluctuations. This problem can be approached using two principled criteria that at first may seem equivalent: selecting the most plausible model in terms of its posterior probability; or selecting the model with the highest predictive performance in terms of identifying missing links. Here we show that while these two approaches yield"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07967","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":"1705.07967","created_at":"2026-05-18T00:12:11.360150+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.07967v2","created_at":"2026-05-18T00:12:11.360150+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07967","created_at":"2026-05-18T00:12:11.360150+00:00"},{"alias_kind":"pith_short_12","alias_value":"5AHETLHCUCEV","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5AHETLHCUCEVJV42","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5AHETLHC","created_at":"2026-05-18T12:31:00.734936+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/5AHETLHCUCEVJV42CHJD3RSFYN","json":"https://pith.science/pith/5AHETLHCUCEVJV42CHJD3RSFYN.json","graph_json":"https://pith.science/api/pith-number/5AHETLHCUCEVJV42CHJD3RSFYN/graph.json","events_json":"https://pith.science/api/pith-number/5AHETLHCUCEVJV42CHJD3RSFYN/events.json","paper":"https://pith.science/paper/5AHETLHC"},"agent_actions":{"view_html":"https://pith.science/pith/5AHETLHCUCEVJV42CHJD3RSFYN","download_json":"https://pith.science/pith/5AHETLHCUCEVJV42CHJD3RSFYN.json","view_paper":"https://pith.science/paper/5AHETLHC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.07967&json=true","fetch_graph":"https://pith.science/api/pith-number/5AHETLHCUCEVJV42CHJD3RSFYN/graph.json","fetch_events":"https://pith.science/api/pith-number/5AHETLHCUCEVJV42CHJD3RSFYN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5AHETLHCUCEVJV42CHJD3RSFYN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5AHETLHCUCEVJV42CHJD3RSFYN/action/storage_attestation","attest_author":"https://pith.science/pith/5AHETLHCUCEVJV42CHJD3RSFYN/action/author_attestation","sign_citation":"https://pith.science/pith/5AHETLHCUCEVJV42CHJD3RSFYN/action/citation_signature","submit_replication":"https://pith.science/pith/5AHETLHCUCEVJV42CHJD3RSFYN/action/replication_record"}},"created_at":"2026-05-18T00:12:11.360150+00:00","updated_at":"2026-05-18T00:12:11.360150+00:00"}