{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:P2LJQWKIKAQESZ5AH3F64ZVAKM","short_pith_number":"pith:P2LJQWKI","canonical_record":{"source":{"id":"1411.7126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-26T07:24:13Z","cross_cats_sorted":[],"title_canon_sha256":"9426c0f9202f99268507e866854318e19d5b0aba7114b1f186048350d4441345","abstract_canon_sha256":"fc6c9933d2b59667abfff81dff813cbf4b2b32c415b3adb37873a522bf361d20"},"schema_version":"1.0"},"canonical_sha256":"7e9698594850204967a03ecbee66a053247feaa36370b0799e9656e28366f390","source":{"kind":"arxiv","id":"1411.7126","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7126","created_at":"2026-05-18T02:32:45Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7126v1","created_at":"2026-05-18T02:32:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7126","created_at":"2026-05-18T02:32:45Z"},{"alias_kind":"pith_short_12","alias_value":"P2LJQWKIKAQE","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"P2LJQWKIKAQESZ5A","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"P2LJQWKI","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:P2LJQWKIKAQESZ5AH3F64ZVAKM","target":"record","payload":{"canonical_record":{"source":{"id":"1411.7126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-26T07:24:13Z","cross_cats_sorted":[],"title_canon_sha256":"9426c0f9202f99268507e866854318e19d5b0aba7114b1f186048350d4441345","abstract_canon_sha256":"fc6c9933d2b59667abfff81dff813cbf4b2b32c415b3adb37873a522bf361d20"},"schema_version":"1.0"},"canonical_sha256":"7e9698594850204967a03ecbee66a053247feaa36370b0799e9656e28366f390","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:45.268811Z","signature_b64":"PDUUuOE6ogJUoha0LqSH3q8CNYvu1ZnnxuiVN9zh+raF6WIjVG+8vL+FhVKbekmZKHO8P98Y6rlZt0JsEBGDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e9698594850204967a03ecbee66a053247feaa36370b0799e9656e28366f390","last_reissued_at":"2026-05-18T02:32:45.268266Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:45.268266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.7126","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:32:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MRj80bUy2eSmgx6IfthHZZqFXdW/qGQbXEJwhbxardQH3tZNAyHxR5vZPDF0POiGpfMsQqx1AQB5aIBuDhbSCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:57:20.819539Z"},"content_sha256":"f58474abe5a17cb4659751e2aeee501349e868717e8957696a3da84b5511c9fd","schema_version":"1.0","event_id":"sha256:f58474abe5a17cb4659751e2aeee501349e868717e8957696a3da84b5511c9fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:P2LJQWKIKAQESZ5AH3F64ZVAKM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Maximum Resonant Set of Polyomino Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Heping Zhang, Xiangqian Zhou","submitted_at":"2014-11-26T07:24:13Z","abstract_excerpt":"A polyomino graph $H$ is a connected finite subgraph of the infinite plane grid such that each finite face is surrounded by a regular square of side length one and each edge belongs to at least one square. In this paper, we show that if $K$ is a maximum resonant set of $H$, then $H-K$ has a unique perfect matching. We further prove that the maximum forcing number of a polyomino graph is equal to its Clar number. Based on this result, we have that the maximum forcing number of a polyomino graph can be computed in polynomial time. We also show that if $K$ is a maximal alternating set of $H$, the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7126","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:32:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v74ohFl6HbQicQDX9JN2+DGrhSvNHIVGZkr3EoC1vWxlD2K7WzS7IAKoPPk7i5SXihkhh91g9OwIHG7U+UB1DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:57:20.820202Z"},"content_sha256":"14cc4bfb0e88263e425869e43fc42aa63d58a4ab34718b5366468a0818fdfc7a","schema_version":"1.0","event_id":"sha256:14cc4bfb0e88263e425869e43fc42aa63d58a4ab34718b5366468a0818fdfc7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P2LJQWKIKAQESZ5AH3F64ZVAKM/bundle.json","state_url":"https://pith.science/pith/P2LJQWKIKAQESZ5AH3F64ZVAKM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P2LJQWKIKAQESZ5AH3F64ZVAKM/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-11T16:57:20Z","links":{"resolver":"https://pith.science/pith/P2LJQWKIKAQESZ5AH3F64ZVAKM","bundle":"https://pith.science/pith/P2LJQWKIKAQESZ5AH3F64ZVAKM/bundle.json","state":"https://pith.science/pith/P2LJQWKIKAQESZ5AH3F64ZVAKM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P2LJQWKIKAQESZ5AH3F64ZVAKM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:P2LJQWKIKAQESZ5AH3F64ZVAKM","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":"fc6c9933d2b59667abfff81dff813cbf4b2b32c415b3adb37873a522bf361d20","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-26T07:24:13Z","title_canon_sha256":"9426c0f9202f99268507e866854318e19d5b0aba7114b1f186048350d4441345"},"schema_version":"1.0","source":{"id":"1411.7126","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7126","created_at":"2026-05-18T02:32:45Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7126v1","created_at":"2026-05-18T02:32:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7126","created_at":"2026-05-18T02:32:45Z"},{"alias_kind":"pith_short_12","alias_value":"P2LJQWKIKAQE","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"P2LJQWKIKAQESZ5A","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"P2LJQWKI","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:14cc4bfb0e88263e425869e43fc42aa63d58a4ab34718b5366468a0818fdfc7a","target":"graph","created_at":"2026-05-18T02:32:45Z","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":"A polyomino graph $H$ is a connected finite subgraph of the infinite plane grid such that each finite face is surrounded by a regular square of side length one and each edge belongs to at least one square. In this paper, we show that if $K$ is a maximum resonant set of $H$, then $H-K$ has a unique perfect matching. We further prove that the maximum forcing number of a polyomino graph is equal to its Clar number. Based on this result, we have that the maximum forcing number of a polyomino graph can be computed in polynomial time. We also show that if $K$ is a maximal alternating set of $H$, the","authors_text":"Heping Zhang, Xiangqian Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-26T07:24:13Z","title":"A Maximum Resonant Set of Polyomino Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7126","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:f58474abe5a17cb4659751e2aeee501349e868717e8957696a3da84b5511c9fd","target":"record","created_at":"2026-05-18T02:32:45Z","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":"fc6c9933d2b59667abfff81dff813cbf4b2b32c415b3adb37873a522bf361d20","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-26T07:24:13Z","title_canon_sha256":"9426c0f9202f99268507e866854318e19d5b0aba7114b1f186048350d4441345"},"schema_version":"1.0","source":{"id":"1411.7126","kind":"arxiv","version":1}},"canonical_sha256":"7e9698594850204967a03ecbee66a053247feaa36370b0799e9656e28366f390","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e9698594850204967a03ecbee66a053247feaa36370b0799e9656e28366f390","first_computed_at":"2026-05-18T02:32:45.268266Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:45.268266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PDUUuOE6ogJUoha0LqSH3q8CNYvu1ZnnxuiVN9zh+raF6WIjVG+8vL+FhVKbekmZKHO8P98Y6rlZt0JsEBGDCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:45.268811Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.7126","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f58474abe5a17cb4659751e2aeee501349e868717e8957696a3da84b5511c9fd","sha256:14cc4bfb0e88263e425869e43fc42aa63d58a4ab34718b5366468a0818fdfc7a"],"state_sha256":"796fc11f8fc556bb7e2650e6aa3292c86948eaf851b4627a0be394ca07c55fa6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RFukalI2v/NY/+i6i78MZ3f9eYMyQ9ddXgdjpiQlVGtYo9lgGIhoxSqR6p4lHoj3zw7l5n0aRrG/HCQIgwYICg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T16:57:20.824421Z","bundle_sha256":"a0c16b686ede1647e5403c359c8fda4112fd6b9e5a12d9cd7a42c8c32535bfcc"}}