{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:S6CWVQG4YU5X5PBRX3WNKTSWEY","short_pith_number":"pith:S6CWVQG4","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"},"canonical_sha256":"97856ac0dcc53b7ebc31beecd54e56263b4978d0e37e14b773158f4b1c741981","source":{"kind":"arxiv","id":"1410.0747","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0747","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0747v1","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0747","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"pith_short_12","alias_value":"S6CWVQG4YU5X","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"S6CWVQG4YU5X5PBR","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"S6CWVQG4","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:S6CWVQG4YU5X5PBRX3WNKTSWEY","target":"record","payload":{"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"},"canonical_sha256":"97856ac0dcc53b7ebc31beecd54e56263b4978d0e37e14b773158f4b1c741981","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"},"source_kind":"arxiv","source_id":"1410.0747","source_version":1,"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-18T02:41:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iYP2KAkhKmRcbY6HW1ayacMareTEhnkx3rtmYdzY0URBBrYRpy8jXEhEDsJdhxXbMX0K/zC2wVpZ4opN0bXdBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:53:44.599404Z"},"content_sha256":"c9c5117d0181b4e5002005465a310bb7c85528acdcff6e76805684ce7ba96af1","schema_version":"1.0","event_id":"sha256:c9c5117d0181b4e5002005465a310bb7c85528acdcff6e76805684ce7ba96af1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:S6CWVQG4YU5X5PBRX3WNKTSWEY","target":"graph","payload":{"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"},"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-18T02:41:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q70afMEDUg2wtgzY5+aybRgV2kX+KzLLLwFWodHq1AxsTAW7C27vlYyDO8SM0+gQzIp6FKq9pAIgKaL4ZraBBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:53:44.600152Z"},"content_sha256":"2eef86dac698c60a42a5f1fc7eb0b84ba1fe96cd861edb10659e93e3a4324b19","schema_version":"1.0","event_id":"sha256:2eef86dac698c60a42a5f1fc7eb0b84ba1fe96cd861edb10659e93e3a4324b19"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S6CWVQG4YU5X5PBRX3WNKTSWEY/bundle.json","state_url":"https://pith.science/pith/S6CWVQG4YU5X5PBRX3WNKTSWEY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S6CWVQG4YU5X5PBRX3WNKTSWEY/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-06-02T20:53:44Z","links":{"resolver":"https://pith.science/pith/S6CWVQG4YU5X5PBRX3WNKTSWEY","bundle":"https://pith.science/pith/S6CWVQG4YU5X5PBRX3WNKTSWEY/bundle.json","state":"https://pith.science/pith/S6CWVQG4YU5X5PBRX3WNKTSWEY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S6CWVQG4YU5X5PBRX3WNKTSWEY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:S6CWVQG4YU5X5PBRX3WNKTSWEY","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":"5be06d0e17d872adcd90ea411e4528580554954bcf4991dc1dced3beaa67438d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-03T03:49:09Z","title_canon_sha256":"6e05608576259c073bc432a19afcb9a1922a0997645b1d0e129b61f412264eb9"},"schema_version":"1.0","source":{"id":"1410.0747","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0747","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0747v1","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0747","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"pith_short_12","alias_value":"S6CWVQG4YU5X","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"S6CWVQG4YU5X5PBR","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"S6CWVQG4","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:2eef86dac698c60a42a5f1fc7eb0b84ba1fe96cd861edb10659e93e3a4324b19","target":"graph","created_at":"2026-05-18T02:41:09Z","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":"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","authors_text":"Fuji Zhang, Liqiong Xu, Yuqing Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-03T03:49:09Z","title":"The maximum forcing number of polyomino"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0747","kind":"arxiv","version":1},"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:c9c5117d0181b4e5002005465a310bb7c85528acdcff6e76805684ce7ba96af1","target":"record","created_at":"2026-05-18T02:41:09Z","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":"5be06d0e17d872adcd90ea411e4528580554954bcf4991dc1dced3beaa67438d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-03T03:49:09Z","title_canon_sha256":"6e05608576259c073bc432a19afcb9a1922a0997645b1d0e129b61f412264eb9"},"schema_version":"1.0","source":{"id":"1410.0747","kind":"arxiv","version":1}},"canonical_sha256":"97856ac0dcc53b7ebc31beecd54e56263b4978d0e37e14b773158f4b1c741981","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97856ac0dcc53b7ebc31beecd54e56263b4978d0e37e14b773158f4b1c741981","first_computed_at":"2026-05-18T02:41:09.761440Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:09.761440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jZ23HyecUOyAdi9AncRxl1x2MjYr/KOP4sGTrSMDvO05YoAoPtnW3E7xPhEy8E7HDuBGeEQA29f3v6HWbSaCAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:09.761831Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.0747","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9c5117d0181b4e5002005465a310bb7c85528acdcff6e76805684ce7ba96af1","sha256:2eef86dac698c60a42a5f1fc7eb0b84ba1fe96cd861edb10659e93e3a4324b19"],"state_sha256":"4402327697338e5a482cfd4f844a2ddba353b28ed2f8dee9871dfd4463060a0c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"73LqtlIfgdKTfDXylSJr0Kyj5Cw8mBbzQvGaomKNVLoLal1DZRFQbg7hF0WQ/E4ZvJOVVdAMhrQ4AbNZ8qkYBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:53:44.604599Z","bundle_sha256":"e9def19bc451258f5acd3b95e76f2f7e3d905bc405706dc0f9fb77fe3bd55023"}}