{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LZRBAFZHUQZIYZCRXK4ZNI5I4H","short_pith_number":"pith:LZRBAFZH","canonical_record":{"source":{"id":"1611.02400","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-08T06:06:36Z","cross_cats_sorted":[],"title_canon_sha256":"c9aaa145eabda59991ca37bae49171b8e9e26c3e05789109992a48d1603d8a3f","abstract_canon_sha256":"667b7f725fd95bc4b1e1487cd2f61696cd118b33cb83918e760d051e23478978"},"schema_version":"1.0"},"canonical_sha256":"5e62101727a4328c6451bab996a3a8e1edec02ea8dbf2dad5d3655bc5df21c70","source":{"kind":"arxiv","id":"1611.02400","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02400","created_at":"2026-05-18T00:42:44Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02400v2","created_at":"2026-05-18T00:42:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02400","created_at":"2026-05-18T00:42:44Z"},{"alias_kind":"pith_short_12","alias_value":"LZRBAFZHUQZI","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LZRBAFZHUQZIYZCR","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LZRBAFZH","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LZRBAFZHUQZIYZCRXK4ZNI5I4H","target":"record","payload":{"canonical_record":{"source":{"id":"1611.02400","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-08T06:06:36Z","cross_cats_sorted":[],"title_canon_sha256":"c9aaa145eabda59991ca37bae49171b8e9e26c3e05789109992a48d1603d8a3f","abstract_canon_sha256":"667b7f725fd95bc4b1e1487cd2f61696cd118b33cb83918e760d051e23478978"},"schema_version":"1.0"},"canonical_sha256":"5e62101727a4328c6451bab996a3a8e1edec02ea8dbf2dad5d3655bc5df21c70","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:44.103143Z","signature_b64":"GrzSE6tD6tBHDUTFuAlZXH+K63zSqF+XYRSTcQ9WrXzZahMmegkvBohKpEazARvrhW5PXSLhWFcETmYoYalFAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e62101727a4328c6451bab996a3a8e1edec02ea8dbf2dad5d3655bc5df21c70","last_reissued_at":"2026-05-18T00:42:44.102489Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:44.102489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.02400","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-18T00:42:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"epExqMLn23u4osFQYvMSTRLr4hFGHFETN3ZB+jmMqw2yWTF6uLaSqQxQxnHgjawNGzlR6p545dU2Xf8lA6GfCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:53:15.999532Z"},"content_sha256":"cfceb56ca091fe3e8334f010ca10dc9f8d9dacbcb8710c6a0997a1db20cc48a7","schema_version":"1.0","event_id":"sha256:cfceb56ca091fe3e8334f010ca10dc9f8d9dacbcb8710c6a0997a1db20cc48a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LZRBAFZHUQZIYZCRXK4ZNI5I4H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Graph-Theoretic Approach to Multitasking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Biswadip Dey, Daniel Reichman, Igor Shinkar, Jonathan D. Cohen, Kayhan Ozcimder, Noga Alon, Sebastian Musslick, Tal Wagner, Tom Griffiths","submitted_at":"2016-11-08T06:06:36Z","abstract_excerpt":"A key feature of neural network architectures is their ability to support the simultaneous interaction among large numbers of units in the learning and processing of representations. However, how the richness of such interactions trades off against the ability of a network to simultaneously carry out multiple independent processes -- a salient limitation in many domains of human cognition -- remains largely unexplored. In this paper we use a graph-theoretic analysis of network architecture to address this question, where tasks are represented as edges in a bipartite graph $G=(A \\cup B, E)$. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02400","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-18T00:42:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pmda6lYyWBeWwIVTkySYYCeKPlPA57Y5DXH83eVNqiouOu2kIBOb2VhwZwK036J6ugybEzIsBsnFT1irlIuFAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:53:16.000233Z"},"content_sha256":"fe984e32a0ac8bd93eabeb4d51e6de64c3ac100b54c90601957992de7a56738e","schema_version":"1.0","event_id":"sha256:fe984e32a0ac8bd93eabeb4d51e6de64c3ac100b54c90601957992de7a56738e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LZRBAFZHUQZIYZCRXK4ZNI5I4H/bundle.json","state_url":"https://pith.science/pith/LZRBAFZHUQZIYZCRXK4ZNI5I4H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LZRBAFZHUQZIYZCRXK4ZNI5I4H/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-08T19:53:16Z","links":{"resolver":"https://pith.science/pith/LZRBAFZHUQZIYZCRXK4ZNI5I4H","bundle":"https://pith.science/pith/LZRBAFZHUQZIYZCRXK4ZNI5I4H/bundle.json","state":"https://pith.science/pith/LZRBAFZHUQZIYZCRXK4ZNI5I4H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LZRBAFZHUQZIYZCRXK4ZNI5I4H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LZRBAFZHUQZIYZCRXK4ZNI5I4H","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":"667b7f725fd95bc4b1e1487cd2f61696cd118b33cb83918e760d051e23478978","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-08T06:06:36Z","title_canon_sha256":"c9aaa145eabda59991ca37bae49171b8e9e26c3e05789109992a48d1603d8a3f"},"schema_version":"1.0","source":{"id":"1611.02400","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02400","created_at":"2026-05-18T00:42:44Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02400v2","created_at":"2026-05-18T00:42:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02400","created_at":"2026-05-18T00:42:44Z"},{"alias_kind":"pith_short_12","alias_value":"LZRBAFZHUQZI","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LZRBAFZHUQZIYZCR","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LZRBAFZH","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:fe984e32a0ac8bd93eabeb4d51e6de64c3ac100b54c90601957992de7a56738e","target":"graph","created_at":"2026-05-18T00:42:44Z","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":"A key feature of neural network architectures is their ability to support the simultaneous interaction among large numbers of units in the learning and processing of representations. However, how the richness of such interactions trades off against the ability of a network to simultaneously carry out multiple independent processes -- a salient limitation in many domains of human cognition -- remains largely unexplored. In this paper we use a graph-theoretic analysis of network architecture to address this question, where tasks are represented as edges in a bipartite graph $G=(A \\cup B, E)$. We","authors_text":"Biswadip Dey, Daniel Reichman, Igor Shinkar, Jonathan D. Cohen, Kayhan Ozcimder, Noga Alon, Sebastian Musslick, Tal Wagner, Tom Griffiths","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-08T06:06:36Z","title":"A Graph-Theoretic Approach to Multitasking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02400","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:cfceb56ca091fe3e8334f010ca10dc9f8d9dacbcb8710c6a0997a1db20cc48a7","target":"record","created_at":"2026-05-18T00:42:44Z","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":"667b7f725fd95bc4b1e1487cd2f61696cd118b33cb83918e760d051e23478978","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-08T06:06:36Z","title_canon_sha256":"c9aaa145eabda59991ca37bae49171b8e9e26c3e05789109992a48d1603d8a3f"},"schema_version":"1.0","source":{"id":"1611.02400","kind":"arxiv","version":2}},"canonical_sha256":"5e62101727a4328c6451bab996a3a8e1edec02ea8dbf2dad5d3655bc5df21c70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e62101727a4328c6451bab996a3a8e1edec02ea8dbf2dad5d3655bc5df21c70","first_computed_at":"2026-05-18T00:42:44.102489Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:44.102489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GrzSE6tD6tBHDUTFuAlZXH+K63zSqF+XYRSTcQ9WrXzZahMmegkvBohKpEazARvrhW5PXSLhWFcETmYoYalFAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:44.103143Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.02400","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cfceb56ca091fe3e8334f010ca10dc9f8d9dacbcb8710c6a0997a1db20cc48a7","sha256:fe984e32a0ac8bd93eabeb4d51e6de64c3ac100b54c90601957992de7a56738e"],"state_sha256":"4a9c0c3b02c623509e5ab07b559f3ac0fc2eb04b458eab69bd7d0833ff13b8fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nmRGS1w9zCGCmyVR87/O+56RmzZPomcuN9mP60JyNVgf56I5QNcvXQZuSnq4o+sYVMXY1Ih7kCLzH2xpX8XsCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:53:16.004410Z","bundle_sha256":"421a3f7079482a3cc5a956a8f7d20880c90cf1062cc2dbc32fb3b4a580d04ff9"}}