{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NB2HT4EPXQ6LENJ62O4ZYLEEDJ","short_pith_number":"pith:NB2HT4EP","schema_version":"1.0","canonical_sha256":"687479f08fbc3cb2353ed3b99c2c841a67c7123e1d6187d5b94cdb8640f381bf","source":{"kind":"arxiv","id":"1609.04859","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.04859","created_at":"2026-05-18T01:04:32.273094+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.04859v1","created_at":"2026-05-18T01:04:32.273094+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04859","created_at":"2026-05-18T01:04:32.273094+00:00"},{"alias_kind":"pith_short_12","alias_value":"NB2HT4EPXQ6L","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NB2HT4EPXQ6LENJ6","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NB2HT4EP","created_at":"2026-05-18T12:30:32.724797+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/NB2HT4EPXQ6LENJ62O4ZYLEEDJ","json":"https://pith.science/pith/NB2HT4EPXQ6LENJ62O4ZYLEEDJ.json","graph_json":"https://pith.science/api/pith-number/NB2HT4EPXQ6LENJ62O4ZYLEEDJ/graph.json","events_json":"https://pith.science/api/pith-number/NB2HT4EPXQ6LENJ62O4ZYLEEDJ/events.json","paper":"https://pith.science/paper/NB2HT4EP"},"agent_actions":{"view_html":"https://pith.science/pith/NB2HT4EPXQ6LENJ62O4ZYLEEDJ","download_json":"https://pith.science/pith/NB2HT4EPXQ6LENJ62O4ZYLEEDJ.json","view_paper":"https://pith.science/paper/NB2HT4EP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.04859&json=true","fetch_graph":"https://pith.science/api/pith-number/NB2HT4EPXQ6LENJ62O4ZYLEEDJ/graph.json","fetch_events":"https://pith.science/api/pith-number/NB2HT4EPXQ6LENJ62O4ZYLEEDJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NB2HT4EPXQ6LENJ62O4ZYLEEDJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NB2HT4EPXQ6LENJ62O4ZYLEEDJ/action/storage_attestation","attest_author":"https://pith.science/pith/NB2HT4EPXQ6LENJ62O4ZYLEEDJ/action/author_attestation","sign_citation":"https://pith.science/pith/NB2HT4EPXQ6LENJ62O4ZYLEEDJ/action/citation_signature","submit_replication":"https://pith.science/pith/NB2HT4EPXQ6LENJ62O4ZYLEEDJ/action/replication_record"}},"created_at":"2026-05-18T01:04:32.273094+00:00","updated_at":"2026-05-18T01:04:32.273094+00:00"}