{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GWJSRPSMFMJZP25WF2CXPYXE5B","short_pith_number":"pith:GWJSRPSM","canonical_record":{"source":{"id":"1506.05219","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2015-06-17T06:49:42Z","cross_cats_sorted":["q-bio.NC"],"title_canon_sha256":"f8bbab6e2ead2f138f72a051d20d8351bbfbd22b2a84f658efe7eee301db9c5d","abstract_canon_sha256":"b2a57f02b29e0f07745e83c86e7061f4e5deef6acf6b3bc5a3893eb3635641d1"},"schema_version":"1.0"},"canonical_sha256":"359328be4c2b1397ebb62e8577e2e4e87dba04a08614e2a94fc0b4fe7582bc78","source":{"kind":"arxiv","id":"1506.05219","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.05219","created_at":"2026-05-18T01:46:12Z"},{"alias_kind":"arxiv_version","alias_value":"1506.05219v1","created_at":"2026-05-18T01:46:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05219","created_at":"2026-05-18T01:46:12Z"},{"alias_kind":"pith_short_12","alias_value":"GWJSRPSMFMJZ","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GWJSRPSMFMJZP25W","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GWJSRPSM","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GWJSRPSMFMJZP25WF2CXPYXE5B","target":"record","payload":{"canonical_record":{"source":{"id":"1506.05219","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2015-06-17T06:49:42Z","cross_cats_sorted":["q-bio.NC"],"title_canon_sha256":"f8bbab6e2ead2f138f72a051d20d8351bbfbd22b2a84f658efe7eee301db9c5d","abstract_canon_sha256":"b2a57f02b29e0f07745e83c86e7061f4e5deef6acf6b3bc5a3893eb3635641d1"},"schema_version":"1.0"},"canonical_sha256":"359328be4c2b1397ebb62e8577e2e4e87dba04a08614e2a94fc0b4fe7582bc78","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:46:12.740674Z","signature_b64":"dEiCQuzUBucEiv0ljD1oPM7h7qpogQlZgz4Fdy13sUVY2gVXUICX7WGtzDn8BB+WMxL0qEXJtzYKRi6Q/cL2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"359328be4c2b1397ebb62e8577e2e4e87dba04a08614e2a94fc0b4fe7582bc78","last_reissued_at":"2026-05-18T01:46:12.739908Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:46:12.739908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.05219","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:46:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+J3zgQSfR9vho7vkSrfeEL+b8X8u4YbD/SAKOSjIEg+2vbMGHp4ClhUSXvDpRIDCT4vHSxVEulJJqw4G6Xk7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:47:52.350072Z"},"content_sha256":"89304163119d8a523e0d413787c6ed49e196e389ae9a3ebe5b8a7c27027f142a","schema_version":"1.0","event_id":"sha256:89304163119d8a523e0d413787c6ed49e196e389ae9a3ebe5b8a7c27027f142a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GWJSRPSMFMJZP25WF2CXPYXE5B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph embeddings of dynamic functional connectivity reveal discriminative patterns of task engagement in HCP data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.NC"],"primary_cat":"stat.AP","authors_text":"Christoforos Anagnostopoulos, Giovanni Montana, Peter Hellyer, Ricardo Pio Monti, Robert Leech, Romy Lorenz","submitted_at":"2015-06-17T06:49:42Z","abstract_excerpt":"There is increasing evidence to suggest functional connectivity networks are non-stationary. This has lead to the development of novel methodologies with which to accurately estimate time-varying functional connectivity networks. Many of these methods provide unprecedented temporal granularity by estimating a functional connectivity network at each point in time; resulting in high-dimensional output which can be studied in a variety of ways. One possible method is to employ graph embedding algorithms. Such algorithms effectively map estimated networks from high-dimensional spaces down to a low"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05219","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:46:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J7sa9WbydA19hg7Dd6+a+1PkfJqHoyco8Hf/jY36IKS8XYFjjMCciqbR+Nyxz990TTpy9pyVMISMQzgldKq4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:47:52.350629Z"},"content_sha256":"906a9a4483cd8cd4aefe58a89c2372582f17b75d909a7e310e913b4223e80d3d","schema_version":"1.0","event_id":"sha256:906a9a4483cd8cd4aefe58a89c2372582f17b75d909a7e310e913b4223e80d3d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GWJSRPSMFMJZP25WF2CXPYXE5B/bundle.json","state_url":"https://pith.science/pith/GWJSRPSMFMJZP25WF2CXPYXE5B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GWJSRPSMFMJZP25WF2CXPYXE5B/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-26T02:47:52Z","links":{"resolver":"https://pith.science/pith/GWJSRPSMFMJZP25WF2CXPYXE5B","bundle":"https://pith.science/pith/GWJSRPSMFMJZP25WF2CXPYXE5B/bundle.json","state":"https://pith.science/pith/GWJSRPSMFMJZP25WF2CXPYXE5B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GWJSRPSMFMJZP25WF2CXPYXE5B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GWJSRPSMFMJZP25WF2CXPYXE5B","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":"b2a57f02b29e0f07745e83c86e7061f4e5deef6acf6b3bc5a3893eb3635641d1","cross_cats_sorted":["q-bio.NC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2015-06-17T06:49:42Z","title_canon_sha256":"f8bbab6e2ead2f138f72a051d20d8351bbfbd22b2a84f658efe7eee301db9c5d"},"schema_version":"1.0","source":{"id":"1506.05219","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.05219","created_at":"2026-05-18T01:46:12Z"},{"alias_kind":"arxiv_version","alias_value":"1506.05219v1","created_at":"2026-05-18T01:46:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05219","created_at":"2026-05-18T01:46:12Z"},{"alias_kind":"pith_short_12","alias_value":"GWJSRPSMFMJZ","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GWJSRPSMFMJZP25W","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GWJSRPSM","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:906a9a4483cd8cd4aefe58a89c2372582f17b75d909a7e310e913b4223e80d3d","target":"graph","created_at":"2026-05-18T01:46:12Z","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":"There is increasing evidence to suggest functional connectivity networks are non-stationary. This has lead to the development of novel methodologies with which to accurately estimate time-varying functional connectivity networks. Many of these methods provide unprecedented temporal granularity by estimating a functional connectivity network at each point in time; resulting in high-dimensional output which can be studied in a variety of ways. One possible method is to employ graph embedding algorithms. Such algorithms effectively map estimated networks from high-dimensional spaces down to a low","authors_text":"Christoforos Anagnostopoulos, Giovanni Montana, Peter Hellyer, Ricardo Pio Monti, Robert Leech, Romy Lorenz","cross_cats":["q-bio.NC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2015-06-17T06:49:42Z","title":"Graph embeddings of dynamic functional connectivity reveal discriminative patterns of task engagement in HCP data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05219","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:89304163119d8a523e0d413787c6ed49e196e389ae9a3ebe5b8a7c27027f142a","target":"record","created_at":"2026-05-18T01:46:12Z","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":"b2a57f02b29e0f07745e83c86e7061f4e5deef6acf6b3bc5a3893eb3635641d1","cross_cats_sorted":["q-bio.NC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2015-06-17T06:49:42Z","title_canon_sha256":"f8bbab6e2ead2f138f72a051d20d8351bbfbd22b2a84f658efe7eee301db9c5d"},"schema_version":"1.0","source":{"id":"1506.05219","kind":"arxiv","version":1}},"canonical_sha256":"359328be4c2b1397ebb62e8577e2e4e87dba04a08614e2a94fc0b4fe7582bc78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"359328be4c2b1397ebb62e8577e2e4e87dba04a08614e2a94fc0b4fe7582bc78","first_computed_at":"2026-05-18T01:46:12.739908Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:46:12.739908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dEiCQuzUBucEiv0ljD1oPM7h7qpogQlZgz4Fdy13sUVY2gVXUICX7WGtzDn8BB+WMxL0qEXJtzYKRi6Q/cL2Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:46:12.740674Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.05219","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89304163119d8a523e0d413787c6ed49e196e389ae9a3ebe5b8a7c27027f142a","sha256:906a9a4483cd8cd4aefe58a89c2372582f17b75d909a7e310e913b4223e80d3d"],"state_sha256":"da84dc3beb6d83ab1a7e4e9bafb278fde673377c010a9cf39e6670a99b7958fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/dKbW5uTxDZxQBSAi4pcpOhWk8v2In0LSKGlNfKBRblF/1J3iirB9rFIp12UDLNOHmJTluTrJ72dIAxmoOwXAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:47:52.353899Z","bundle_sha256":"2de2187342a7dd4e933d943cbff79c65f54099cc9847e078d2297fd964136b92"}}