{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NB2HT4EPXQ6LENJ62O4ZYLEEDJ","short_pith_number":"pith:NB2HT4EP","canonical_record":{"source":{"id":"1609.04859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-09-15T21:00:56Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"faef3c3b24c3f00d99aa58180c293ad29c5723ab1c0d6a555c66767fd8965e20","abstract_canon_sha256":"34d71b5939be5858e52a93b6185f382a968fc2879c7a9118824455f00c32d29c"},"schema_version":"1.0"},"canonical_sha256":"687479f08fbc3cb2353ed3b99c2c841a67c7123e1d6187d5b94cdb8640f381bf","source":{"kind":"arxiv","id":"1609.04859","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.04859","created_at":"2026-05-18T01:04:32Z"},{"alias_kind":"arxiv_version","alias_value":"1609.04859v1","created_at":"2026-05-18T01:04:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04859","created_at":"2026-05-18T01:04:32Z"},{"alias_kind":"pith_short_12","alias_value":"NB2HT4EPXQ6L","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NB2HT4EPXQ6LENJ6","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NB2HT4EP","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NB2HT4EPXQ6LENJ62O4ZYLEEDJ","target":"record","payload":{"canonical_record":{"source":{"id":"1609.04859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-09-15T21:00:56Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"faef3c3b24c3f00d99aa58180c293ad29c5723ab1c0d6a555c66767fd8965e20","abstract_canon_sha256":"34d71b5939be5858e52a93b6185f382a968fc2879c7a9118824455f00c32d29c"},"schema_version":"1.0"},"canonical_sha256":"687479f08fbc3cb2353ed3b99c2c841a67c7123e1d6187d5b94cdb8640f381bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:32.273697Z","signature_b64":"t8S9EmETgArxlyIJ6G9P/JDGdRhAAR5CR4EgoLOemaWuEZaK9oN4OJSJqQt6YVKztlXKCjBOyWMGjHAOUr64DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"687479f08fbc3cb2353ed3b99c2c841a67c7123e1d6187d5b94cdb8640f381bf","last_reissued_at":"2026-05-18T01:04:32.272988Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:32.272988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.04859","source_version":1,"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-18T01:04:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"50vmq3gXlaw/XvNss6oLxcPAYbMffVaGfqVSjiakSDH08syw5rP6ikgXdo+hVltuxtApzuRRieashh4C7hHGBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:08:29.956219Z"},"content_sha256":"3100d107cc70570bff66ee9a5fa1fab17f6a296b1a6a52f20060c100e01bad9b","schema_version":"1.0","event_id":"sha256:3100d107cc70570bff66ee9a5fa1fab17f6a296b1a6a52f20060c100e01bad9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NB2HT4EPXQ6LENJ62O4ZYLEEDJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Model Selection Framework for Graph-based data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Benjamin A. Miller, Leah Weiner, Matthew C. Schmidt, Rajmonda S. Caceres, William M. Campbell","submitted_at":"2016-09-15T21:00:56Z","abstract_excerpt":"Graphs are powerful abstractions for capturing complex relationships in diverse application settings. An active area of research focuses on theoretical models that define the generative mechanism of a graph. Yet given the complexity and inherent noise in real datasets, it is still very challenging to identify the best model for a given observed graph. We discuss a framework for graph model selection that leverages a long list of graph topological properties and a random forest classifier to learn and classify different graph instances. We fully characterize the discriminative power of our appr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04859","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":""},"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-18T01:04:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"174Sy53mHwWvimsoKnYqeaFafTxB32MrkRkh991HGAvoNEeKOk1Htw/3mfZPlDZFfVJr6KOqTYsu6F9z60z8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:08:29.956897Z"},"content_sha256":"1bbeef358a608655870249ec0dea4162aaba89d33659afcf6f5b699abffba95a","schema_version":"1.0","event_id":"sha256:1bbeef358a608655870249ec0dea4162aaba89d33659afcf6f5b699abffba95a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NB2HT4EPXQ6LENJ62O4ZYLEEDJ/bundle.json","state_url":"https://pith.science/pith/NB2HT4EPXQ6LENJ62O4ZYLEEDJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NB2HT4EPXQ6LENJ62O4ZYLEEDJ/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-05-28T21:08:29Z","links":{"resolver":"https://pith.science/pith/NB2HT4EPXQ6LENJ62O4ZYLEEDJ","bundle":"https://pith.science/pith/NB2HT4EPXQ6LENJ62O4ZYLEEDJ/bundle.json","state":"https://pith.science/pith/NB2HT4EPXQ6LENJ62O4ZYLEEDJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NB2HT4EPXQ6LENJ62O4ZYLEEDJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NB2HT4EPXQ6LENJ62O4ZYLEEDJ","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":"34d71b5939be5858e52a93b6185f382a968fc2879c7a9118824455f00c32d29c","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-09-15T21:00:56Z","title_canon_sha256":"faef3c3b24c3f00d99aa58180c293ad29c5723ab1c0d6a555c66767fd8965e20"},"schema_version":"1.0","source":{"id":"1609.04859","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.04859","created_at":"2026-05-18T01:04:32Z"},{"alias_kind":"arxiv_version","alias_value":"1609.04859v1","created_at":"2026-05-18T01:04:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04859","created_at":"2026-05-18T01:04:32Z"},{"alias_kind":"pith_short_12","alias_value":"NB2HT4EPXQ6L","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NB2HT4EPXQ6LENJ6","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NB2HT4EP","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:1bbeef358a608655870249ec0dea4162aaba89d33659afcf6f5b699abffba95a","target":"graph","created_at":"2026-05-18T01:04:32Z","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":"Graphs are powerful abstractions for capturing complex relationships in diverse application settings. An active area of research focuses on theoretical models that define the generative mechanism of a graph. Yet given the complexity and inherent noise in real datasets, it is still very challenging to identify the best model for a given observed graph. We discuss a framework for graph model selection that leverages a long list of graph topological properties and a random forest classifier to learn and classify different graph instances. We fully characterize the discriminative power of our appr","authors_text":"Benjamin A. Miller, Leah Weiner, Matthew C. Schmidt, Rajmonda S. Caceres, William M. Campbell","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-09-15T21:00:56Z","title":"Model Selection Framework for Graph-based data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04859","kind":"arxiv","version":1},"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:3100d107cc70570bff66ee9a5fa1fab17f6a296b1a6a52f20060c100e01bad9b","target":"record","created_at":"2026-05-18T01:04:32Z","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":"34d71b5939be5858e52a93b6185f382a968fc2879c7a9118824455f00c32d29c","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-09-15T21:00:56Z","title_canon_sha256":"faef3c3b24c3f00d99aa58180c293ad29c5723ab1c0d6a555c66767fd8965e20"},"schema_version":"1.0","source":{"id":"1609.04859","kind":"arxiv","version":1}},"canonical_sha256":"687479f08fbc3cb2353ed3b99c2c841a67c7123e1d6187d5b94cdb8640f381bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"687479f08fbc3cb2353ed3b99c2c841a67c7123e1d6187d5b94cdb8640f381bf","first_computed_at":"2026-05-18T01:04:32.272988Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:32.272988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t8S9EmETgArxlyIJ6G9P/JDGdRhAAR5CR4EgoLOemaWuEZaK9oN4OJSJqQt6YVKztlXKCjBOyWMGjHAOUr64DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:32.273697Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.04859","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3100d107cc70570bff66ee9a5fa1fab17f6a296b1a6a52f20060c100e01bad9b","sha256:1bbeef358a608655870249ec0dea4162aaba89d33659afcf6f5b699abffba95a"],"state_sha256":"111b4b480e937b461f3453bbaf25ed774c220d2e36761019ab466229b6b0de93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8kv9kij/5lKCHqTvUYXwfdmJbgnLdmaXAnMlfX5yUAjYC84o03G+UlBX1pAEr1Jhyq8+suFiDPqtMY0jwlqZCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:08:29.960232Z","bundle_sha256":"98cdaf5659a67b274231093ca376c4efc81ae5b95a2c1beb0ceeca0720f3f1de"}}