{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HCON7IWWDXW7THCZNF4KWWPES6","short_pith_number":"pith:HCON7IWW","canonical_record":{"source":{"id":"1405.0446","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-05-01T09:18:25Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"ff27b1b6c6e3142532485aa98af01b64ef63e03d2bd1b2d7db6bcc15f77f43e1","abstract_canon_sha256":"665b278c194e699f6f7666582e6ae1802e44617a4aa733731558aba03fd260c9"},"schema_version":"1.0"},"canonical_sha256":"389cdfa2d61dedf99c596978ab59e497ab009020d44880845f58f3d6b3103740","source":{"kind":"arxiv","id":"1405.0446","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0446","created_at":"2026-05-18T01:43:20Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0446v1","created_at":"2026-05-18T01:43:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0446","created_at":"2026-05-18T01:43:20Z"},{"alias_kind":"pith_short_12","alias_value":"HCON7IWWDXW7","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HCON7IWWDXW7THCZ","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HCON7IWW","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HCON7IWWDXW7THCZNF4KWWPES6","target":"record","payload":{"canonical_record":{"source":{"id":"1405.0446","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-05-01T09:18:25Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"ff27b1b6c6e3142532485aa98af01b64ef63e03d2bd1b2d7db6bcc15f77f43e1","abstract_canon_sha256":"665b278c194e699f6f7666582e6ae1802e44617a4aa733731558aba03fd260c9"},"schema_version":"1.0"},"canonical_sha256":"389cdfa2d61dedf99c596978ab59e497ab009020d44880845f58f3d6b3103740","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:43:20.488655Z","signature_b64":"+tDCajn+LyI+s2C0CQlLtOdRGJGj1b29GVIXvhXCRyk+7+Au5DJq1zAsdodjwB2VoTnkyJS1affDdeEq2dM3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"389cdfa2d61dedf99c596978ab59e497ab009020d44880845f58f3d6b3103740","last_reissued_at":"2026-05-18T01:43:20.488069Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:43:20.488069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.0446","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:43:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iWDaNuDocvaJ1+ab38qLp6zoPKu5ZIExKu3dGxXjdfjpklexaSwTQghvlg1kjMCE18HBsJOH1a1h1K9/Sqt2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:14:47.786790Z"},"content_sha256":"fc43962b65505af0987629354688b813522a31e7a602fb3b2dbaa1654fee51a0","schema_version":"1.0","event_id":"sha256:fc43962b65505af0987629354688b813522a31e7a602fb3b2dbaa1654fee51a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HCON7IWWDXW7THCZNF4KWWPES6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving the undirected feedback vertex set problem by local search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"cs.AI","authors_text":"Hai-Jun Zhou, Shao-Meng Qin","submitted_at":"2014-05-01T09:18:25Z","abstract_excerpt":"An undirected graph consists of a set of vertices and a set of undirected edges between vertices. Such a graph may contain an abundant number of cycles, then a feedback vertex set (FVS) is a set of vertices intersecting with each of these cycles. Constructing a FVS of cardinality approaching the global minimum value is a optimization problem in the nondeterministic polynomial-complete complexity class, therefore it might be extremely difficult for some large graph instances. In this paper we develop a simulated annealing local search algorithm for the undirected FVS problem. By defining an ord"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0446","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:43:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ZMW7VPBrNl5NT2uiPzvMhPtRgD6XKKCZgU3jyOSMFkmI24Cl6haY77dGlZHGXH/nCI0ANUC8cxE5lqpBZLzCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:14:47.787135Z"},"content_sha256":"d0b16e001c7ee24222925c4f2e50f48a082709d320de157fd77bd79901142129","schema_version":"1.0","event_id":"sha256:d0b16e001c7ee24222925c4f2e50f48a082709d320de157fd77bd79901142129"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HCON7IWWDXW7THCZNF4KWWPES6/bundle.json","state_url":"https://pith.science/pith/HCON7IWWDXW7THCZNF4KWWPES6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HCON7IWWDXW7THCZNF4KWWPES6/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-08T13:14:47Z","links":{"resolver":"https://pith.science/pith/HCON7IWWDXW7THCZNF4KWWPES6","bundle":"https://pith.science/pith/HCON7IWWDXW7THCZNF4KWWPES6/bundle.json","state":"https://pith.science/pith/HCON7IWWDXW7THCZNF4KWWPES6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HCON7IWWDXW7THCZNF4KWWPES6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HCON7IWWDXW7THCZNF4KWWPES6","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":"665b278c194e699f6f7666582e6ae1802e44617a4aa733731558aba03fd260c9","cross_cats_sorted":["cond-mat.dis-nn"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-05-01T09:18:25Z","title_canon_sha256":"ff27b1b6c6e3142532485aa98af01b64ef63e03d2bd1b2d7db6bcc15f77f43e1"},"schema_version":"1.0","source":{"id":"1405.0446","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0446","created_at":"2026-05-18T01:43:20Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0446v1","created_at":"2026-05-18T01:43:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0446","created_at":"2026-05-18T01:43:20Z"},{"alias_kind":"pith_short_12","alias_value":"HCON7IWWDXW7","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HCON7IWWDXW7THCZ","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HCON7IWW","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:d0b16e001c7ee24222925c4f2e50f48a082709d320de157fd77bd79901142129","target":"graph","created_at":"2026-05-18T01:43: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":"An undirected graph consists of a set of vertices and a set of undirected edges between vertices. Such a graph may contain an abundant number of cycles, then a feedback vertex set (FVS) is a set of vertices intersecting with each of these cycles. Constructing a FVS of cardinality approaching the global minimum value is a optimization problem in the nondeterministic polynomial-complete complexity class, therefore it might be extremely difficult for some large graph instances. In this paper we develop a simulated annealing local search algorithm for the undirected FVS problem. By defining an ord","authors_text":"Hai-Jun Zhou, Shao-Meng Qin","cross_cats":["cond-mat.dis-nn"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-05-01T09:18:25Z","title":"Solving the undirected feedback vertex set problem by local search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0446","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:fc43962b65505af0987629354688b813522a31e7a602fb3b2dbaa1654fee51a0","target":"record","created_at":"2026-05-18T01:43: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":"665b278c194e699f6f7666582e6ae1802e44617a4aa733731558aba03fd260c9","cross_cats_sorted":["cond-mat.dis-nn"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-05-01T09:18:25Z","title_canon_sha256":"ff27b1b6c6e3142532485aa98af01b64ef63e03d2bd1b2d7db6bcc15f77f43e1"},"schema_version":"1.0","source":{"id":"1405.0446","kind":"arxiv","version":1}},"canonical_sha256":"389cdfa2d61dedf99c596978ab59e497ab009020d44880845f58f3d6b3103740","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"389cdfa2d61dedf99c596978ab59e497ab009020d44880845f58f3d6b3103740","first_computed_at":"2026-05-18T01:43:20.488069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:43:20.488069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+tDCajn+LyI+s2C0CQlLtOdRGJGj1b29GVIXvhXCRyk+7+Au5DJq1zAsdodjwB2VoTnkyJS1affDdeEq2dM3DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:43:20.488655Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.0446","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc43962b65505af0987629354688b813522a31e7a602fb3b2dbaa1654fee51a0","sha256:d0b16e001c7ee24222925c4f2e50f48a082709d320de157fd77bd79901142129"],"state_sha256":"91a1d15b451ab97c302bc59ce8726c916d16817fb8baa557d80c3805716632ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dNmrNfhSw80cGwQszxa3f1RVsCxAMG8s6x35lJqeCMQ0sYhrID8NyWRpiup5lHINVwJB4M9//1oT62t8cbNiBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T13:14:47.788960Z","bundle_sha256":"62a0351751e8089bc60dac6e624ba55435ed4ae14eafb9ee58f205cb77ff1050"}}