{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QY6TBLOJVQFOQ6WGDNQTZ6OVLJ","short_pith_number":"pith:QY6TBLOJ","canonical_record":{"source":{"id":"1505.03068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-09T16:58:16Z","cross_cats_sorted":[],"title_canon_sha256":"fdc14738a3415f6cc34e6281c5af2fe1e0be53980f6ef96a426a3502a2268c40","abstract_canon_sha256":"48a560de0de007966115712bd03bcecbbb072257b5181ccff1aac0dc35d2cc81"},"schema_version":"1.0"},"canonical_sha256":"863d30adc9ac0ae87ac61b613cf9d55a6325a9408dac34a16be020cba052b305","source":{"kind":"arxiv","id":"1505.03068","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.03068","created_at":"2026-05-18T02:14:09Z"},{"alias_kind":"arxiv_version","alias_value":"1505.03068v1","created_at":"2026-05-18T02:14:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03068","created_at":"2026-05-18T02:14:09Z"},{"alias_kind":"pith_short_12","alias_value":"QY6TBLOJVQFO","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"QY6TBLOJVQFOQ6WG","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"QY6TBLOJ","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QY6TBLOJVQFOQ6WGDNQTZ6OVLJ","target":"record","payload":{"canonical_record":{"source":{"id":"1505.03068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-09T16:58:16Z","cross_cats_sorted":[],"title_canon_sha256":"fdc14738a3415f6cc34e6281c5af2fe1e0be53980f6ef96a426a3502a2268c40","abstract_canon_sha256":"48a560de0de007966115712bd03bcecbbb072257b5181ccff1aac0dc35d2cc81"},"schema_version":"1.0"},"canonical_sha256":"863d30adc9ac0ae87ac61b613cf9d55a6325a9408dac34a16be020cba052b305","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:14:09.099854Z","signature_b64":"/TKbi0k8O++vP6r9fQDryuctkOC5XZ7zNoy4d7y2HTa/MHRlo/TkiI6HiJekJhLJiqhisqseb4LDr1fqWu0MBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"863d30adc9ac0ae87ac61b613cf9d55a6325a9408dac34a16be020cba052b305","last_reissued_at":"2026-05-18T02:14:09.099094Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:14:09.099094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.03068","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:14:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"91bCaemqXLmD8M0QQXf4RphJU+U059tPKHpaMzzTkzbS70SUvDLvHJsTQgHbm/GL4OLIhJY25J3l9UvxZEpmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T04:34:30.032726Z"},"content_sha256":"f39d602c4e9985754c2cf68bf502e09583c57d88543bc7cec532c05475ae43b5","schema_version":"1.0","event_id":"sha256:f39d602c4e9985754c2cf68bf502e09583c57d88543bc7cec532c05475ae43b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QY6TBLOJVQFOQ6WGDNQTZ6OVLJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving maximum cut problems by simulated annealing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Tor G. J. Myklebust","submitted_at":"2015-05-09T16:58:16Z","abstract_excerpt":"This paper gives a straightforward implementation of simulated annealing for solving maximum cut problems and compares its performance to that of some existing heuristic solvers. The formulation used is classical, dating to a 1989 paper of Johnson, Aragon, McGeoch, and Schevon. This implementation uses no structure peculiar to the maximum cut problem, but its low per-iteration cost allows it to find better solutions than were previously known for 40 of the 89 standard maximum cut instances tested within a few minutes of computation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03068","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:14:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sNasnOc7cP0mBDgiQ+oZgopqLYvS4oOcQKUlhq7fjl5fo2NJknp1Es/9AbnDqDn4JvOAa1EtVHeZo6frAEgfDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T04:34:30.033231Z"},"content_sha256":"46f69f054b98f80ddca94206ccc66405f6dc4e4edd119e2db478c3591447c477","schema_version":"1.0","event_id":"sha256:46f69f054b98f80ddca94206ccc66405f6dc4e4edd119e2db478c3591447c477"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QY6TBLOJVQFOQ6WGDNQTZ6OVLJ/bundle.json","state_url":"https://pith.science/pith/QY6TBLOJVQFOQ6WGDNQTZ6OVLJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QY6TBLOJVQFOQ6WGDNQTZ6OVLJ/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-08-20T04:34:30Z","links":{"resolver":"https://pith.science/pith/QY6TBLOJVQFOQ6WGDNQTZ6OVLJ","bundle":"https://pith.science/pith/QY6TBLOJVQFOQ6WGDNQTZ6OVLJ/bundle.json","state":"https://pith.science/pith/QY6TBLOJVQFOQ6WGDNQTZ6OVLJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QY6TBLOJVQFOQ6WGDNQTZ6OVLJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QY6TBLOJVQFOQ6WGDNQTZ6OVLJ","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":"48a560de0de007966115712bd03bcecbbb072257b5181ccff1aac0dc35d2cc81","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-09T16:58:16Z","title_canon_sha256":"fdc14738a3415f6cc34e6281c5af2fe1e0be53980f6ef96a426a3502a2268c40"},"schema_version":"1.0","source":{"id":"1505.03068","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.03068","created_at":"2026-05-18T02:14:09Z"},{"alias_kind":"arxiv_version","alias_value":"1505.03068v1","created_at":"2026-05-18T02:14:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03068","created_at":"2026-05-18T02:14:09Z"},{"alias_kind":"pith_short_12","alias_value":"QY6TBLOJVQFO","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"QY6TBLOJVQFOQ6WG","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"QY6TBLOJ","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:46f69f054b98f80ddca94206ccc66405f6dc4e4edd119e2db478c3591447c477","target":"graph","created_at":"2026-05-18T02:14:09Z","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":"This paper gives a straightforward implementation of simulated annealing for solving maximum cut problems and compares its performance to that of some existing heuristic solvers. The formulation used is classical, dating to a 1989 paper of Johnson, Aragon, McGeoch, and Schevon. This implementation uses no structure peculiar to the maximum cut problem, but its low per-iteration cost allows it to find better solutions than were previously known for 40 of the 89 standard maximum cut instances tested within a few minutes of computation.","authors_text":"Tor G. J. Myklebust","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-09T16:58:16Z","title":"Solving maximum cut problems by simulated annealing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03068","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:f39d602c4e9985754c2cf68bf502e09583c57d88543bc7cec532c05475ae43b5","target":"record","created_at":"2026-05-18T02:14:09Z","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":"48a560de0de007966115712bd03bcecbbb072257b5181ccff1aac0dc35d2cc81","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-09T16:58:16Z","title_canon_sha256":"fdc14738a3415f6cc34e6281c5af2fe1e0be53980f6ef96a426a3502a2268c40"},"schema_version":"1.0","source":{"id":"1505.03068","kind":"arxiv","version":1}},"canonical_sha256":"863d30adc9ac0ae87ac61b613cf9d55a6325a9408dac34a16be020cba052b305","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"863d30adc9ac0ae87ac61b613cf9d55a6325a9408dac34a16be020cba052b305","first_computed_at":"2026-05-18T02:14:09.099094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:14:09.099094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/TKbi0k8O++vP6r9fQDryuctkOC5XZ7zNoy4d7y2HTa/MHRlo/TkiI6HiJekJhLJiqhisqseb4LDr1fqWu0MBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:14:09.099854Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.03068","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f39d602c4e9985754c2cf68bf502e09583c57d88543bc7cec532c05475ae43b5","sha256:46f69f054b98f80ddca94206ccc66405f6dc4e4edd119e2db478c3591447c477"],"state_sha256":"bb9960778ea8925bff1f7783e53706d7868f447440b7c97c69e3f734123efb02"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1MTJ7jk064bz5BX1xszHGycpk/XTAvXE6IgmUnYIPs2lt3K0GKLQzYbhxMSr30YaKBTZcP+PLK7ixy1VbTl/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T04:34:30.037001Z","bundle_sha256":"eb88489afdd907de8a7538c63e8057190b5847cae639181c7137770f8f2728e7"}}