{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:1998:3LAPAEQJHN2DPFFYLL5WQ4SAHW","short_pith_number":"pith:3LAPAEQJ","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"},"canonical_sha256":"dac0f012093b743794b85afb6872403d97a22873e1fbcfb478c451c99989b085","source":{"kind":"arxiv","id":"cond-mat/9803025","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cond-mat/9803025","created_at":"2026-05-18T01:09:20Z"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/9803025v1","created_at":"2026-05-18T01:09:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/9803025","created_at":"2026-05-18T01:09:20Z"},{"alias_kind":"pith_short_12","alias_value":"3LAPAEQJHN2D","created_at":"2026-05-18T12:25:49Z"},{"alias_kind":"pith_short_16","alias_value":"3LAPAEQJHN2DPFFY","created_at":"2026-05-18T12:25:49Z"},{"alias_kind":"pith_short_8","alias_value":"3LAPAEQJ","created_at":"2026-05-18T12:25:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:1998:3LAPAEQJHN2DPFFYLL5WQ4SAHW","target":"record","payload":{"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"},"canonical_sha256":"dac0f012093b743794b85afb6872403d97a22873e1fbcfb478c451c99989b085","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"},"source_kind":"arxiv","source_id":"cond-mat/9803025","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:09:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UL3eYkgqTBGGt3KVs84+M6QZzm3lgRqjW+oU8j3W5Fd3MnH8qPNOb1KdRNZekm9dk6FbovhM6Agp+KOZb45gAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:11:30.256815Z"},"content_sha256":"8b12c77b8a6a522b2529163e0e449bfc0100c7272f0fa0b871d2f99f11f692db","schema_version":"1.0","event_id":"sha256:8b12c77b8a6a522b2529163e0e449bfc0100c7272f0fa0b871d2f99f11f692db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:1998:3LAPAEQJHN2DPFFYLL5WQ4SAHW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:09:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vRS0zpqvjpsDzbrLwmA+LTVotwK5izDbPM1dgkASGMqNxtDOcC/GxkPc8lzd/IRrVuPvAwW+2hgaEOoL9ftoDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:11:30.257554Z"},"content_sha256":"9a48bcffadd153e505985430d6b18865ae521c172cefb099e2f7a32bededd1e0","schema_version":"1.0","event_id":"sha256:9a48bcffadd153e505985430d6b18865ae521c172cefb099e2f7a32bededd1e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3LAPAEQJHN2DPFFYLL5WQ4SAHW/bundle.json","state_url":"https://pith.science/pith/3LAPAEQJHN2DPFFYLL5WQ4SAHW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3LAPAEQJHN2DPFFYLL5WQ4SAHW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T05:11:30Z","links":{"resolver":"https://pith.science/pith/3LAPAEQJHN2DPFFYLL5WQ4SAHW","bundle":"https://pith.science/pith/3LAPAEQJHN2DPFFYLL5WQ4SAHW/bundle.json","state":"https://pith.science/pith/3LAPAEQJHN2DPFFYLL5WQ4SAHW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3LAPAEQJHN2DPFFYLL5WQ4SAHW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1998:3LAPAEQJHN2DPFFYLL5WQ4SAHW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b33c9471d8cce7f21697dde99734d17143d13b25b2c65e2c373bfa46e1aedead","cross_cats_sorted":["hep-lat"],"license":"","primary_cat":"cond-mat.dis-nn","submitted_at":"1998-03-02T17:43:32Z","title_canon_sha256":"9559a68f1949e32a144392d837f2990b2f4897db70b41d542c275374ba3bc106"},"schema_version":"1.0","source":{"id":"cond-mat/9803025","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cond-mat/9803025","created_at":"2026-05-18T01:09:20Z"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/9803025v1","created_at":"2026-05-18T01:09:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/9803025","created_at":"2026-05-18T01:09:20Z"},{"alias_kind":"pith_short_12","alias_value":"3LAPAEQJHN2D","created_at":"2026-05-18T12:25:49Z"},{"alias_kind":"pith_short_16","alias_value":"3LAPAEQJHN2DPFFY","created_at":"2026-05-18T12:25:49Z"},{"alias_kind":"pith_short_8","alias_value":"3LAPAEQJ","created_at":"2026-05-18T12:25:49Z"}],"graph_snapshots":[{"event_id":"sha256:9a48bcffadd153e505985430d6b18865ae521c172cefb099e2f7a32bededd1e0","target":"graph","created_at":"2026-05-18T01:09:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"B. S\\\"oderberg (Theoretical Physics, C. Peterson, J. H\\\"akkinen, Lund U.), M. Lagerholm","cross_cats":["hep-lat"],"headline":"","license":"","primary_cat":"cond-mat.dis-nn","submitted_at":"1998-03-02T17:43:32Z","title":"Local Routing Algorithms Based on Potts Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/9803025","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8b12c77b8a6a522b2529163e0e449bfc0100c7272f0fa0b871d2f99f11f692db","target":"record","created_at":"2026-05-18T01:09:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b33c9471d8cce7f21697dde99734d17143d13b25b2c65e2c373bfa46e1aedead","cross_cats_sorted":["hep-lat"],"license":"","primary_cat":"cond-mat.dis-nn","submitted_at":"1998-03-02T17:43:32Z","title_canon_sha256":"9559a68f1949e32a144392d837f2990b2f4897db70b41d542c275374ba3bc106"},"schema_version":"1.0","source":{"id":"cond-mat/9803025","kind":"arxiv","version":1}},"canonical_sha256":"dac0f012093b743794b85afb6872403d97a22873e1fbcfb478c451c99989b085","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dac0f012093b743794b85afb6872403d97a22873e1fbcfb478c451c99989b085","first_computed_at":"2026-05-18T01:09:20.070808Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:20.070808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EVatLmCA0csJ3Me1Kpq1PUtkgN3a9vJZdXnZuPfoqrjUwbmOnkekoN+sSQ7HJwhwhgIgUVNLw9rc+DeGZZZYDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:20.071276Z","signed_message":"canonical_sha256_bytes"},"source_id":"cond-mat/9803025","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b12c77b8a6a522b2529163e0e449bfc0100c7272f0fa0b871d2f99f11f692db","sha256:9a48bcffadd153e505985430d6b18865ae521c172cefb099e2f7a32bededd1e0"],"state_sha256":"84caafeafac5cdd696a83c47c4d7cf89571e13e8d18da97cae8314fb19eaaf72"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7alL/TUPlzSZs/qXk9vgr86fRw1YBjz3cId+RcVhxXbgrznPZqGvTj6DjWtZdzEqDJxp+n6olTWz73cDjErJAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:11:30.261409Z","bundle_sha256":"0a48e999501397a853ab496c2ea29c64a64b667c49681c13be1762ded7c428b0"}}