{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RDBYWBEZUCVVUWDYYPGOEGYAM2","short_pith_number":"pith:RDBYWBEZ","canonical_record":{"source":{"id":"1405.3146","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-13T13:42:40Z","cross_cats_sorted":[],"title_canon_sha256":"789a3168192139b83a76098b619f1c4b469188b4e39a1798314600389141ac9f","abstract_canon_sha256":"ce8ade91f7660245f353dfcef87960f5274bb9ce82777f7a1dbbd1e090dbee0e"},"schema_version":"1.0"},"canonical_sha256":"88c38b0499a0ab5a5878c3cce21b0066b5902721e882a4ba79a0446b381474d7","source":{"kind":"arxiv","id":"1405.3146","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.3146","created_at":"2026-05-18T02:51:57Z"},{"alias_kind":"arxiv_version","alias_value":"1405.3146v1","created_at":"2026-05-18T02:51:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.3146","created_at":"2026-05-18T02:51:57Z"},{"alias_kind":"pith_short_12","alias_value":"RDBYWBEZUCVV","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RDBYWBEZUCVVUWDY","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RDBYWBEZ","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RDBYWBEZUCVVUWDYYPGOEGYAM2","target":"record","payload":{"canonical_record":{"source":{"id":"1405.3146","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-13T13:42:40Z","cross_cats_sorted":[],"title_canon_sha256":"789a3168192139b83a76098b619f1c4b469188b4e39a1798314600389141ac9f","abstract_canon_sha256":"ce8ade91f7660245f353dfcef87960f5274bb9ce82777f7a1dbbd1e090dbee0e"},"schema_version":"1.0"},"canonical_sha256":"88c38b0499a0ab5a5878c3cce21b0066b5902721e882a4ba79a0446b381474d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:57.660009Z","signature_b64":"cxQqr66l+KcE5vG30zqP9YTVgkzox5nkFy4KgBJI1ameSxIJCBOZ3aRJrbkLJ83LUsxGWOF+kT4nK/MPXm9cAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88c38b0499a0ab5a5878c3cce21b0066b5902721e882a4ba79a0446b381474d7","last_reissued_at":"2026-05-18T02:51:57.659558Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:57.659558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.3146","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:51:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KXzordHjm1SgAIT3sFStwlopOmK/OxYLXC2x7AlqDkhE2Pv7vXP6NEeWQBZPkBKxLtayvE9DIQd9eK23a2IgBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:44:07.620003Z"},"content_sha256":"4c6a2c3764435633be67a9ac088260cb742eb94d0cd8e5ce003763e05caf0063","schema_version":"1.0","event_id":"sha256:4c6a2c3764435633be67a9ac088260cb742eb94d0cd8e5ce003763e05caf0063"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RDBYWBEZUCVVUWDYYPGOEGYAM2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enumeration of polyominoes defined in terms of pattern avoidance or convexity constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniela Battaglino","submitted_at":"2014-05-13T13:42:40Z","abstract_excerpt":"In this thesis, we consider the problem of characterizing and enumerating sets of polyominoes described in terms of some constraints, defined either by convexity or by pattern containment. We are interested in a well known subclass of convex polyominoes, the k-convex polyominoes for which the enumeration according to the semi-perimeter is known only for k=1,2. We obtain, from a recursive decomposition, the generating function of the class of k-convex parallelogram polyominoes, which turns out to be rational. Noting that this generating function can be expressed in terms of the Fibonacci polyno"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.3146","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:51:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2/KzYld87Sw5kXaPUQcple5d/ikBJY8xADpPAM/jW/Nq22wixzCbfY2rtQuNGm08cIv+0kCHULh/ehAuTDmwAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:44:07.620361Z"},"content_sha256":"b3c4943c692524b7fb9cfcc90d4fd876637bc57e4a330f91f996f84854142ae1","schema_version":"1.0","event_id":"sha256:b3c4943c692524b7fb9cfcc90d4fd876637bc57e4a330f91f996f84854142ae1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RDBYWBEZUCVVUWDYYPGOEGYAM2/bundle.json","state_url":"https://pith.science/pith/RDBYWBEZUCVVUWDYYPGOEGYAM2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RDBYWBEZUCVVUWDYYPGOEGYAM2/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-24T17:44:07Z","links":{"resolver":"https://pith.science/pith/RDBYWBEZUCVVUWDYYPGOEGYAM2","bundle":"https://pith.science/pith/RDBYWBEZUCVVUWDYYPGOEGYAM2/bundle.json","state":"https://pith.science/pith/RDBYWBEZUCVVUWDYYPGOEGYAM2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RDBYWBEZUCVVUWDYYPGOEGYAM2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RDBYWBEZUCVVUWDYYPGOEGYAM2","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":"ce8ade91f7660245f353dfcef87960f5274bb9ce82777f7a1dbbd1e090dbee0e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-13T13:42:40Z","title_canon_sha256":"789a3168192139b83a76098b619f1c4b469188b4e39a1798314600389141ac9f"},"schema_version":"1.0","source":{"id":"1405.3146","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.3146","created_at":"2026-05-18T02:51:57Z"},{"alias_kind":"arxiv_version","alias_value":"1405.3146v1","created_at":"2026-05-18T02:51:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.3146","created_at":"2026-05-18T02:51:57Z"},{"alias_kind":"pith_short_12","alias_value":"RDBYWBEZUCVV","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RDBYWBEZUCVVUWDY","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RDBYWBEZ","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:b3c4943c692524b7fb9cfcc90d4fd876637bc57e4a330f91f996f84854142ae1","target":"graph","created_at":"2026-05-18T02:51:57Z","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":"In this thesis, we consider the problem of characterizing and enumerating sets of polyominoes described in terms of some constraints, defined either by convexity or by pattern containment. We are interested in a well known subclass of convex polyominoes, the k-convex polyominoes for which the enumeration according to the semi-perimeter is known only for k=1,2. We obtain, from a recursive decomposition, the generating function of the class of k-convex parallelogram polyominoes, which turns out to be rational. Noting that this generating function can be expressed in terms of the Fibonacci polyno","authors_text":"Daniela Battaglino","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-13T13:42:40Z","title":"Enumeration of polyominoes defined in terms of pattern avoidance or convexity constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.3146","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:4c6a2c3764435633be67a9ac088260cb742eb94d0cd8e5ce003763e05caf0063","target":"record","created_at":"2026-05-18T02:51:57Z","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":"ce8ade91f7660245f353dfcef87960f5274bb9ce82777f7a1dbbd1e090dbee0e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-13T13:42:40Z","title_canon_sha256":"789a3168192139b83a76098b619f1c4b469188b4e39a1798314600389141ac9f"},"schema_version":"1.0","source":{"id":"1405.3146","kind":"arxiv","version":1}},"canonical_sha256":"88c38b0499a0ab5a5878c3cce21b0066b5902721e882a4ba79a0446b381474d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88c38b0499a0ab5a5878c3cce21b0066b5902721e882a4ba79a0446b381474d7","first_computed_at":"2026-05-18T02:51:57.659558Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:57.659558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cxQqr66l+KcE5vG30zqP9YTVgkzox5nkFy4KgBJI1ameSxIJCBOZ3aRJrbkLJ83LUsxGWOF+kT4nK/MPXm9cAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:57.660009Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.3146","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c6a2c3764435633be67a9ac088260cb742eb94d0cd8e5ce003763e05caf0063","sha256:b3c4943c692524b7fb9cfcc90d4fd876637bc57e4a330f91f996f84854142ae1"],"state_sha256":"c59878e1d0d01ab74a2e2fe82da9093e999f8946c7b36e398aec99a2a60cea0e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XPqKYmQ4W+GgGXEsjXWSTGpZHzcnUaFRHYaJe8DwIe1xsQiDX9VMHP30y38lT/Ea6B5hUxAEwUZBySOTZLheCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T17:44:07.622286Z","bundle_sha256":"b6a971d5a93eb5d20cfc73a2dc68efad6a44df612dbd49fd287bc7abcab52ad6"}}