{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:F6I6BOE7L4SWUS2EA7HPBKACTN","short_pith_number":"pith:F6I6BOE7","schema_version":"1.0","canonical_sha256":"2f91e0b89f5f256a4b4407cef0a8029b680448930176901397a035e1c7b99213","source":{"kind":"arxiv","id":"1403.4010","version":2},"attestation_state":"computed","paper":{"title":"Organization mechanism and counting algorithm on Vertex-Cover solutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Baolong Niu, Binghui Guo, Renquan Zhang, Wei Wei, Zhiming Zheng","submitted_at":"2014-03-17T06:44:35Z","abstract_excerpt":"Counting the solution number of combinational optimization problems is an important topic in the study of computational complexity, especially on the #P-complete complexity class. In this paper, we first investigate some organizations of Vertex-Cover unfrozen subgraphs by the underlying connectivity and connected components of unfrozen vertices. Then, a Vertex-Cover Solution Number Counting Algorithm is proposed and its complexity analysis is provided, the results of which fit very well with the simulations and have better performance than those by 1-RSB in a neighborhood of c = e for random g"},"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":"1403.4010","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-03-17T06:44:35Z","cross_cats_sorted":[],"title_canon_sha256":"115d7a1cf8ee3c480556335c2d110a5664c78ef878cec411550834f4bf2253a5","abstract_canon_sha256":"c1611a3a1f1e5de7a208d3e22f57eaf4639e7b7b36404646e18d9816e5863fb2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:44:00.603068Z","signature_b64":"WTOrCt/qL9iiIHVmNcGh7I7UJGsHYPEal1ZH/WEXZTdN3c5qaE1EycYAax7pec2FcMMa/mIUpkGcshfcpHKhDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f91e0b89f5f256a4b4407cef0a8029b680448930176901397a035e1c7b99213","last_reissued_at":"2026-05-18T01:44:00.602456Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:44:00.602456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Organization mechanism and counting algorithm on Vertex-Cover solutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Baolong Niu, Binghui Guo, Renquan Zhang, Wei Wei, Zhiming Zheng","submitted_at":"2014-03-17T06:44:35Z","abstract_excerpt":"Counting the solution number of combinational optimization problems is an important topic in the study of computational complexity, especially on the #P-complete complexity class. In this paper, we first investigate some organizations of Vertex-Cover unfrozen subgraphs by the underlying connectivity and connected components of unfrozen vertices. Then, a Vertex-Cover Solution Number Counting Algorithm is proposed and its complexity analysis is provided, the results of which fit very well with the simulations and have better performance than those by 1-RSB in a neighborhood of c = e for random g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4010","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":"1403.4010","created_at":"2026-05-18T01:44:00.602567+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.4010v2","created_at":"2026-05-18T01:44:00.602567+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4010","created_at":"2026-05-18T01:44:00.602567+00:00"},{"alias_kind":"pith_short_12","alias_value":"F6I6BOE7L4SW","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"F6I6BOE7L4SWUS2E","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"F6I6BOE7","created_at":"2026-05-18T12:28:28.263976+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/F6I6BOE7L4SWUS2EA7HPBKACTN","json":"https://pith.science/pith/F6I6BOE7L4SWUS2EA7HPBKACTN.json","graph_json":"https://pith.science/api/pith-number/F6I6BOE7L4SWUS2EA7HPBKACTN/graph.json","events_json":"https://pith.science/api/pith-number/F6I6BOE7L4SWUS2EA7HPBKACTN/events.json","paper":"https://pith.science/paper/F6I6BOE7"},"agent_actions":{"view_html":"https://pith.science/pith/F6I6BOE7L4SWUS2EA7HPBKACTN","download_json":"https://pith.science/pith/F6I6BOE7L4SWUS2EA7HPBKACTN.json","view_paper":"https://pith.science/paper/F6I6BOE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.4010&json=true","fetch_graph":"https://pith.science/api/pith-number/F6I6BOE7L4SWUS2EA7HPBKACTN/graph.json","fetch_events":"https://pith.science/api/pith-number/F6I6BOE7L4SWUS2EA7HPBKACTN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F6I6BOE7L4SWUS2EA7HPBKACTN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F6I6BOE7L4SWUS2EA7HPBKACTN/action/storage_attestation","attest_author":"https://pith.science/pith/F6I6BOE7L4SWUS2EA7HPBKACTN/action/author_attestation","sign_citation":"https://pith.science/pith/F6I6BOE7L4SWUS2EA7HPBKACTN/action/citation_signature","submit_replication":"https://pith.science/pith/F6I6BOE7L4SWUS2EA7HPBKACTN/action/replication_record"}},"created_at":"2026-05-18T01:44:00.602567+00:00","updated_at":"2026-05-18T01:44:00.602567+00:00"}