{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1998:3LAPAEQJHN2DPFFYLL5WQ4SAHW","short_pith_number":"pith:3LAPAEQJ","schema_version":"1.0","canonical_sha256":"dac0f012093b743794b85afb6872403d97a22873e1fbcfb478c451c99989b085","source":{"kind":"arxiv","id":"cond-mat/9803025","version":1},"attestation_state":"computed","paper":{"title":"Local Routing Algorithms Based on Potts Neural Networks","license":"","headline":"","cross_cats":["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":"1998-03-02T17:43:32Z","abstract_excerpt":"A feedback neural approach to static communication routing in asymmetric networks is presented, where a mean field formulation of the Bellman-Ford method for the single unicast problem is used as a common platform for developing algorithms for multiple unicast, multicast and multiple multicast problems. The appealing locality and update philosophy of the Bellman-Ford algorithm is inherited. For all problem types the objective is to minimize a total connection cost, defined as the sum of the individual costs of the involved arcs, subject to capacity constraints. The methods are evaluated for sy"},"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/9803025","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cond-mat.dis-nn","submitted_at":"1998-03-02T17:43:32Z","cross_cats_sorted":["hep-lat"],"title_canon_sha256":"9559a68f1949e32a144392d837f2990b2f4897db70b41d542c275374ba3bc106","abstract_canon_sha256":"b33c9471d8cce7f21697dde99734d17143d13b25b2c65e2c373bfa46e1aedead"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:20.071276Z","signature_b64":"EVatLmCA0csJ3Me1Kpq1PUtkgN3a9vJZdXnZuPfoqrjUwbmOnkekoN+sSQ7HJwhwhgIgUVNLw9rc+DeGZZZYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dac0f012093b743794b85afb6872403d97a22873e1fbcfb478c451c99989b085","last_reissued_at":"2026-05-18T01:09:20.070808Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:20.070808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Routing Algorithms Based on Potts Neural Networks","license":"","headline":"","cross_cats":["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":"1998-03-02T17:43:32Z","abstract_excerpt":"A feedback neural approach to static communication routing in asymmetric networks is presented, where a mean field formulation of the Bellman-Ford method for the single unicast problem is used as a common platform for developing algorithms for multiple unicast, multicast and multiple multicast problems. The appealing locality and update philosophy of the Bellman-Ford algorithm is inherited. For all problem types the objective is to minimize a total connection cost, defined as the sum of the individual costs of the involved arcs, subject to capacity constraints. The methods are evaluated for sy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/9803025","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/9803025","created_at":"2026-05-18T01:09:20.070876+00:00"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/9803025v1","created_at":"2026-05-18T01:09:20.070876+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/9803025","created_at":"2026-05-18T01:09:20.070876+00:00"},{"alias_kind":"pith_short_12","alias_value":"3LAPAEQJHN2D","created_at":"2026-05-18T12:25:49.038998+00:00"},{"alias_kind":"pith_short_16","alias_value":"3LAPAEQJHN2DPFFY","created_at":"2026-05-18T12:25:49.038998+00:00"},{"alias_kind":"pith_short_8","alias_value":"3LAPAEQJ","created_at":"2026-05-18T12:25:49.038998+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/3LAPAEQJHN2DPFFYLL5WQ4SAHW","json":"https://pith.science/pith/3LAPAEQJHN2DPFFYLL5WQ4SAHW.json","graph_json":"https://pith.science/api/pith-number/3LAPAEQJHN2DPFFYLL5WQ4SAHW/graph.json","events_json":"https://pith.science/api/pith-number/3LAPAEQJHN2DPFFYLL5WQ4SAHW/events.json","paper":"https://pith.science/paper/3LAPAEQJ"},"agent_actions":{"view_html":"https://pith.science/pith/3LAPAEQJHN2DPFFYLL5WQ4SAHW","download_json":"https://pith.science/pith/3LAPAEQJHN2DPFFYLL5WQ4SAHW.json","view_paper":"https://pith.science/paper/3LAPAEQJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cond-mat/9803025&json=true","fetch_graph":"https://pith.science/api/pith-number/3LAPAEQJHN2DPFFYLL5WQ4SAHW/graph.json","fetch_events":"https://pith.science/api/pith-number/3LAPAEQJHN2DPFFYLL5WQ4SAHW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3LAPAEQJHN2DPFFYLL5WQ4SAHW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3LAPAEQJHN2DPFFYLL5WQ4SAHW/action/storage_attestation","attest_author":"https://pith.science/pith/3LAPAEQJHN2DPFFYLL5WQ4SAHW/action/author_attestation","sign_citation":"https://pith.science/pith/3LAPAEQJHN2DPFFYLL5WQ4SAHW/action/citation_signature","submit_replication":"https://pith.science/pith/3LAPAEQJHN2DPFFYLL5WQ4SAHW/action/replication_record"}},"created_at":"2026-05-18T01:09:20.070876+00:00","updated_at":"2026-05-18T01:09:20.070876+00:00"}