{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:S6CWVQG4YU5X5PBRX3WNKTSWEY","short_pith_number":"pith:S6CWVQG4","schema_version":"1.0","canonical_sha256":"97856ac0dcc53b7ebc31beecd54e56263b4978d0e37e14b773158f4b1c741981","source":{"kind":"arxiv","id":"1410.0747","version":1},"attestation_state":"computed","paper":{"title":"The maximum forcing number of polyomino","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fuji Zhang, Liqiong Xu, Yuqing Lin","submitted_at":"2014-10-03T03:49:09Z","abstract_excerpt":"The forcing number of a perfect matching $M$ of a graph $G$ is the cardinality of the smallest subset of $M$ that is contained in no other perfect matchings of $G$. For a planar embedding of a 2-connected bipartite planar graph $G$ which has a perfect matching, the concept of Clar number of hexagonal system had been extended by Abeledo and Atkinson as follows: a spanning subgraph $C$ of is called a Clar cover of $G$ if each of its components is either an even face or an edge, the maximum number of even faces in Clar covers of $G$ is called Clar number of $G$, and the Clar cover with the maximu"},"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":"1410.0747","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-03T03:49:09Z","cross_cats_sorted":[],"title_canon_sha256":"6e05608576259c073bc432a19afcb9a1922a0997645b1d0e129b61f412264eb9","abstract_canon_sha256":"5be06d0e17d872adcd90ea411e4528580554954bcf4991dc1dced3beaa67438d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:09.761831Z","signature_b64":"jZ23HyecUOyAdi9AncRxl1x2MjYr/KOP4sGTrSMDvO05YoAoPtnW3E7xPhEy8E7HDuBGeEQA29f3v6HWbSaCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97856ac0dcc53b7ebc31beecd54e56263b4978d0e37e14b773158f4b1c741981","last_reissued_at":"2026-05-18T02:41:09.761440Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:09.761440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The maximum forcing number of polyomino","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fuji Zhang, Liqiong Xu, Yuqing Lin","submitted_at":"2014-10-03T03:49:09Z","abstract_excerpt":"The forcing number of a perfect matching $M$ of a graph $G$ is the cardinality of the smallest subset of $M$ that is contained in no other perfect matchings of $G$. For a planar embedding of a 2-connected bipartite planar graph $G$ which has a perfect matching, the concept of Clar number of hexagonal system had been extended by Abeledo and Atkinson as follows: a spanning subgraph $C$ of is called a Clar cover of $G$ if each of its components is either an even face or an edge, the maximum number of even faces in Clar covers of $G$ is called Clar number of $G$, and the Clar cover with the maximu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0747","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":"1410.0747","created_at":"2026-05-18T02:41:09.761498+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.0747v1","created_at":"2026-05-18T02:41:09.761498+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0747","created_at":"2026-05-18T02:41:09.761498+00:00"},{"alias_kind":"pith_short_12","alias_value":"S6CWVQG4YU5X","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"S6CWVQG4YU5X5PBR","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"S6CWVQG4","created_at":"2026-05-18T12:28:49.207871+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/S6CWVQG4YU5X5PBRX3WNKTSWEY","json":"https://pith.science/pith/S6CWVQG4YU5X5PBRX3WNKTSWEY.json","graph_json":"https://pith.science/api/pith-number/S6CWVQG4YU5X5PBRX3WNKTSWEY/graph.json","events_json":"https://pith.science/api/pith-number/S6CWVQG4YU5X5PBRX3WNKTSWEY/events.json","paper":"https://pith.science/paper/S6CWVQG4"},"agent_actions":{"view_html":"https://pith.science/pith/S6CWVQG4YU5X5PBRX3WNKTSWEY","download_json":"https://pith.science/pith/S6CWVQG4YU5X5PBRX3WNKTSWEY.json","view_paper":"https://pith.science/paper/S6CWVQG4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.0747&json=true","fetch_graph":"https://pith.science/api/pith-number/S6CWVQG4YU5X5PBRX3WNKTSWEY/graph.json","fetch_events":"https://pith.science/api/pith-number/S6CWVQG4YU5X5PBRX3WNKTSWEY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S6CWVQG4YU5X5PBRX3WNKTSWEY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S6CWVQG4YU5X5PBRX3WNKTSWEY/action/storage_attestation","attest_author":"https://pith.science/pith/S6CWVQG4YU5X5PBRX3WNKTSWEY/action/author_attestation","sign_citation":"https://pith.science/pith/S6CWVQG4YU5X5PBRX3WNKTSWEY/action/citation_signature","submit_replication":"https://pith.science/pith/S6CWVQG4YU5X5PBRX3WNKTSWEY/action/replication_record"}},"created_at":"2026-05-18T02:41:09.761498+00:00","updated_at":"2026-05-18T02:41:09.761498+00:00"}