{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:H3C2WEMBAXINQJCMYB4GDO2WIA","short_pith_number":"pith:H3C2WEMB","schema_version":"1.0","canonical_sha256":"3ec5ab118105d0d8244cc07861bb5640225d32f415b462088ddbd6650508beef","source":{"kind":"arxiv","id":"1505.06955","version":1},"attestation_state":"computed","paper":{"title":"Research on Solution Space of Bipartite Graph Vertex-Cover by Maximum Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Baifeng Li, Baolong Niu, Ting Wang, Wei Wei, Yunjia Zhang, Zhiming Zheng","submitted_at":"2015-05-23T02:06:31Z","abstract_excerpt":"Some rigorous results and statistics of the solution space of Vertex-Covers on bipartite graphs are given in this paper. Based on the $K\\ddot{o}nig$'s theorem, an exact solution space expression algorithm is proposed and statistical analysis of the nodes' states is provided. The statistical results fit well with the algorithmic results until the emergence of the unfrozen core, which makes the fluctuation of statistical quantities and causes the replica symmetric breaking in the solutions. Besides, the entropy of bipartite Vertex-Cover solutions is calculated with the clustering entropy using a"},"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":"1505.06955","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-23T02:06:31Z","cross_cats_sorted":[],"title_canon_sha256":"affb60d1529c58cffdbfaf9e29b863e8e01eaaedd643bf29de0f27bb168ccd22","abstract_canon_sha256":"569757b3022b1f7bc7da17ba8e565c41862b1b20a4ddbcd06262b52f99347d17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:00.190246Z","signature_b64":"wc1fUJZpEEpe1NoPMyarVKayiwck5DxEoqkzM+O1guG33ODEMiYWSf7wqZLOeQPYxBSyco2sNTYhkp5kBoKjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ec5ab118105d0d8244cc07861bb5640225d32f415b462088ddbd6650508beef","last_reissued_at":"2026-05-18T01:25:00.189515Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:00.189515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Research on Solution Space of Bipartite Graph Vertex-Cover by Maximum Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Baifeng Li, Baolong Niu, Ting Wang, Wei Wei, Yunjia Zhang, Zhiming Zheng","submitted_at":"2015-05-23T02:06:31Z","abstract_excerpt":"Some rigorous results and statistics of the solution space of Vertex-Covers on bipartite graphs are given in this paper. Based on the $K\\ddot{o}nig$'s theorem, an exact solution space expression algorithm is proposed and statistical analysis of the nodes' states is provided. The statistical results fit well with the algorithmic results until the emergence of the unfrozen core, which makes the fluctuation of statistical quantities and causes the replica symmetric breaking in the solutions. Besides, the entropy of bipartite Vertex-Cover solutions is calculated with the clustering entropy using a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06955","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.06955","created_at":"2026-05-18T01:25:00.189634+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.06955v1","created_at":"2026-05-18T01:25:00.189634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06955","created_at":"2026-05-18T01:25:00.189634+00:00"},{"alias_kind":"pith_short_12","alias_value":"H3C2WEMBAXIN","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"H3C2WEMBAXINQJCM","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"H3C2WEMB","created_at":"2026-05-18T12:29:22.688609+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/H3C2WEMBAXINQJCMYB4GDO2WIA","json":"https://pith.science/pith/H3C2WEMBAXINQJCMYB4GDO2WIA.json","graph_json":"https://pith.science/api/pith-number/H3C2WEMBAXINQJCMYB4GDO2WIA/graph.json","events_json":"https://pith.science/api/pith-number/H3C2WEMBAXINQJCMYB4GDO2WIA/events.json","paper":"https://pith.science/paper/H3C2WEMB"},"agent_actions":{"view_html":"https://pith.science/pith/H3C2WEMBAXINQJCMYB4GDO2WIA","download_json":"https://pith.science/pith/H3C2WEMBAXINQJCMYB4GDO2WIA.json","view_paper":"https://pith.science/paper/H3C2WEMB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.06955&json=true","fetch_graph":"https://pith.science/api/pith-number/H3C2WEMBAXINQJCMYB4GDO2WIA/graph.json","fetch_events":"https://pith.science/api/pith-number/H3C2WEMBAXINQJCMYB4GDO2WIA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H3C2WEMBAXINQJCMYB4GDO2WIA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H3C2WEMBAXINQJCMYB4GDO2WIA/action/storage_attestation","attest_author":"https://pith.science/pith/H3C2WEMBAXINQJCMYB4GDO2WIA/action/author_attestation","sign_citation":"https://pith.science/pith/H3C2WEMBAXINQJCMYB4GDO2WIA/action/citation_signature","submit_replication":"https://pith.science/pith/H3C2WEMBAXINQJCMYB4GDO2WIA/action/replication_record"}},"created_at":"2026-05-18T01:25:00.189634+00:00","updated_at":"2026-05-18T01:25:00.189634+00:00"}