{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:RC6F5FESPHWIXBGFR5G4SBQFO3","short_pith_number":"pith:RC6F5FES","schema_version":"1.0","canonical_sha256":"88bc5e949279ec8b84c58f4dc9060576eacc3bcacb2769b18c4261ff6e52c077","source":{"kind":"arxiv","id":"2209.13513","version":3},"attestation_state":"computed","paper":{"title":"DynDepNet: Learning Time-Varying Dependency Structures from fMRI Data via Dynamic Graph Structure Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.AP","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander Campbell, Antonio Giuliano Zippo, Luca Passamonti, Nicola Toschi, Pietro Lio","submitted_at":"2022-09-27T16:32:11Z","abstract_excerpt":"Graph neural networks (GNNs) have demonstrated success in learning representations of brain graphs derived from functional magnetic resonance imaging (fMRI) data. However, existing GNN methods assume brain graphs are static over time and the graph adjacency matrix is known prior to model training. These assumptions contradict evidence that brain graphs are time-varying with a connectivity structure that depends on the choice of functional connectivity measure. Incorrectly representing fMRI data with noisy brain graphs can adversely affect GNN performance. To address this, we propose DynDepNet,"},"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":"2209.13513","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-09-27T16:32:11Z","cross_cats_sorted":["stat.AP","stat.ML"],"title_canon_sha256":"319d54730abe49cc6d0294cf49b80c4a6cd995d0559452dca5b4f73f813bf641","abstract_canon_sha256":"b52f6fac7cec144c09599759748d2f753ac101ef30761defa0cf6e19ae02243e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:28:56.005722Z","signature_b64":"aIgr5WnZFPXAbalHhjbnQU0R147lmt5vKFKr1dEifNadeZUwVK/LfaCeWQ59x/ngW5TpOLfU802BQmm7SAVECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88bc5e949279ec8b84c58f4dc9060576eacc3bcacb2769b18c4261ff6e52c077","last_reissued_at":"2026-07-05T06:28:56.005265Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:28:56.005265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DynDepNet: Learning Time-Varying Dependency Structures from fMRI Data via Dynamic Graph Structure Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.AP","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander Campbell, Antonio Giuliano Zippo, Luca Passamonti, Nicola Toschi, Pietro Lio","submitted_at":"2022-09-27T16:32:11Z","abstract_excerpt":"Graph neural networks (GNNs) have demonstrated success in learning representations of brain graphs derived from functional magnetic resonance imaging (fMRI) data. However, existing GNN methods assume brain graphs are static over time and the graph adjacency matrix is known prior to model training. These assumptions contradict evidence that brain graphs are time-varying with a connectivity structure that depends on the choice of functional connectivity measure. Incorrectly representing fMRI data with noisy brain graphs can adversely affect GNN performance. To address this, we propose DynDepNet,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.13513","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2209.13513/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2209.13513","created_at":"2026-07-05T06:28:56.005313+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.13513v3","created_at":"2026-07-05T06:28:56.005313+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.13513","created_at":"2026-07-05T06:28:56.005313+00:00"},{"alias_kind":"pith_short_12","alias_value":"RC6F5FESPHWI","created_at":"2026-07-05T06:28:56.005313+00:00"},{"alias_kind":"pith_short_16","alias_value":"RC6F5FESPHWIXBGF","created_at":"2026-07-05T06:28:56.005313+00:00"},{"alias_kind":"pith_short_8","alias_value":"RC6F5FES","created_at":"2026-07-05T06:28:56.005313+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.07333","citing_title":"When GNNs Fail: Quantifying and Overcoming Temporal Correlation Volatility in Time Series","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RC6F5FESPHWIXBGFR5G4SBQFO3","json":"https://pith.science/pith/RC6F5FESPHWIXBGFR5G4SBQFO3.json","graph_json":"https://pith.science/api/pith-number/RC6F5FESPHWIXBGFR5G4SBQFO3/graph.json","events_json":"https://pith.science/api/pith-number/RC6F5FESPHWIXBGFR5G4SBQFO3/events.json","paper":"https://pith.science/paper/RC6F5FES"},"agent_actions":{"view_html":"https://pith.science/pith/RC6F5FESPHWIXBGFR5G4SBQFO3","download_json":"https://pith.science/pith/RC6F5FESPHWIXBGFR5G4SBQFO3.json","view_paper":"https://pith.science/paper/RC6F5FES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.13513&json=true","fetch_graph":"https://pith.science/api/pith-number/RC6F5FESPHWIXBGFR5G4SBQFO3/graph.json","fetch_events":"https://pith.science/api/pith-number/RC6F5FESPHWIXBGFR5G4SBQFO3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RC6F5FESPHWIXBGFR5G4SBQFO3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RC6F5FESPHWIXBGFR5G4SBQFO3/action/storage_attestation","attest_author":"https://pith.science/pith/RC6F5FESPHWIXBGFR5G4SBQFO3/action/author_attestation","sign_citation":"https://pith.science/pith/RC6F5FESPHWIXBGFR5G4SBQFO3/action/citation_signature","submit_replication":"https://pith.science/pith/RC6F5FESPHWIXBGFR5G4SBQFO3/action/replication_record"}},"created_at":"2026-07-05T06:28:56.005313+00:00","updated_at":"2026-07-05T06:28:56.005313+00:00"}