{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VTE3O7IW4RL6RAK37ML3CWZIIH","short_pith_number":"pith:VTE3O7IW","canonical_record":{"source":{"id":"1601.01704","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2016-01-07T21:15:41Z","cross_cats_sorted":["math.AT","q-bio.QM"],"title_canon_sha256":"da9d9b7d8fa798aeb89d338d0f2548d0f7462f0398760671eafb5abffbaec00a","abstract_canon_sha256":"35e4a3c953695159ba6116435ea1f87eda8628c7ddd8f77dbf1e72486bc7b47b"},"schema_version":"1.0"},"canonical_sha256":"acc9b77d16e457e8815bfb17b15b2841fe8b03cafcd7e4a0de4ff6445fe85120","source":{"kind":"arxiv","id":"1601.01704","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01704","created_at":"2026-05-18T01:22:57Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01704v2","created_at":"2026-05-18T01:22:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01704","created_at":"2026-05-18T01:22:57Z"},{"alias_kind":"pith_short_12","alias_value":"VTE3O7IW4RL6","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VTE3O7IW4RL6RAK3","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VTE3O7IW","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VTE3O7IW4RL6RAK37ML3CWZIIH","target":"record","payload":{"canonical_record":{"source":{"id":"1601.01704","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2016-01-07T21:15:41Z","cross_cats_sorted":["math.AT","q-bio.QM"],"title_canon_sha256":"da9d9b7d8fa798aeb89d338d0f2548d0f7462f0398760671eafb5abffbaec00a","abstract_canon_sha256":"35e4a3c953695159ba6116435ea1f87eda8628c7ddd8f77dbf1e72486bc7b47b"},"schema_version":"1.0"},"canonical_sha256":"acc9b77d16e457e8815bfb17b15b2841fe8b03cafcd7e4a0de4ff6445fe85120","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:57.138991Z","signature_b64":"vqMFs7/TJdCGr+NZ2anYdvzuoE2HI2hrCGuhJl3K0OyHZHPjsDnxYMEQyomTIfSFr/gs/LDzlsQ4JMu9lIrZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acc9b77d16e457e8815bfb17b15b2841fe8b03cafcd7e4a0de4ff6445fe85120","last_reissued_at":"2026-05-18T01:22:57.138455Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:57.138455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.01704","source_version":2,"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:22:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5RMDJJz2AJ7yx3AWgksSfnB6L743ZQ9eAJ2MVKg5CAmd8Qipe1I9ZnYwsSO3jFN3w4WWEJM+5ffMuMJuUxrzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T23:00:55.543509Z"},"content_sha256":"d0634dea66d379a5968c0acac41f6b7fb38b7ad8063d2a293f822d1048834faf","schema_version":"1.0","event_id":"sha256:d0634dea66d379a5968c0acac41f6b7fb38b7ad8063d2a293f822d1048834faf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VTE3O7IW4RL6RAK37ML3CWZIIH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two's company, three (or more) is a simplex: Algebraic-topological tools for understanding higher-order structure in neural data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT","q-bio.QM"],"primary_cat":"q-bio.NC","authors_text":"Chad Giusti, Danielle S. Bassett, Robert Ghrist","submitted_at":"2016-01-07T21:15:41Z","abstract_excerpt":"The language of graph theory, or network science, has proven to be an exceptional tool for addressing myriad problems in neuroscience. Yet, the use of networks is predicated on a critical simplifying assumption: that the quintessential unit of interest in a brain is a dyad -- two nodes (neurons or brain regions) connected by an edge. While rarely mentioned, this fundamental assumption inherently limits the types of neural structure and function that graphs can be used to model. Here, we describe a generalization of graphs that overcomes these limitations, thereby offering a broad range of new "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01704","kind":"arxiv","version":2},"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:22:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P7cpybC7vCJoBvRhGCJSdka5oEmUF2njuqYzo5z0oXqnnsBwjR/6RH8baNfDeq1Alxi3NHOrz/krVaa10fAKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T23:00:55.543847Z"},"content_sha256":"385c41ec676d8e54b66048f80884938e3452e94f0ef9d41d7078d291dfac783d","schema_version":"1.0","event_id":"sha256:385c41ec676d8e54b66048f80884938e3452e94f0ef9d41d7078d291dfac783d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VTE3O7IW4RL6RAK37ML3CWZIIH/bundle.json","state_url":"https://pith.science/pith/VTE3O7IW4RL6RAK37ML3CWZIIH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VTE3O7IW4RL6RAK37ML3CWZIIH/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-06-20T23:00:55Z","links":{"resolver":"https://pith.science/pith/VTE3O7IW4RL6RAK37ML3CWZIIH","bundle":"https://pith.science/pith/VTE3O7IW4RL6RAK37ML3CWZIIH/bundle.json","state":"https://pith.science/pith/VTE3O7IW4RL6RAK37ML3CWZIIH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VTE3O7IW4RL6RAK37ML3CWZIIH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VTE3O7IW4RL6RAK37ML3CWZIIH","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":"35e4a3c953695159ba6116435ea1f87eda8628c7ddd8f77dbf1e72486bc7b47b","cross_cats_sorted":["math.AT","q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2016-01-07T21:15:41Z","title_canon_sha256":"da9d9b7d8fa798aeb89d338d0f2548d0f7462f0398760671eafb5abffbaec00a"},"schema_version":"1.0","source":{"id":"1601.01704","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01704","created_at":"2026-05-18T01:22:57Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01704v2","created_at":"2026-05-18T01:22:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01704","created_at":"2026-05-18T01:22:57Z"},{"alias_kind":"pith_short_12","alias_value":"VTE3O7IW4RL6","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VTE3O7IW4RL6RAK3","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VTE3O7IW","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:385c41ec676d8e54b66048f80884938e3452e94f0ef9d41d7078d291dfac783d","target":"graph","created_at":"2026-05-18T01:22:57Z","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":"The language of graph theory, or network science, has proven to be an exceptional tool for addressing myriad problems in neuroscience. Yet, the use of networks is predicated on a critical simplifying assumption: that the quintessential unit of interest in a brain is a dyad -- two nodes (neurons or brain regions) connected by an edge. While rarely mentioned, this fundamental assumption inherently limits the types of neural structure and function that graphs can be used to model. Here, we describe a generalization of graphs that overcomes these limitations, thereby offering a broad range of new ","authors_text":"Chad Giusti, Danielle S. Bassett, Robert Ghrist","cross_cats":["math.AT","q-bio.QM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2016-01-07T21:15:41Z","title":"Two's company, three (or more) is a simplex: Algebraic-topological tools for understanding higher-order structure in neural data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01704","kind":"arxiv","version":2},"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:d0634dea66d379a5968c0acac41f6b7fb38b7ad8063d2a293f822d1048834faf","target":"record","created_at":"2026-05-18T01:22:57Z","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":"35e4a3c953695159ba6116435ea1f87eda8628c7ddd8f77dbf1e72486bc7b47b","cross_cats_sorted":["math.AT","q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2016-01-07T21:15:41Z","title_canon_sha256":"da9d9b7d8fa798aeb89d338d0f2548d0f7462f0398760671eafb5abffbaec00a"},"schema_version":"1.0","source":{"id":"1601.01704","kind":"arxiv","version":2}},"canonical_sha256":"acc9b77d16e457e8815bfb17b15b2841fe8b03cafcd7e4a0de4ff6445fe85120","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acc9b77d16e457e8815bfb17b15b2841fe8b03cafcd7e4a0de4ff6445fe85120","first_computed_at":"2026-05-18T01:22:57.138455Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:57.138455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vqMFs7/TJdCGr+NZ2anYdvzuoE2HI2hrCGuhJl3K0OyHZHPjsDnxYMEQyomTIfSFr/gs/LDzlsQ4JMu9lIrZDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:57.138991Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.01704","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0634dea66d379a5968c0acac41f6b7fb38b7ad8063d2a293f822d1048834faf","sha256:385c41ec676d8e54b66048f80884938e3452e94f0ef9d41d7078d291dfac783d"],"state_sha256":"566db123ee44df80edca2fdb2d7d8ad85092b9de2800ec353c0c63821faf1990"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g9t8yXxAkNIo58FvKyvj0/hfNfhdVned+S9ltry6STlLcK78FYq4VK0j9a/EkcTemcK959JlMNK2X+nG/Q6/CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T23:00:55.545715Z","bundle_sha256":"e10955ce543fb92994efe8f111fe7dfd4cd2e03665ab5640c5a54e13d42451de"}}