{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5AHETLHCUCEVJV42CHJD3RSFYN","short_pith_number":"pith:5AHETLHC","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"},"canonical_sha256":"e80e49ace2a08954d79a11d23dc645c357956ed78a569294bb78f576c431cb34","source":{"kind":"arxiv","id":"1705.07967","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07967","created_at":"2026-05-18T00:12:11Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07967v2","created_at":"2026-05-18T00:12:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07967","created_at":"2026-05-18T00:12:11Z"},{"alias_kind":"pith_short_12","alias_value":"5AHETLHCUCEV","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5AHETLHCUCEVJV42","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5AHETLHC","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5AHETLHCUCEVJV42CHJD3RSFYN","target":"record","payload":{"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"},"canonical_sha256":"e80e49ace2a08954d79a11d23dc645c357956ed78a569294bb78f576c431cb34","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"},"source_kind":"arxiv","source_id":"1705.07967","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:12:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JQ0StQlYnuyK27x4RVlNITha13yRXE2m2kt12SFZbh29XNmiP0UPOW/Urhz6pdgEJ+1IXFKQ4aHuhYQfO642BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:03:53.842417Z"},"content_sha256":"3fea648641fc510d4761f819ad183e377a849eff4537cd953e438fea23a484c1","schema_version":"1.0","event_id":"sha256:3fea648641fc510d4761f819ad183e377a849eff4537cd953e438fea23a484c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5AHETLHCUCEVJV42CHJD3RSFYN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:12:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F0jsIZa58kOA5hi/gQsi0og+gksEHZYdFJcR2xPGfpSuNqvUTlkiBD4WWdJ4T1SOQv6/yt6h+w0rNJqzkid6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:03:53.843146Z"},"content_sha256":"6477f3b45cf3499e84b9ded1f4189503b7d5207cc2b5ff6ec46033b84dd9e291","schema_version":"1.0","event_id":"sha256:6477f3b45cf3499e84b9ded1f4189503b7d5207cc2b5ff6ec46033b84dd9e291"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5AHETLHCUCEVJV42CHJD3RSFYN/bundle.json","state_url":"https://pith.science/pith/5AHETLHCUCEVJV42CHJD3RSFYN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5AHETLHCUCEVJV42CHJD3RSFYN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T21:03:53Z","links":{"resolver":"https://pith.science/pith/5AHETLHCUCEVJV42CHJD3RSFYN","bundle":"https://pith.science/pith/5AHETLHCUCEVJV42CHJD3RSFYN/bundle.json","state":"https://pith.science/pith/5AHETLHCUCEVJV42CHJD3RSFYN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5AHETLHCUCEVJV42CHJD3RSFYN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5AHETLHCUCEVJV42CHJD3RSFYN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c71de289a8d4a88dbd20db897843815884ee526c5d276ce1d603f4660dfece70","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2017-05-22T22:43:23Z","title_canon_sha256":"f7fdf5c203b5d067c08fae3546272ac8ec96f68a8882491ced738be3241a9c9d"},"schema_version":"1.0","source":{"id":"1705.07967","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07967","created_at":"2026-05-18T00:12:11Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07967v2","created_at":"2026-05-18T00:12:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07967","created_at":"2026-05-18T00:12:11Z"},{"alias_kind":"pith_short_12","alias_value":"5AHETLHCUCEV","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5AHETLHCUCEVJV42","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5AHETLHC","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:6477f3b45cf3499e84b9ded1f4189503b7d5207cc2b5ff6ec46033b84dd9e291","target":"graph","created_at":"2026-05-18T00:12:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Marta Sales-Pardo, Roger Guimer\\`a, Tiago P. Peixoto, Toni Vall\\`es-Catal\\`a","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2017-05-22T22:43:23Z","title":"Consistencies and inconsistencies between model selection and link prediction in networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07967","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3fea648641fc510d4761f819ad183e377a849eff4537cd953e438fea23a484c1","target":"record","created_at":"2026-05-18T00:12:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c71de289a8d4a88dbd20db897843815884ee526c5d276ce1d603f4660dfece70","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2017-05-22T22:43:23Z","title_canon_sha256":"f7fdf5c203b5d067c08fae3546272ac8ec96f68a8882491ced738be3241a9c9d"},"schema_version":"1.0","source":{"id":"1705.07967","kind":"arxiv","version":2}},"canonical_sha256":"e80e49ace2a08954d79a11d23dc645c357956ed78a569294bb78f576c431cb34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e80e49ace2a08954d79a11d23dc645c357956ed78a569294bb78f576c431cb34","first_computed_at":"2026-05-18T00:12:11.360004Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:11.360004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zVUiCTrzlipAGfkSgYVXQMFqiyzYAeoWUn3aQ4Dy3Y945Xy/pxEQKLX8Efsbanggdf3rGHaObj2ywK8pvqlHBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:11.360796Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07967","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fea648641fc510d4761f819ad183e377a849eff4537cd953e438fea23a484c1","sha256:6477f3b45cf3499e84b9ded1f4189503b7d5207cc2b5ff6ec46033b84dd9e291"],"state_sha256":"fc2f40975b51827ca4f56886aaa3c3edbd4e4d9daf048c379ef0714867a4e23c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fL8KRoX+obGZTRMQd9xtmOY1wZTBG0joqQ0/mtn1nXYzeToRdHTqc+P52mvpc3DGW49acx7QW3wY6+/Gx9E6Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T21:03:53.846879Z","bundle_sha256":"99ab581e680bad849d34b9c511d66258abc6b26a51f084839f8e2bcd65c6538f"}}