{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZMYHROU4ZCP6DXIRJQS3CANLRN","short_pith_number":"pith:ZMYHROU4","schema_version":"1.0","canonical_sha256":"cb3078ba9cc89fe1dd114c25b101ab8b7c6b9e31286a8463749aaf3f21370118","source":{"kind":"arxiv","id":"1809.11098","version":1},"attestation_state":"computed","paper":{"title":"A Differential Degree Test for Comparing Brain Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.NC"],"primary_cat":"stat.AP","authors_text":"Helen Mayberg, Ixavier A Higgins, Ki Sueng Choi, Suprateek Kundu, Ying Guo","submitted_at":"2018-09-28T15:43:49Z","abstract_excerpt":"Recently, graph theory has become a popular method for characterizing brain functional organization. One important goal in graph theoretical analysis of brain networks is to identify network differences across disease types or conditions. Typical approaches include massive univariate testing of each edge or comparisons of local and/or global network metrics to identify deviations in topological organization. Some limitations of these methods include low statistical power due to the large number of comparisons and difficulty attributing overall differences in networks to local variations in bra"},"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":"1809.11098","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2018-09-28T15:43:49Z","cross_cats_sorted":["q-bio.NC"],"title_canon_sha256":"786d085839319d5626a8c4ed6aed2cc1c8c90656fe6f42163c9cec8081503b11","abstract_canon_sha256":"bd6c02be7ffcba2f0258daa7ea4cf931c2f84df5718e4c631b38a7ca2550d576"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:33.309143Z","signature_b64":"DEW6bb92Xjb22bjxZhM7qpU2Sk+iKe9EsDm33KfJ098TEy25ez6Z9UQUhbI3e5uTZCGX/Jar42pbVT4cxc6dCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb3078ba9cc89fe1dd114c25b101ab8b7c6b9e31286a8463749aaf3f21370118","last_reissued_at":"2026-05-18T00:04:33.308511Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:33.308511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Differential Degree Test for Comparing Brain Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.NC"],"primary_cat":"stat.AP","authors_text":"Helen Mayberg, Ixavier A Higgins, Ki Sueng Choi, Suprateek Kundu, Ying Guo","submitted_at":"2018-09-28T15:43:49Z","abstract_excerpt":"Recently, graph theory has become a popular method for characterizing brain functional organization. One important goal in graph theoretical analysis of brain networks is to identify network differences across disease types or conditions. Typical approaches include massive univariate testing of each edge or comparisons of local and/or global network metrics to identify deviations in topological organization. Some limitations of these methods include low statistical power due to the large number of comparisons and difficulty attributing overall differences in networks to local variations in bra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.11098","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":"1809.11098","created_at":"2026-05-18T00:04:33.308634+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.11098v1","created_at":"2026-05-18T00:04:33.308634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.11098","created_at":"2026-05-18T00:04:33.308634+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZMYHROU4ZCP6","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZMYHROU4ZCP6DXIR","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZMYHROU4","created_at":"2026-05-18T12:33:07.085635+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.12706","citing_title":"A Resampling-Based Framework for Network Structure Learning in High-Dimensional Data","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZMYHROU4ZCP6DXIRJQS3CANLRN","json":"https://pith.science/pith/ZMYHROU4ZCP6DXIRJQS3CANLRN.json","graph_json":"https://pith.science/api/pith-number/ZMYHROU4ZCP6DXIRJQS3CANLRN/graph.json","events_json":"https://pith.science/api/pith-number/ZMYHROU4ZCP6DXIRJQS3CANLRN/events.json","paper":"https://pith.science/paper/ZMYHROU4"},"agent_actions":{"view_html":"https://pith.science/pith/ZMYHROU4ZCP6DXIRJQS3CANLRN","download_json":"https://pith.science/pith/ZMYHROU4ZCP6DXIRJQS3CANLRN.json","view_paper":"https://pith.science/paper/ZMYHROU4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.11098&json=true","fetch_graph":"https://pith.science/api/pith-number/ZMYHROU4ZCP6DXIRJQS3CANLRN/graph.json","fetch_events":"https://pith.science/api/pith-number/ZMYHROU4ZCP6DXIRJQS3CANLRN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZMYHROU4ZCP6DXIRJQS3CANLRN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZMYHROU4ZCP6DXIRJQS3CANLRN/action/storage_attestation","attest_author":"https://pith.science/pith/ZMYHROU4ZCP6DXIRJQS3CANLRN/action/author_attestation","sign_citation":"https://pith.science/pith/ZMYHROU4ZCP6DXIRJQS3CANLRN/action/citation_signature","submit_replication":"https://pith.science/pith/ZMYHROU4ZCP6DXIRJQS3CANLRN/action/replication_record"}},"created_at":"2026-05-18T00:04:33.308634+00:00","updated_at":"2026-05-18T00:04:33.308634+00:00"}