{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:4MHNF6FRBDAP4XFNXFGHIN5YQK","short_pith_number":"pith:4MHNF6FR","canonical_record":{"source":{"id":"0906.0115","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.AO","submitted_at":"2009-05-30T21:44:28Z","cross_cats_sorted":["nlin.PS"],"title_canon_sha256":"3ea684426ddadc5aeeefdd3932e461ea90300edb51c9822c6ca2927c1cc0c612","abstract_canon_sha256":"d08b6de7fdf524ef97ea0a922248901bfe20678ba417045ca3b482de8f9c1972"},"schema_version":"1.0"},"canonical_sha256":"e30ed2f8b108c0fe5cadb94c7437b882975df309bfc65c7c8110f9c9c6f7c002","source":{"kind":"arxiv","id":"0906.0115","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.0115","created_at":"2026-05-18T02:13:30Z"},{"alias_kind":"arxiv_version","alias_value":"0906.0115v1","created_at":"2026-05-18T02:13:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.0115","created_at":"2026-05-18T02:13:30Z"},{"alias_kind":"pith_short_12","alias_value":"4MHNF6FRBDAP","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"4MHNF6FRBDAP4XFN","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"4MHNF6FR","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:4MHNF6FRBDAP4XFNXFGHIN5YQK","target":"record","payload":{"canonical_record":{"source":{"id":"0906.0115","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.AO","submitted_at":"2009-05-30T21:44:28Z","cross_cats_sorted":["nlin.PS"],"title_canon_sha256":"3ea684426ddadc5aeeefdd3932e461ea90300edb51c9822c6ca2927c1cc0c612","abstract_canon_sha256":"d08b6de7fdf524ef97ea0a922248901bfe20678ba417045ca3b482de8f9c1972"},"schema_version":"1.0"},"canonical_sha256":"e30ed2f8b108c0fe5cadb94c7437b882975df309bfc65c7c8110f9c9c6f7c002","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:13:30.364539Z","signature_b64":"dG7yuFKsO+PKZDNmvF3bI1RGtd36yUkHU3jOpDbZeVnXjY+6uAk0GI+AzGB86f4atlucAmIoQ3s0fR8mZ+83Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e30ed2f8b108c0fe5cadb94c7437b882975df309bfc65c7c8110f9c9c6f7c002","last_reissued_at":"2026-05-18T02:13:30.363713Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:13:30.363713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0906.0115","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-18T02:13:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sx/hqBJTplo5T4kHy/NLU9FcCBN0oldOTnq24AN+6MwMY721xyD8HTVQK2KRDB/q25D/lyrslssu3EFEcRdRCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:00:34.873906Z"},"content_sha256":"01a09ffd639412b6c47d8ea36cfc06d9dba910b0996a5d095ab6ddbdee297e10","schema_version":"1.0","event_id":"sha256:01a09ffd639412b6c47d8ea36cfc06d9dba910b0996a5d095ab6ddbdee297e10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:4MHNF6FRBDAP4XFNXFGHIN5YQK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A \"Cellular Neuronal\" Approach to Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["nlin.PS"],"primary_cat":"nlin.AO","authors_text":"Gregory S. Duane","submitted_at":"2009-05-30T21:44:28Z","abstract_excerpt":"The Hopfield-Tank (1985) recurrent neural network architecture for the Traveling Salesman Problem is generalized to a fully interconnected \"cellular\" neural network of regular oscillators. Tours are defined by synchronization patterns, allowing the simultaneous representation of all cyclic permutations of a given tour. The network converges to local optima some of which correspond to shortest-distance tours, as can be shown analytically in a stationary phase approximation. Simulated annealing is required for global optimization, but the stochastic element might be replaced by chaotic intermitt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.0115","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-18T02:13:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JQhTV9qC5823QkwXiwFT6iTkO6zItRj+JcwsJDl58lzaF8OhFqyxPf0DUJ7dCIWG5SoRaF5KdL29r8IgiaA7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:00:34.874255Z"},"content_sha256":"607097051c4abdd3830aca386db2d1689178042b3a22cc886ea6235f3152529e","schema_version":"1.0","event_id":"sha256:607097051c4abdd3830aca386db2d1689178042b3a22cc886ea6235f3152529e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4MHNF6FRBDAP4XFNXFGHIN5YQK/bundle.json","state_url":"https://pith.science/pith/4MHNF6FRBDAP4XFNXFGHIN5YQK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4MHNF6FRBDAP4XFNXFGHIN5YQK/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-06-05T15:00:34Z","links":{"resolver":"https://pith.science/pith/4MHNF6FRBDAP4XFNXFGHIN5YQK","bundle":"https://pith.science/pith/4MHNF6FRBDAP4XFNXFGHIN5YQK/bundle.json","state":"https://pith.science/pith/4MHNF6FRBDAP4XFNXFGHIN5YQK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4MHNF6FRBDAP4XFNXFGHIN5YQK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:4MHNF6FRBDAP4XFNXFGHIN5YQK","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":"d08b6de7fdf524ef97ea0a922248901bfe20678ba417045ca3b482de8f9c1972","cross_cats_sorted":["nlin.PS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.AO","submitted_at":"2009-05-30T21:44:28Z","title_canon_sha256":"3ea684426ddadc5aeeefdd3932e461ea90300edb51c9822c6ca2927c1cc0c612"},"schema_version":"1.0","source":{"id":"0906.0115","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.0115","created_at":"2026-05-18T02:13:30Z"},{"alias_kind":"arxiv_version","alias_value":"0906.0115v1","created_at":"2026-05-18T02:13:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.0115","created_at":"2026-05-18T02:13:30Z"},{"alias_kind":"pith_short_12","alias_value":"4MHNF6FRBDAP","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"4MHNF6FRBDAP4XFN","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"4MHNF6FR","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:607097051c4abdd3830aca386db2d1689178042b3a22cc886ea6235f3152529e","target":"graph","created_at":"2026-05-18T02:13:30Z","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":"The Hopfield-Tank (1985) recurrent neural network architecture for the Traveling Salesman Problem is generalized to a fully interconnected \"cellular\" neural network of regular oscillators. Tours are defined by synchronization patterns, allowing the simultaneous representation of all cyclic permutations of a given tour. The network converges to local optima some of which correspond to shortest-distance tours, as can be shown analytically in a stationary phase approximation. Simulated annealing is required for global optimization, but the stochastic element might be replaced by chaotic intermitt","authors_text":"Gregory S. Duane","cross_cats":["nlin.PS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.AO","submitted_at":"2009-05-30T21:44:28Z","title":"A \"Cellular Neuronal\" Approach to Optimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.0115","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:01a09ffd639412b6c47d8ea36cfc06d9dba910b0996a5d095ab6ddbdee297e10","target":"record","created_at":"2026-05-18T02:13:30Z","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":"d08b6de7fdf524ef97ea0a922248901bfe20678ba417045ca3b482de8f9c1972","cross_cats_sorted":["nlin.PS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.AO","submitted_at":"2009-05-30T21:44:28Z","title_canon_sha256":"3ea684426ddadc5aeeefdd3932e461ea90300edb51c9822c6ca2927c1cc0c612"},"schema_version":"1.0","source":{"id":"0906.0115","kind":"arxiv","version":1}},"canonical_sha256":"e30ed2f8b108c0fe5cadb94c7437b882975df309bfc65c7c8110f9c9c6f7c002","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e30ed2f8b108c0fe5cadb94c7437b882975df309bfc65c7c8110f9c9c6f7c002","first_computed_at":"2026-05-18T02:13:30.363713Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:13:30.363713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dG7yuFKsO+PKZDNmvF3bI1RGtd36yUkHU3jOpDbZeVnXjY+6uAk0GI+AzGB86f4atlucAmIoQ3s0fR8mZ+83Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:13:30.364539Z","signed_message":"canonical_sha256_bytes"},"source_id":"0906.0115","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01a09ffd639412b6c47d8ea36cfc06d9dba910b0996a5d095ab6ddbdee297e10","sha256:607097051c4abdd3830aca386db2d1689178042b3a22cc886ea6235f3152529e"],"state_sha256":"143b88eca9bc4e3efc5417bf88b5b45225a2da9e8342a802f3e9c11181e43e63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vrax4Rkqa2/0C+CBqK+IwpqvLptmcuSwijBewRgsOIS+q2ffXJtfUNPB+KNFBj7GNaeTXRx4odItIui30U9VCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T15:00:34.876356Z","bundle_sha256":"5f2b1de7c8c66426adef7eb506037926b5697364e89de8dc06054a0d640d6fa6"}}