{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YADY2AS6POR23HSYMTTTQF2DQT","short_pith_number":"pith:YADY2AS6","schema_version":"1.0","canonical_sha256":"c0078d025e7ba3ad9e5864e738174384f5dee4eb16f7ffb7ffaae819f317117b","source":{"kind":"arxiv","id":"1707.08321","version":5},"attestation_state":"computed","paper":{"title":"Props in Network Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.CT","authors_text":"Brandon Coya, Franciscus Rebro, John C. Baez","submitted_at":"2017-07-26T08:45:47Z","abstract_excerpt":"Long before the invention of Feynman diagrams, engineers were using similar diagrams to reason about electrical circuits and more general networks containing mechanical, hydraulic, thermodynamic and chemical components. We can formalize this reasoning using props: that is, strict symmetric monoidal categories where the objects are natural numbers, with the tensor product of objects given by addition. In this approach, each kind of network corresponds to a prop, and each network of this kind is a morphism in that prop. A network with $m$ inputs and $n$ outputs is a morphism from $m$ to $n$, put"},"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":"1707.08321","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CT","submitted_at":"2017-07-26T08:45:47Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"2e079f2d6db4574dbf9fd910f99ac023c3c3bcbb91fedac3083cc178009b4d5e","abstract_canon_sha256":"14e7ed363128a1c1533e7ad50e77e08a69eba9ee1de2175efbd2489a303ad5f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:13.626761Z","signature_b64":"JGjflOlbmGXuigMrkl+8DwHZyFtUVsCSaLruHT13xjUmI2iCHumOhqrIDCygnQL3B3JTNWWlhh8YHqVMGgjCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0078d025e7ba3ad9e5864e738174384f5dee4eb16f7ffb7ffaae819f317117b","last_reissued_at":"2026-05-18T00:00:13.626253Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:13.626253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Props in Network Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.CT","authors_text":"Brandon Coya, Franciscus Rebro, John C. Baez","submitted_at":"2017-07-26T08:45:47Z","abstract_excerpt":"Long before the invention of Feynman diagrams, engineers were using similar diagrams to reason about electrical circuits and more general networks containing mechanical, hydraulic, thermodynamic and chemical components. We can formalize this reasoning using props: that is, strict symmetric monoidal categories where the objects are natural numbers, with the tensor product of objects given by addition. In this approach, each kind of network corresponds to a prop, and each network of this kind is a morphism in that prop. A network with $m$ inputs and $n$ outputs is a morphism from $m$ to $n$, put"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08321","kind":"arxiv","version":5},"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":"1707.08321","created_at":"2026-05-18T00:00:13.626339+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.08321v5","created_at":"2026-05-18T00:00:13.626339+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08321","created_at":"2026-05-18T00:00:13.626339+00:00"},{"alias_kind":"pith_short_12","alias_value":"YADY2AS6POR2","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YADY2AS6POR23HSY","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YADY2AS6","created_at":"2026-05-18T12:31:56.362134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2512.07240","citing_title":"A Diagrammatic Basis for Computer Programming","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2512.07240","citing_title":"A Diagrammatic Basis for Computer Programming","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YADY2AS6POR23HSYMTTTQF2DQT","json":"https://pith.science/pith/YADY2AS6POR23HSYMTTTQF2DQT.json","graph_json":"https://pith.science/api/pith-number/YADY2AS6POR23HSYMTTTQF2DQT/graph.json","events_json":"https://pith.science/api/pith-number/YADY2AS6POR23HSYMTTTQF2DQT/events.json","paper":"https://pith.science/paper/YADY2AS6"},"agent_actions":{"view_html":"https://pith.science/pith/YADY2AS6POR23HSYMTTTQF2DQT","download_json":"https://pith.science/pith/YADY2AS6POR23HSYMTTTQF2DQT.json","view_paper":"https://pith.science/paper/YADY2AS6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.08321&json=true","fetch_graph":"https://pith.science/api/pith-number/YADY2AS6POR23HSYMTTTQF2DQT/graph.json","fetch_events":"https://pith.science/api/pith-number/YADY2AS6POR23HSYMTTTQF2DQT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YADY2AS6POR23HSYMTTTQF2DQT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YADY2AS6POR23HSYMTTTQF2DQT/action/storage_attestation","attest_author":"https://pith.science/pith/YADY2AS6POR23HSYMTTTQF2DQT/action/author_attestation","sign_citation":"https://pith.science/pith/YADY2AS6POR23HSYMTTTQF2DQT/action/citation_signature","submit_replication":"https://pith.science/pith/YADY2AS6POR23HSYMTTTQF2DQT/action/replication_record"}},"created_at":"2026-05-18T00:00:13.626339+00:00","updated_at":"2026-05-18T00:00:13.626339+00:00"}