{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BDBW62ECNVQ4KMGXIIII45OV3L","short_pith_number":"pith:BDBW62EC","canonical_record":{"source":{"id":"1709.03678","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-12T03:37:38Z","cross_cats_sorted":[],"title_canon_sha256":"b14b078437c78e2fc7ab6dc346067a145ff97c7241a444029483d6f5003f05d2","abstract_canon_sha256":"446668e07553f5c2885f7cff1fa90964bf7e1bf819c9ca3f6e5f33ef430f2483"},"schema_version":"1.0"},"canonical_sha256":"08c36f68826d61c530d742108e75d5dac459e922dbff0f018d96c4a0c6d691d4","source":{"kind":"arxiv","id":"1709.03678","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03678","created_at":"2026-05-18T00:35:29Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03678v1","created_at":"2026-05-18T00:35:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03678","created_at":"2026-05-18T00:35:29Z"},{"alias_kind":"pith_short_12","alias_value":"BDBW62ECNVQ4","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BDBW62ECNVQ4KMGX","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BDBW62EC","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BDBW62ECNVQ4KMGXIIII45OV3L","target":"record","payload":{"canonical_record":{"source":{"id":"1709.03678","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-12T03:37:38Z","cross_cats_sorted":[],"title_canon_sha256":"b14b078437c78e2fc7ab6dc346067a145ff97c7241a444029483d6f5003f05d2","abstract_canon_sha256":"446668e07553f5c2885f7cff1fa90964bf7e1bf819c9ca3f6e5f33ef430f2483"},"schema_version":"1.0"},"canonical_sha256":"08c36f68826d61c530d742108e75d5dac459e922dbff0f018d96c4a0c6d691d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:29.827813Z","signature_b64":"D68NYoVKT5FlFdAWDTT+AUgRMI3MuiICS8j7eOquKTnaNK01WOYEJCQ9PAUZ2PbyDrMDXat7jrkkisXTwtK8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08c36f68826d61c530d742108e75d5dac459e922dbff0f018d96c4a0c6d691d4","last_reissued_at":"2026-05-18T00:35:29.827097Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:29.827097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.03678","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-18T00:35:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r6Q0Uu+FqJCWy745Vf0+/e/ga6tom+/YbbQcHNN8VT+1msSKO2+WNcZ9zBAcMVt7MtNQXyO4EJDoCmICEG0ZAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T11:19:29.202682Z"},"content_sha256":"71ca599eeafbbbfb2e193363e46196342b55d015fc89c571f67c4e66b35690da","schema_version":"1.0","event_id":"sha256:71ca599eeafbbbfb2e193363e46196342b55d015fc89c571f67c4e66b35690da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BDBW62ECNVQ4KMGXIIII45OV3L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximal independent sets on a grid graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Seungsang Oh","submitted_at":"2017-09-12T03:37:38Z","abstract_excerpt":"An independent vertex set of a graph is a set of vertices of the graph in which no two vertices are adjacent, and a maximal independent set is one that is not a proper subset of any other independent set. In this paper we count the number of maximal independent sets of vertices on a complete rectangular grid graph. More precisely, we provide a recursive matrix-relation producing the partition function with respect to the number of vertices. The asymptotic behavior of the maximal hard square entropy constant is also provided. We adapt the state matrix recursion algorithm, recently invented by t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03678","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-18T00:35:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WoS2ur5hffviyZVoZPjTeLvxbrpxTZuMcFKSN+GSRkS91SkRmSV8P5qBLm0Ryy7B3YywTCWXUJUzPkCeBijiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T11:19:29.203267Z"},"content_sha256":"dee588a5da509bd20cbb04c089fac6ebbb6dbc586fa8960cce80c0c3608e80e0","schema_version":"1.0","event_id":"sha256:dee588a5da509bd20cbb04c089fac6ebbb6dbc586fa8960cce80c0c3608e80e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BDBW62ECNVQ4KMGXIIII45OV3L/bundle.json","state_url":"https://pith.science/pith/BDBW62ECNVQ4KMGXIIII45OV3L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BDBW62ECNVQ4KMGXIIII45OV3L/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-21T11:19:29Z","links":{"resolver":"https://pith.science/pith/BDBW62ECNVQ4KMGXIIII45OV3L","bundle":"https://pith.science/pith/BDBW62ECNVQ4KMGXIIII45OV3L/bundle.json","state":"https://pith.science/pith/BDBW62ECNVQ4KMGXIIII45OV3L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BDBW62ECNVQ4KMGXIIII45OV3L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BDBW62ECNVQ4KMGXIIII45OV3L","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":"446668e07553f5c2885f7cff1fa90964bf7e1bf819c9ca3f6e5f33ef430f2483","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-12T03:37:38Z","title_canon_sha256":"b14b078437c78e2fc7ab6dc346067a145ff97c7241a444029483d6f5003f05d2"},"schema_version":"1.0","source":{"id":"1709.03678","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03678","created_at":"2026-05-18T00:35:29Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03678v1","created_at":"2026-05-18T00:35:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03678","created_at":"2026-05-18T00:35:29Z"},{"alias_kind":"pith_short_12","alias_value":"BDBW62ECNVQ4","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BDBW62ECNVQ4KMGX","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BDBW62EC","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:dee588a5da509bd20cbb04c089fac6ebbb6dbc586fa8960cce80c0c3608e80e0","target":"graph","created_at":"2026-05-18T00:35:29Z","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":"An independent vertex set of a graph is a set of vertices of the graph in which no two vertices are adjacent, and a maximal independent set is one that is not a proper subset of any other independent set. In this paper we count the number of maximal independent sets of vertices on a complete rectangular grid graph. More precisely, we provide a recursive matrix-relation producing the partition function with respect to the number of vertices. The asymptotic behavior of the maximal hard square entropy constant is also provided. We adapt the state matrix recursion algorithm, recently invented by t","authors_text":"Seungsang Oh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-12T03:37:38Z","title":"Maximal independent sets on a grid graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03678","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:71ca599eeafbbbfb2e193363e46196342b55d015fc89c571f67c4e66b35690da","target":"record","created_at":"2026-05-18T00:35:29Z","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":"446668e07553f5c2885f7cff1fa90964bf7e1bf819c9ca3f6e5f33ef430f2483","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-12T03:37:38Z","title_canon_sha256":"b14b078437c78e2fc7ab6dc346067a145ff97c7241a444029483d6f5003f05d2"},"schema_version":"1.0","source":{"id":"1709.03678","kind":"arxiv","version":1}},"canonical_sha256":"08c36f68826d61c530d742108e75d5dac459e922dbff0f018d96c4a0c6d691d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08c36f68826d61c530d742108e75d5dac459e922dbff0f018d96c4a0c6d691d4","first_computed_at":"2026-05-18T00:35:29.827097Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:29.827097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D68NYoVKT5FlFdAWDTT+AUgRMI3MuiICS8j7eOquKTnaNK01WOYEJCQ9PAUZ2PbyDrMDXat7jrkkisXTwtK8AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:29.827813Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.03678","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71ca599eeafbbbfb2e193363e46196342b55d015fc89c571f67c4e66b35690da","sha256:dee588a5da509bd20cbb04c089fac6ebbb6dbc586fa8960cce80c0c3608e80e0"],"state_sha256":"efd72d6b54dedaebd7428f11551198986b5b4e93cc1a95239039db5d252148e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2aklKsPLh8oltIXeNq6YkTZ8QCS7X8lap6wOrXNpUSEdqINw9ZH125iNDjMX02X+rYAiFNJEXabRjfBoA4OTCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T11:19:29.206279Z","bundle_sha256":"599f5abbc15ef9cb0c4ed4e2d3b63c6a57b386a0f08d92ce0aaab23891a0f1d2"}}