{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:F6I6BOE7L4SWUS2EA7HPBKACTN","short_pith_number":"pith:F6I6BOE7","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"},"canonical_sha256":"2f91e0b89f5f256a4b4407cef0a8029b680448930176901397a035e1c7b99213","source":{"kind":"arxiv","id":"1403.4010","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4010","created_at":"2026-05-18T01:44:00Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4010v2","created_at":"2026-05-18T01:44:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4010","created_at":"2026-05-18T01:44:00Z"},{"alias_kind":"pith_short_12","alias_value":"F6I6BOE7L4SW","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"F6I6BOE7L4SWUS2E","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"F6I6BOE7","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:F6I6BOE7L4SWUS2EA7HPBKACTN","target":"record","payload":{"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"},"canonical_sha256":"2f91e0b89f5f256a4b4407cef0a8029b680448930176901397a035e1c7b99213","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"},"source_kind":"arxiv","source_id":"1403.4010","source_version":2,"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:44:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SwcGf7LHZXyjukG6MdVGjV47CnPhWue6mdoINMyX3cFFY/4T+/tqD0PIjf+U+u2o1/XiWutti1tNOeO76/F4Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:45:16.676051Z"},"content_sha256":"1d91dcddbef6700a504d34749102e44f3ace71928326555fdcf683c70c0d9586","schema_version":"1.0","event_id":"sha256:1d91dcddbef6700a504d34749102e44f3ace71928326555fdcf683c70c0d9586"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:F6I6BOE7L4SWUS2EA7HPBKACTN","target":"graph","payload":{"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"},"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:44:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xllHPMs2OtHYbqhc0859TacHFCHGy7sHauShUMQ6Zyc0I1ilTKVccMp1IVDwSW/Czx/hYXf8fjeXuRqT2crKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:45:16.676699Z"},"content_sha256":"146628f3d1503a73df47bd5e61d68907cd2dea7701a13153398c0751e57ef12d","schema_version":"1.0","event_id":"sha256:146628f3d1503a73df47bd5e61d68907cd2dea7701a13153398c0751e57ef12d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F6I6BOE7L4SWUS2EA7HPBKACTN/bundle.json","state_url":"https://pith.science/pith/F6I6BOE7L4SWUS2EA7HPBKACTN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F6I6BOE7L4SWUS2EA7HPBKACTN/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-05-25T21:45:16Z","links":{"resolver":"https://pith.science/pith/F6I6BOE7L4SWUS2EA7HPBKACTN","bundle":"https://pith.science/pith/F6I6BOE7L4SWUS2EA7HPBKACTN/bundle.json","state":"https://pith.science/pith/F6I6BOE7L4SWUS2EA7HPBKACTN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F6I6BOE7L4SWUS2EA7HPBKACTN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:F6I6BOE7L4SWUS2EA7HPBKACTN","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":"c1611a3a1f1e5de7a208d3e22f57eaf4639e7b7b36404646e18d9816e5863fb2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-03-17T06:44:35Z","title_canon_sha256":"115d7a1cf8ee3c480556335c2d110a5664c78ef878cec411550834f4bf2253a5"},"schema_version":"1.0","source":{"id":"1403.4010","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4010","created_at":"2026-05-18T01:44:00Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4010v2","created_at":"2026-05-18T01:44:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4010","created_at":"2026-05-18T01:44:00Z"},{"alias_kind":"pith_short_12","alias_value":"F6I6BOE7L4SW","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"F6I6BOE7L4SWUS2E","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"F6I6BOE7","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:146628f3d1503a73df47bd5e61d68907cd2dea7701a13153398c0751e57ef12d","target":"graph","created_at":"2026-05-18T01:44:00Z","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":"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","authors_text":"Baolong Niu, Binghui Guo, Renquan Zhang, Wei Wei, Zhiming Zheng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-03-17T06:44:35Z","title":"Organization mechanism and counting algorithm on Vertex-Cover solutions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4010","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:1d91dcddbef6700a504d34749102e44f3ace71928326555fdcf683c70c0d9586","target":"record","created_at":"2026-05-18T01:44:00Z","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":"c1611a3a1f1e5de7a208d3e22f57eaf4639e7b7b36404646e18d9816e5863fb2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-03-17T06:44:35Z","title_canon_sha256":"115d7a1cf8ee3c480556335c2d110a5664c78ef878cec411550834f4bf2253a5"},"schema_version":"1.0","source":{"id":"1403.4010","kind":"arxiv","version":2}},"canonical_sha256":"2f91e0b89f5f256a4b4407cef0a8029b680448930176901397a035e1c7b99213","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f91e0b89f5f256a4b4407cef0a8029b680448930176901397a035e1c7b99213","first_computed_at":"2026-05-18T01:44:00.602456Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:44:00.602456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WTOrCt/qL9iiIHVmNcGh7I7UJGsHYPEal1ZH/WEXZTdN3c5qaE1EycYAax7pec2FcMMa/mIUpkGcshfcpHKhDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:44:00.603068Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.4010","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d91dcddbef6700a504d34749102e44f3ace71928326555fdcf683c70c0d9586","sha256:146628f3d1503a73df47bd5e61d68907cd2dea7701a13153398c0751e57ef12d"],"state_sha256":"b38ce0e4718f7ffa70e7e835d8c91eedc86d50abf19e19bb2563c21e64569318"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5ib4lx4rAMhX4xOQHQTGWTXi5NFo5wJRKae0eIaU9Amw8jWHdoPEAPkZWujSgWHH20i0riwcAWupzZ70gaInAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:45:16.680098Z","bundle_sha256":"5edac40d20bad0abf0cc2d1ff56c7f9628f045846abaeacc49250a7c1d0dce22"}}