{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FV5JV2BQZ4NSIFH4VMB5GWA2ER","short_pith_number":"pith:FV5JV2BQ","schema_version":"1.0","canonical_sha256":"2d7a9ae830cf1b2414fcab03d3581a247e69a4f2bd018579fb05c5043a8b4d1b","source":{"kind":"arxiv","id":"1312.4333","version":1},"attestation_state":"computed","paper":{"title":"GLC actors, artificial chemical connectomes, topological issues and knots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT","math.LO"],"primary_cat":"cs.DC","authors_text":"Louis H. Kauffman, Marius Buliga","submitted_at":"2013-12-16T12:40:25Z","abstract_excerpt":"Based on graphic lambda calculus, we propose a program for a new model of asynchronous distributed computing, inspired from Hewitt Actor Model, as well as several investigation paths, concerning how one may graft lambda calculus and knot diagrammatics."},"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":"1312.4333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-16T12:40:25Z","cross_cats_sorted":["math.GT","math.LO"],"title_canon_sha256":"9b0b95d076dabc545240f3a03c665e34b48526c1453e714e76bd79ddcb9b1be8","abstract_canon_sha256":"a04603f04de361c62ac6ccc85708853706c3ea182623d75c54f152bdfeb0922e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:34.888600Z","signature_b64":"YQd+C5qLRlFDVglNmYVsnOFkgCU+GHO0kNhtjUD6ug4TUvFtYsDDCb4UHw0XrxoOoLyj6owUPR0brmSAlOfxDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d7a9ae830cf1b2414fcab03d3581a247e69a4f2bd018579fb05c5043a8b4d1b","last_reissued_at":"2026-05-18T03:04:34.887696Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:34.887696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GLC actors, artificial chemical connectomes, topological issues and knots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT","math.LO"],"primary_cat":"cs.DC","authors_text":"Louis H. Kauffman, Marius Buliga","submitted_at":"2013-12-16T12:40:25Z","abstract_excerpt":"Based on graphic lambda calculus, we propose a program for a new model of asynchronous distributed computing, inspired from Hewitt Actor Model, as well as several investigation paths, concerning how one may graft lambda calculus and knot diagrammatics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4333","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":"1312.4333","created_at":"2026-05-18T03:04:34.887864+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.4333v1","created_at":"2026-05-18T03:04:34.887864+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4333","created_at":"2026-05-18T03:04:34.887864+00:00"},{"alias_kind":"pith_short_12","alias_value":"FV5JV2BQZ4NS","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FV5JV2BQZ4NSIFH4","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FV5JV2BQ","created_at":"2026-05-18T12:27:45.050594+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/FV5JV2BQZ4NSIFH4VMB5GWA2ER","json":"https://pith.science/pith/FV5JV2BQZ4NSIFH4VMB5GWA2ER.json","graph_json":"https://pith.science/api/pith-number/FV5JV2BQZ4NSIFH4VMB5GWA2ER/graph.json","events_json":"https://pith.science/api/pith-number/FV5JV2BQZ4NSIFH4VMB5GWA2ER/events.json","paper":"https://pith.science/paper/FV5JV2BQ"},"agent_actions":{"view_html":"https://pith.science/pith/FV5JV2BQZ4NSIFH4VMB5GWA2ER","download_json":"https://pith.science/pith/FV5JV2BQZ4NSIFH4VMB5GWA2ER.json","view_paper":"https://pith.science/paper/FV5JV2BQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.4333&json=true","fetch_graph":"https://pith.science/api/pith-number/FV5JV2BQZ4NSIFH4VMB5GWA2ER/graph.json","fetch_events":"https://pith.science/api/pith-number/FV5JV2BQZ4NSIFH4VMB5GWA2ER/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FV5JV2BQZ4NSIFH4VMB5GWA2ER/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FV5JV2BQZ4NSIFH4VMB5GWA2ER/action/storage_attestation","attest_author":"https://pith.science/pith/FV5JV2BQZ4NSIFH4VMB5GWA2ER/action/author_attestation","sign_citation":"https://pith.science/pith/FV5JV2BQZ4NSIFH4VMB5GWA2ER/action/citation_signature","submit_replication":"https://pith.science/pith/FV5JV2BQZ4NSIFH4VMB5GWA2ER/action/replication_record"}},"created_at":"2026-05-18T03:04:34.887864+00:00","updated_at":"2026-05-18T03:04:34.887864+00:00"}