{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VBSQX4HFJH5EDNXY4F3K2YVGZJ","short_pith_number":"pith:VBSQX4HF","schema_version":"1.0","canonical_sha256":"a8650bf0e549fa41b6f8e176ad62a6ca655e72e77f1b86b98e3cc11d57accba3","source":{"kind":"arxiv","id":"1307.6894","version":1},"attestation_state":"computed","paper":{"title":"The operad of temporal wiring diagrams: formalizing a graphical language for discrete-time processes","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.PL","q-bio.NC"],"primary_cat":"math.CT","authors_text":"David I. Spivak, Dylan Rupel","submitted_at":"2013-07-25T23:33:24Z","abstract_excerpt":"We investigate the hierarchical structure of processes using the mathematical theory of operads. Information or material enters a given process as a stream of inputs, and the process converts it to a stream of outputs. Output streams can then be supplied to other processes in an organized manner, and the resulting system of interconnected processes can itself be considered a macro process. To model the inherent structure in this kind of system, we define an operad $\\mathcal{W}$ of black boxes and directed wiring diagrams, and we define a $\\mathcal{W}$-algebra $\\mathcal{P}$ of processes (which "},"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":"1307.6894","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CT","submitted_at":"2013-07-25T23:33:24Z","cross_cats_sorted":["cs.PL","q-bio.NC"],"title_canon_sha256":"58357f6a24b2a1ffcba73be4d10f2662ebc67c4357a0e553cb6c6cce6f396a03","abstract_canon_sha256":"88ae4a4ae4fa7bae90f23c0ee03ac5ae713684875b26aa4fed2f0beb9d9f1aba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:33.502603Z","signature_b64":"ArD+GGFmF7LBxGy34JfzPgArZ8jpWR57j/p5ZrxrhOmHAchvQMf3SMRC/RDZ8aeyKRRGuIxBWgx/aoexL6H7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8650bf0e549fa41b6f8e176ad62a6ca655e72e77f1b86b98e3cc11d57accba3","last_reissued_at":"2026-05-18T03:17:33.501976Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:33.501976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The operad of temporal wiring diagrams: formalizing a graphical language for discrete-time processes","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.PL","q-bio.NC"],"primary_cat":"math.CT","authors_text":"David I. Spivak, Dylan Rupel","submitted_at":"2013-07-25T23:33:24Z","abstract_excerpt":"We investigate the hierarchical structure of processes using the mathematical theory of operads. Information or material enters a given process as a stream of inputs, and the process converts it to a stream of outputs. Output streams can then be supplied to other processes in an organized manner, and the resulting system of interconnected processes can itself be considered a macro process. To model the inherent structure in this kind of system, we define an operad $\\mathcal{W}$ of black boxes and directed wiring diagrams, and we define a $\\mathcal{W}$-algebra $\\mathcal{P}$ of processes (which "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6894","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.6894","created_at":"2026-05-18T03:17:33.502075+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.6894v1","created_at":"2026-05-18T03:17:33.502075+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6894","created_at":"2026-05-18T03:17:33.502075+00:00"},{"alias_kind":"pith_short_12","alias_value":"VBSQX4HFJH5E","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VBSQX4HFJH5EDNXY","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VBSQX4HF","created_at":"2026-05-18T12:28:04.890932+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.03017","citing_title":"Compositionality of Lyapunov functions via assume-guarantee reasoning","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2604.04495","citing_title":"Kleisli semantics and hypergraph composition for Greimasian narrative programs","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VBSQX4HFJH5EDNXY4F3K2YVGZJ","json":"https://pith.science/pith/VBSQX4HFJH5EDNXY4F3K2YVGZJ.json","graph_json":"https://pith.science/api/pith-number/VBSQX4HFJH5EDNXY4F3K2YVGZJ/graph.json","events_json":"https://pith.science/api/pith-number/VBSQX4HFJH5EDNXY4F3K2YVGZJ/events.json","paper":"https://pith.science/paper/VBSQX4HF"},"agent_actions":{"view_html":"https://pith.science/pith/VBSQX4HFJH5EDNXY4F3K2YVGZJ","download_json":"https://pith.science/pith/VBSQX4HFJH5EDNXY4F3K2YVGZJ.json","view_paper":"https://pith.science/paper/VBSQX4HF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.6894&json=true","fetch_graph":"https://pith.science/api/pith-number/VBSQX4HFJH5EDNXY4F3K2YVGZJ/graph.json","fetch_events":"https://pith.science/api/pith-number/VBSQX4HFJH5EDNXY4F3K2YVGZJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VBSQX4HFJH5EDNXY4F3K2YVGZJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VBSQX4HFJH5EDNXY4F3K2YVGZJ/action/storage_attestation","attest_author":"https://pith.science/pith/VBSQX4HFJH5EDNXY4F3K2YVGZJ/action/author_attestation","sign_citation":"https://pith.science/pith/VBSQX4HFJH5EDNXY4F3K2YVGZJ/action/citation_signature","submit_replication":"https://pith.science/pith/VBSQX4HFJH5EDNXY4F3K2YVGZJ/action/replication_record"}},"created_at":"2026-05-18T03:17:33.502075+00:00","updated_at":"2026-05-18T03:17:33.502075+00:00"}