{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:623Z4Q6UQOFC4XCP5A4TFPJUQD","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":"56e40a65c6d13a08b2e708093fa46af2e5b4d6bc160fc56ed98e9635c88fcecf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2007-01-06T04:21:25Z","title_canon_sha256":"b1890513c792b8dc367ee3c669ed6336fefbf9d32c8ab5beeaa976ce0b2541e1"},"schema_version":"1.0","source":{"id":"math/0701184","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0701184","created_at":"2026-05-18T01:14:53Z"},{"alias_kind":"arxiv_version","alias_value":"math/0701184v2","created_at":"2026-05-18T01:14:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0701184","created_at":"2026-05-18T01:14:53Z"},{"alias_kind":"pith_short_12","alias_value":"623Z4Q6UQOFC","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"623Z4Q6UQOFC4XCP","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"623Z4Q6U","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:1bc1de86c6a83980673c2e002f35a5d6b865f768049f66023e9bf5ecef2a56ec","target":"graph","created_at":"2026-05-18T01:14:53Z","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":"We consider the problem of finding a local minimum of a binary quadratic function, and show by an elementary construction that every descending local search algorithm takes exponential time in the worst case.","authors_text":"D\\'avid Papp","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2007-01-06T04:21:25Z","title":"On the complexity of local search in unconstrained quadratic binary optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0701184","kind":"arxiv","version":2},"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:aca9d2a05ff435fe848a6250b9dabd061a750ac65bb6c1f767f1a9e301c8f2ef","target":"record","created_at":"2026-05-18T01:14:53Z","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":"56e40a65c6d13a08b2e708093fa46af2e5b4d6bc160fc56ed98e9635c88fcecf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2007-01-06T04:21:25Z","title_canon_sha256":"b1890513c792b8dc367ee3c669ed6336fefbf9d32c8ab5beeaa976ce0b2541e1"},"schema_version":"1.0","source":{"id":"math/0701184","kind":"arxiv","version":2}},"canonical_sha256":"f6b79e43d4838a2e5c4fe83932bd3480dc7b2447a59aa031e1c8bad02a5f044e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6b79e43d4838a2e5c4fe83932bd3480dc7b2447a59aa031e1c8bad02a5f044e","first_computed_at":"2026-05-18T01:14:53.797513Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:53.797513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lx+R66QRaYS1fNlloH/Isa3oMMk88mpZj0WHMCNw3JphSCdgeP+xUG0lsC/A+on96FrMT2lgkfu7EQoUnYXrDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:53.798054Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0701184","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aca9d2a05ff435fe848a6250b9dabd061a750ac65bb6c1f767f1a9e301c8f2ef","sha256:1bc1de86c6a83980673c2e002f35a5d6b865f768049f66023e9bf5ecef2a56ec"],"state_sha256":"0d29cc8bb23cc9c1224bd7c3b1ac60c503300e282a3a59267ee45be4f3a10815"}