{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1997:DDYO2KI2SDUGGLFRAOJT5ROGHY","short_pith_number":"pith:DDYO2KI2","schema_version":"1.0","canonical_sha256":"18f0ed291a90e8632cb103933ec5c63e2c1f1ee8569261856cdea03b0896a452","source":{"kind":"arxiv","id":"cond-mat/9703191","version":1},"attestation_state":"computed","paper":{"title":"A Potts Neuron Approach to Communication Routing","license":"","headline":"","cross_cats":["cs.NI","hep-lat"],"primary_cat":"cond-mat.dis-nn","authors_text":"B. S\\\"oderberg (Theoretical Physics, C. Peterson, J. H\\\"akkinen, Lund U.), M. Lagerholm","submitted_at":"1997-03-21T09:29:39Z","abstract_excerpt":"A feedback neural network approach to communication routing problems is developed with emphasis on Multiple Shortest Path problems, with several requests for transmissions between distinct start- and endnodes. The basic ingredients are a set of Potts neurons for each request, with interactions designed to minimize path lengths and to prevent overloading of network arcs. The topological nature of the problem is conveniently handled using a propagator matrix approach. Although the constraints are global, the algorithmic steps are based entirely on local information, facilitating distributed impl"},"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":"cond-mat/9703191","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cond-mat.dis-nn","submitted_at":"1997-03-21T09:29:39Z","cross_cats_sorted":["cs.NI","hep-lat"],"title_canon_sha256":"1f499b79bfca8e550a7c8858488bc5b4d6ff677cd86449778f5f13f15b67f506","abstract_canon_sha256":"58d3634d4c8bb6564691fa15cd61431f867f72e3c5d4a5c64aea1851c6bf13c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:20.295943Z","signature_b64":"yNpuHCwnQRZ4HIW02bHY1zBRQ2yBJ0UHWKdZeuWTr0eRE6azHZnT+aXkHq/c/AX60c84hFtjtkN3bf4U/P0NCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18f0ed291a90e8632cb103933ec5c63e2c1f1ee8569261856cdea03b0896a452","last_reissued_at":"2026-05-18T01:09:20.295400Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:20.295400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Potts Neuron Approach to Communication Routing","license":"","headline":"","cross_cats":["cs.NI","hep-lat"],"primary_cat":"cond-mat.dis-nn","authors_text":"B. S\\\"oderberg (Theoretical Physics, C. Peterson, J. H\\\"akkinen, Lund U.), M. Lagerholm","submitted_at":"1997-03-21T09:29:39Z","abstract_excerpt":"A feedback neural network approach to communication routing problems is developed with emphasis on Multiple Shortest Path problems, with several requests for transmissions between distinct start- and endnodes. The basic ingredients are a set of Potts neurons for each request, with interactions designed to minimize path lengths and to prevent overloading of network arcs. The topological nature of the problem is conveniently handled using a propagator matrix approach. Although the constraints are global, the algorithmic steps are based entirely on local information, facilitating distributed impl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/9703191","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":"cond-mat/9703191","created_at":"2026-05-18T01:09:20.295496+00:00"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/9703191v1","created_at":"2026-05-18T01:09:20.295496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/9703191","created_at":"2026-05-18T01:09:20.295496+00:00"},{"alias_kind":"pith_short_12","alias_value":"DDYO2KI2SDUG","created_at":"2026-05-18T12:25:48.327863+00:00"},{"alias_kind":"pith_short_16","alias_value":"DDYO2KI2SDUGGLFR","created_at":"2026-05-18T12:25:48.327863+00:00"},{"alias_kind":"pith_short_8","alias_value":"DDYO2KI2","created_at":"2026-05-18T12:25:48.327863+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/DDYO2KI2SDUGGLFRAOJT5ROGHY","json":"https://pith.science/pith/DDYO2KI2SDUGGLFRAOJT5ROGHY.json","graph_json":"https://pith.science/api/pith-number/DDYO2KI2SDUGGLFRAOJT5ROGHY/graph.json","events_json":"https://pith.science/api/pith-number/DDYO2KI2SDUGGLFRAOJT5ROGHY/events.json","paper":"https://pith.science/paper/DDYO2KI2"},"agent_actions":{"view_html":"https://pith.science/pith/DDYO2KI2SDUGGLFRAOJT5ROGHY","download_json":"https://pith.science/pith/DDYO2KI2SDUGGLFRAOJT5ROGHY.json","view_paper":"https://pith.science/paper/DDYO2KI2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cond-mat/9703191&json=true","fetch_graph":"https://pith.science/api/pith-number/DDYO2KI2SDUGGLFRAOJT5ROGHY/graph.json","fetch_events":"https://pith.science/api/pith-number/DDYO2KI2SDUGGLFRAOJT5ROGHY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DDYO2KI2SDUGGLFRAOJT5ROGHY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DDYO2KI2SDUGGLFRAOJT5ROGHY/action/storage_attestation","attest_author":"https://pith.science/pith/DDYO2KI2SDUGGLFRAOJT5ROGHY/action/author_attestation","sign_citation":"https://pith.science/pith/DDYO2KI2SDUGGLFRAOJT5ROGHY/action/citation_signature","submit_replication":"https://pith.science/pith/DDYO2KI2SDUGGLFRAOJT5ROGHY/action/replication_record"}},"created_at":"2026-05-18T01:09:20.295496+00:00","updated_at":"2026-05-18T01:09:20.295496+00:00"}