{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ODXFWIPOTUC2MGL3QKUJCD4NKD","short_pith_number":"pith:ODXFWIPO","schema_version":"1.0","canonical_sha256":"70ee5b21ee9d05a6197b82a8910f8d50efcf117ef68cdc342b11740aaf8ac9d7","source":{"kind":"arxiv","id":"1709.03000","version":3},"attestation_state":"computed","paper":{"title":"Network constraints on learnability of probabilistic motor sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.NC","authors_text":"Ari E. Kahn, Danielle S. Bassett, Elisabeth A. Karuza, Jean M. Vettel","submitted_at":"2017-09-09T20:13:18Z","abstract_excerpt":"Human learners are adept at grasping the complex relationships underlying incoming sequential input. In the present work, we formalize complex relationships as graph structures derived from temporal associations in motor sequences. Next, we explore the extent to which learners are sensitive to key variations in the topological properties inherent to those graph structures. Participants performed a probabilistic motor sequence task in which the order of button presses was determined by the traversal of graphs with modular, lattice-like, or random organization. Graph nodes each represented a uni"},"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":"1709.03000","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2017-09-09T20:13:18Z","cross_cats_sorted":[],"title_canon_sha256":"52216208831dfb170601c99b36ebd651e3f2010b48b471745adf2ee1baf0c8bc","abstract_canon_sha256":"7b85274cdba941286df3e1763b49f130d7d2575cb52291ef87dcf0a88c1e5506"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:02.028739Z","signature_b64":"cpMxE+rnV4o0MNcNlj2SActJLdCvX8kY3/T50pH8Io5o7yw4yzpqY9YM3pCbHRaUsp9vs/3aBSue0dr3wcl9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70ee5b21ee9d05a6197b82a8910f8d50efcf117ef68cdc342b11740aaf8ac9d7","last_reissued_at":"2026-05-18T00:02:02.028270Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:02.028270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network constraints on learnability of probabilistic motor sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.NC","authors_text":"Ari E. Kahn, Danielle S. Bassett, Elisabeth A. Karuza, Jean M. Vettel","submitted_at":"2017-09-09T20:13:18Z","abstract_excerpt":"Human learners are adept at grasping the complex relationships underlying incoming sequential input. In the present work, we formalize complex relationships as graph structures derived from temporal associations in motor sequences. Next, we explore the extent to which learners are sensitive to key variations in the topological properties inherent to those graph structures. Participants performed a probabilistic motor sequence task in which the order of button presses was determined by the traversal of graphs with modular, lattice-like, or random organization. Graph nodes each represented a uni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03000","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":""},"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":"1709.03000","created_at":"2026-05-18T00:02:02.028356+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.03000v3","created_at":"2026-05-18T00:02:02.028356+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03000","created_at":"2026-05-18T00:02:02.028356+00:00"},{"alias_kind":"pith_short_12","alias_value":"ODXFWIPOTUC2","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"ODXFWIPOTUC2MGL3","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"ODXFWIPO","created_at":"2026-05-18T12:31:34.259226+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/ODXFWIPOTUC2MGL3QKUJCD4NKD","json":"https://pith.science/pith/ODXFWIPOTUC2MGL3QKUJCD4NKD.json","graph_json":"https://pith.science/api/pith-number/ODXFWIPOTUC2MGL3QKUJCD4NKD/graph.json","events_json":"https://pith.science/api/pith-number/ODXFWIPOTUC2MGL3QKUJCD4NKD/events.json","paper":"https://pith.science/paper/ODXFWIPO"},"agent_actions":{"view_html":"https://pith.science/pith/ODXFWIPOTUC2MGL3QKUJCD4NKD","download_json":"https://pith.science/pith/ODXFWIPOTUC2MGL3QKUJCD4NKD.json","view_paper":"https://pith.science/paper/ODXFWIPO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.03000&json=true","fetch_graph":"https://pith.science/api/pith-number/ODXFWIPOTUC2MGL3QKUJCD4NKD/graph.json","fetch_events":"https://pith.science/api/pith-number/ODXFWIPOTUC2MGL3QKUJCD4NKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ODXFWIPOTUC2MGL3QKUJCD4NKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ODXFWIPOTUC2MGL3QKUJCD4NKD/action/storage_attestation","attest_author":"https://pith.science/pith/ODXFWIPOTUC2MGL3QKUJCD4NKD/action/author_attestation","sign_citation":"https://pith.science/pith/ODXFWIPOTUC2MGL3QKUJCD4NKD/action/citation_signature","submit_replication":"https://pith.science/pith/ODXFWIPOTUC2MGL3QKUJCD4NKD/action/replication_record"}},"created_at":"2026-05-18T00:02:02.028356+00:00","updated_at":"2026-05-18T00:02:02.028356+00:00"}