{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XRZNJRFTXFEAMUBDNQDH4D6F3Z","short_pith_number":"pith:XRZNJRFT","schema_version":"1.0","canonical_sha256":"bc72d4c4b3b9480650236c067e0fc5de63096520c4bd9bd68e088cac6d0d6054","source":{"kind":"arxiv","id":"1604.02403","version":1},"attestation_state":"computed","paper":{"title":"Cluster-Span Threshold: An unbiased threshold for binarising weighted complete networks in functional connectivity analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.NC","authors_text":"Hamed Azami, Javier Escudero, John M. Starr, Keith Smith, Mario A. Parra","submitted_at":"2016-04-08T17:10:04Z","abstract_excerpt":"We propose a new unbiased threshold for network analysis named the Cluster-Span Threshold (CST). This is based on the clustering coefficient, C, following logic that a balance of `clustering' to `spanning' triples results in a useful topology for network analysis and that the product of complementing properties has a unique value only when perfectly balanced. We threshold networks by fixing C at this balanced value, rather than fixing connection density at an arbitrary value, as has been the trend. We compare results from an electroencephalogram data set of volunteers performing visual short t"},"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":"1604.02403","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2016-04-08T17:10:04Z","cross_cats_sorted":[],"title_canon_sha256":"ae5a9dd867405e19ecede3b0b4c62304daa704d72e8f74e58fc2881ae2139baf","abstract_canon_sha256":"308dd80f5fa0d56b2b02d8c94f98d6d688520edf204bf78c4ec83f5396b01aea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:26.634593Z","signature_b64":"UELJbDpBk9D51mBrzApHQgN8v4ZRMpQi/QbIG9jLku5mYBjjvJWRnlKpxMuB4Rrox0xtjBbOOPmJ2rIafGemBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc72d4c4b3b9480650236c067e0fc5de63096520c4bd9bd68e088cac6d0d6054","last_reissued_at":"2026-05-18T01:17:26.634131Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:26.634131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cluster-Span Threshold: An unbiased threshold for binarising weighted complete networks in functional connectivity analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.NC","authors_text":"Hamed Azami, Javier Escudero, John M. Starr, Keith Smith, Mario A. Parra","submitted_at":"2016-04-08T17:10:04Z","abstract_excerpt":"We propose a new unbiased threshold for network analysis named the Cluster-Span Threshold (CST). This is based on the clustering coefficient, C, following logic that a balance of `clustering' to `spanning' triples results in a useful topology for network analysis and that the product of complementing properties has a unique value only when perfectly balanced. We threshold networks by fixing C at this balanced value, rather than fixing connection density at an arbitrary value, as has been the trend. We compare results from an electroencephalogram data set of volunteers performing visual short t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02403","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":"1604.02403","created_at":"2026-05-18T01:17:26.634201+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.02403v1","created_at":"2026-05-18T01:17:26.634201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02403","created_at":"2026-05-18T01:17:26.634201+00:00"},{"alias_kind":"pith_short_12","alias_value":"XRZNJRFTXFEA","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XRZNJRFTXFEAMUBD","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XRZNJRFT","created_at":"2026-05-18T12:30:51.357362+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/XRZNJRFTXFEAMUBDNQDH4D6F3Z","json":"https://pith.science/pith/XRZNJRFTXFEAMUBDNQDH4D6F3Z.json","graph_json":"https://pith.science/api/pith-number/XRZNJRFTXFEAMUBDNQDH4D6F3Z/graph.json","events_json":"https://pith.science/api/pith-number/XRZNJRFTXFEAMUBDNQDH4D6F3Z/events.json","paper":"https://pith.science/paper/XRZNJRFT"},"agent_actions":{"view_html":"https://pith.science/pith/XRZNJRFTXFEAMUBDNQDH4D6F3Z","download_json":"https://pith.science/pith/XRZNJRFTXFEAMUBDNQDH4D6F3Z.json","view_paper":"https://pith.science/paper/XRZNJRFT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.02403&json=true","fetch_graph":"https://pith.science/api/pith-number/XRZNJRFTXFEAMUBDNQDH4D6F3Z/graph.json","fetch_events":"https://pith.science/api/pith-number/XRZNJRFTXFEAMUBDNQDH4D6F3Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XRZNJRFTXFEAMUBDNQDH4D6F3Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XRZNJRFTXFEAMUBDNQDH4D6F3Z/action/storage_attestation","attest_author":"https://pith.science/pith/XRZNJRFTXFEAMUBDNQDH4D6F3Z/action/author_attestation","sign_citation":"https://pith.science/pith/XRZNJRFTXFEAMUBDNQDH4D6F3Z/action/citation_signature","submit_replication":"https://pith.science/pith/XRZNJRFTXFEAMUBDNQDH4D6F3Z/action/replication_record"}},"created_at":"2026-05-18T01:17:26.634201+00:00","updated_at":"2026-05-18T01:17:26.634201+00:00"}