{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:FOGHCVVWDELW6QNU4XE6A6D3V5","short_pith_number":"pith:FOGHCVVW","schema_version":"1.0","canonical_sha256":"2b8c7156b619176f41b4e5c9e0787baf593925617b5750447f6716960e19d006","source":{"kind":"arxiv","id":"1202.6526","version":3},"attestation_state":"computed","paper":{"title":"State Concentration Exponent as a Measure of Quickness in Kauffman-type Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["nlin.AO"],"primary_cat":"cond-mat.dis-nn","authors_text":"Hiroyasu Ando, Naoki Masuda, Shun-ichi Amari, Taro Toyoizumi","submitted_at":"2012-02-29T12:14:00Z","abstract_excerpt":"We study the dynamics of randomly connected networks composed of binary Boolean elements and those composed of binary majority vote elements. We elucidate their differences in both sparsely and densely connected cases. The quickness of large network dynamics is usually quantified by the length of transient paths, an analytically intractable measure. For discrete-time dynamics of networks of binary elements, we address this dilemma with an alternative unified framework by using a concept termed state concentration, defined as the exponent of the average number of t-step ancestors in state trans"},"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":"1202.6526","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2012-02-29T12:14:00Z","cross_cats_sorted":["nlin.AO"],"title_canon_sha256":"c5453a2f77f1d0a61a98931d976a2b4feeba5e2fa686d9ca1aaf1a77efb1ec1c","abstract_canon_sha256":"466bab6c5e2b62c87fee5e06ef3c307f55ed9c78f7271016a3a3bcf2bae6a01b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:54.297911Z","signature_b64":"W/ki5mlFLmvJYNXxAtzS+5D7L3Ec2Qykn11CKs5PdexeKBItpkdJYHV3Amb5wzObrwEFSMHuqRvh69SUoqysCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b8c7156b619176f41b4e5c9e0787baf593925617b5750447f6716960e19d006","last_reissued_at":"2026-05-18T03:31:54.297166Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:54.297166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"State Concentration Exponent as a Measure of Quickness in Kauffman-type Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["nlin.AO"],"primary_cat":"cond-mat.dis-nn","authors_text":"Hiroyasu Ando, Naoki Masuda, Shun-ichi Amari, Taro Toyoizumi","submitted_at":"2012-02-29T12:14:00Z","abstract_excerpt":"We study the dynamics of randomly connected networks composed of binary Boolean elements and those composed of binary majority vote elements. We elucidate their differences in both sparsely and densely connected cases. The quickness of large network dynamics is usually quantified by the length of transient paths, an analytically intractable measure. For discrete-time dynamics of networks of binary elements, we address this dilemma with an alternative unified framework by using a concept termed state concentration, defined as the exponent of the average number of t-step ancestors in state trans"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6526","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":"1202.6526","created_at":"2026-05-18T03:31:54.297264+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.6526v3","created_at":"2026-05-18T03:31:54.297264+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6526","created_at":"2026-05-18T03:31:54.297264+00:00"},{"alias_kind":"pith_short_12","alias_value":"FOGHCVVWDELW","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"FOGHCVVWDELW6QNU","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"FOGHCVVW","created_at":"2026-05-18T12:27:06.952714+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/FOGHCVVWDELW6QNU4XE6A6D3V5","json":"https://pith.science/pith/FOGHCVVWDELW6QNU4XE6A6D3V5.json","graph_json":"https://pith.science/api/pith-number/FOGHCVVWDELW6QNU4XE6A6D3V5/graph.json","events_json":"https://pith.science/api/pith-number/FOGHCVVWDELW6QNU4XE6A6D3V5/events.json","paper":"https://pith.science/paper/FOGHCVVW"},"agent_actions":{"view_html":"https://pith.science/pith/FOGHCVVWDELW6QNU4XE6A6D3V5","download_json":"https://pith.science/pith/FOGHCVVWDELW6QNU4XE6A6D3V5.json","view_paper":"https://pith.science/paper/FOGHCVVW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.6526&json=true","fetch_graph":"https://pith.science/api/pith-number/FOGHCVVWDELW6QNU4XE6A6D3V5/graph.json","fetch_events":"https://pith.science/api/pith-number/FOGHCVVWDELW6QNU4XE6A6D3V5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FOGHCVVWDELW6QNU4XE6A6D3V5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FOGHCVVWDELW6QNU4XE6A6D3V5/action/storage_attestation","attest_author":"https://pith.science/pith/FOGHCVVWDELW6QNU4XE6A6D3V5/action/author_attestation","sign_citation":"https://pith.science/pith/FOGHCVVWDELW6QNU4XE6A6D3V5/action/citation_signature","submit_replication":"https://pith.science/pith/FOGHCVVWDELW6QNU4XE6A6D3V5/action/replication_record"}},"created_at":"2026-05-18T03:31:54.297264+00:00","updated_at":"2026-05-18T03:31:54.297264+00:00"}