{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MMIIW7UPHI7Z6DOSRPR6WEFECX","short_pith_number":"pith:MMIIW7UP","schema_version":"1.0","canonical_sha256":"63108b7e8f3a3f9f0dd28be3eb10a415dcddcf700398321796a8d4b8ea25bc30","source":{"kind":"arxiv","id":"1307.6948","version":2},"attestation_state":"computed","paper":{"title":"Spin glass approach to the feedback vertex set problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"cs.CC","authors_text":"Hai-Jun Zhou","submitted_at":"2013-07-26T08:04:11Z","abstract_excerpt":"A feedback vertex set (FVS) of an undirected graph is a set of vertices that contains at least one vertex of each cycle of the graph. The feedback vertex set problem consists of constructing a FVS of size less than a certain given value. This combinatorial optimization problem has many practical applications, but it is in the nondeterministic polynomial-complete class of worst-case computational complexity. In this paper we define a spin glass model for the FVS problem and then study this model on the ensemble of finite-connectivity random graphs. In our model the global cycle constraints are "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1307.6948","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-07-26T08:04:11Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"88ba93a029e1a0bc687798e5d7d36651ef9c464f05f416c71ebaf325a01ac525","abstract_canon_sha256":"30856fc6e2cba0530d41df924c9a9a02586c0c35fe842be12619f1465e05da02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:53.719083Z","signature_b64":"+I0JDeNgMVaywMLlO5tLnHjWDO44bJenfNmuy9Ighb0QY5LaFuflv8/wjD0cHMRNEX9ylaTM1NtooHs8yrcDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63108b7e8f3a3f9f0dd28be3eb10a415dcddcf700398321796a8d4b8ea25bc30","last_reissued_at":"2026-05-18T02:53:53.718206Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:53.718206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spin glass approach to the feedback vertex set problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"cs.CC","authors_text":"Hai-Jun Zhou","submitted_at":"2013-07-26T08:04:11Z","abstract_excerpt":"A feedback vertex set (FVS) of an undirected graph is a set of vertices that contains at least one vertex of each cycle of the graph. The feedback vertex set problem consists of constructing a FVS of size less than a certain given value. This combinatorial optimization problem has many practical applications, but it is in the nondeterministic polynomial-complete class of worst-case computational complexity. In this paper we define a spin glass model for the FVS problem and then study this model on the ensemble of finite-connectivity random graphs. In our model the global cycle constraints are "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6948","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.6948","created_at":"2026-05-18T02:53:53.718346+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.6948v2","created_at":"2026-05-18T02:53:53.718346+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6948","created_at":"2026-05-18T02:53:53.718346+00:00"},{"alias_kind":"pith_short_12","alias_value":"MMIIW7UPHI7Z","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MMIIW7UPHI7Z6DOS","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MMIIW7UP","created_at":"2026-05-18T12:27:52.871228+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MMIIW7UPHI7Z6DOSRPR6WEFECX","json":"https://pith.science/pith/MMIIW7UPHI7Z6DOSRPR6WEFECX.json","graph_json":"https://pith.science/api/pith-number/MMIIW7UPHI7Z6DOSRPR6WEFECX/graph.json","events_json":"https://pith.science/api/pith-number/MMIIW7UPHI7Z6DOSRPR6WEFECX/events.json","paper":"https://pith.science/paper/MMIIW7UP"},"agent_actions":{"view_html":"https://pith.science/pith/MMIIW7UPHI7Z6DOSRPR6WEFECX","download_json":"https://pith.science/pith/MMIIW7UPHI7Z6DOSRPR6WEFECX.json","view_paper":"https://pith.science/paper/MMIIW7UP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.6948&json=true","fetch_graph":"https://pith.science/api/pith-number/MMIIW7UPHI7Z6DOSRPR6WEFECX/graph.json","fetch_events":"https://pith.science/api/pith-number/MMIIW7UPHI7Z6DOSRPR6WEFECX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MMIIW7UPHI7Z6DOSRPR6WEFECX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MMIIW7UPHI7Z6DOSRPR6WEFECX/action/storage_attestation","attest_author":"https://pith.science/pith/MMIIW7UPHI7Z6DOSRPR6WEFECX/action/author_attestation","sign_citation":"https://pith.science/pith/MMIIW7UPHI7Z6DOSRPR6WEFECX/action/citation_signature","submit_replication":"https://pith.science/pith/MMIIW7UPHI7Z6DOSRPR6WEFECX/action/replication_record"}},"created_at":"2026-05-18T02:53:53.718346+00:00","updated_at":"2026-05-18T02:53:53.718346+00:00"}