{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:TQ65GWNTVFC75JDGDQXZFRUV4D","short_pith_number":"pith:TQ65GWNT","canonical_record":{"source":{"id":"2104.04558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-04-09T18:36:26Z","cross_cats_sorted":["math.AT","math.GT"],"title_canon_sha256":"0d68dcefbdf56a5d936a14cf66067e2889b847169d32366f0b3f439889f841e8","abstract_canon_sha256":"5ac585232f9efd57c761e0cf2668acc1547a6369092a01c7b221fd0dbf703910"},"schema_version":"1.0"},"canonical_sha256":"9c3dd359b3a945fea4661c2f92c695e0d50a683e23946fd8b24635b14e302757","source":{"kind":"arxiv","id":"2104.04558","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.04558","created_at":"2026-07-05T04:44:27Z"},{"alias_kind":"arxiv_version","alias_value":"2104.04558v1","created_at":"2026-07-05T04:44:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.04558","created_at":"2026-07-05T04:44:27Z"},{"alias_kind":"pith_short_12","alias_value":"TQ65GWNTVFC7","created_at":"2026-07-05T04:44:27Z"},{"alias_kind":"pith_short_16","alias_value":"TQ65GWNTVFC75JDG","created_at":"2026-07-05T04:44:27Z"},{"alias_kind":"pith_short_8","alias_value":"TQ65GWNT","created_at":"2026-07-05T04:44:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:TQ65GWNTVFC75JDGDQXZFRUV4D","target":"record","payload":{"canonical_record":{"source":{"id":"2104.04558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-04-09T18:36:26Z","cross_cats_sorted":["math.AT","math.GT"],"title_canon_sha256":"0d68dcefbdf56a5d936a14cf66067e2889b847169d32366f0b3f439889f841e8","abstract_canon_sha256":"5ac585232f9efd57c761e0cf2668acc1547a6369092a01c7b221fd0dbf703910"},"schema_version":"1.0"},"canonical_sha256":"9c3dd359b3a945fea4661c2f92c695e0d50a683e23946fd8b24635b14e302757","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:44:27.736739Z","signature_b64":"Y2LbBgVXJ9+y+3xqx6cAlZPhv07QnKcnvm47OJfcZc5QAPVXrzFLNt0a5kf00AN/2UXu3V7hJf4MvqrCCyebBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c3dd359b3a945fea4661c2f92c695e0d50a683e23946fd8b24635b14e302757","last_reissued_at":"2026-07-05T04:44:27.736335Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:44:27.736335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2104.04558","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-07-05T04:44:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mn5jqAXhUO+dvPj1RPwH7J1kczV1GNJV/6Qj7H7proXxK5YcyBzyAG7y1FjfXSuVB+5PfmfGdTnUtYXjnAWPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T21:51:32.581971Z"},"content_sha256":"2f7154bd42d9133ade3f6c3461129d7ec775e030908da0dba9ee6bfd4a0daee2","schema_version":"1.0","event_id":"sha256:2f7154bd42d9133ade3f6c3461129d7ec775e030908da0dba9ee6bfd4a0daee2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:TQ65GWNTVFC75JDGDQXZFRUV4D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-dimensional holeyominoes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT","math.GT"],"primary_cat":"math.CO","authors_text":"Erika Roldan, Fedor Manin, Greg Malen","submitted_at":"2021-04-09T18:36:26Z","abstract_excerpt":"What is the maximum number of holes enclosed by a $d$-dimensional polyomino built of $n$ tiles? Represent this number by $f_d(n)$. Recent results show that $f_2(n)/n$ converges to $1/2$. We prove that for all $d \\geq 2$ we have $f_d(n)/n \\to (d-1)/d$ as $n$ goes to infinity. We also construct polyominoes in $d$-dimensional tori with the maximal possible number of holes per tile. In our proofs, we use metaphors from error-correcting codes and dynamical systems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.04558","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2104.04558/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:44:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N63nM5DUu8sw1NEiF5MugCwxEYywlphAaZYAvJ+RQx20Qjxqx55HdYu9kuuLcBPBXL1rsys8lKm8lEMVpTA1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T21:51:32.582625Z"},"content_sha256":"bb744be8550093e2cdbc94b07d250a32a003c150f1f7c9aa9821b2dba5dc6774","schema_version":"1.0","event_id":"sha256:bb744be8550093e2cdbc94b07d250a32a003c150f1f7c9aa9821b2dba5dc6774"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TQ65GWNTVFC75JDGDQXZFRUV4D/bundle.json","state_url":"https://pith.science/pith/TQ65GWNTVFC75JDGDQXZFRUV4D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TQ65GWNTVFC75JDGDQXZFRUV4D/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-07-11T21:51:32Z","links":{"resolver":"https://pith.science/pith/TQ65GWNTVFC75JDGDQXZFRUV4D","bundle":"https://pith.science/pith/TQ65GWNTVFC75JDGDQXZFRUV4D/bundle.json","state":"https://pith.science/pith/TQ65GWNTVFC75JDGDQXZFRUV4D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TQ65GWNTVFC75JDGDQXZFRUV4D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:TQ65GWNTVFC75JDGDQXZFRUV4D","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":"5ac585232f9efd57c761e0cf2668acc1547a6369092a01c7b221fd0dbf703910","cross_cats_sorted":["math.AT","math.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-04-09T18:36:26Z","title_canon_sha256":"0d68dcefbdf56a5d936a14cf66067e2889b847169d32366f0b3f439889f841e8"},"schema_version":"1.0","source":{"id":"2104.04558","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.04558","created_at":"2026-07-05T04:44:27Z"},{"alias_kind":"arxiv_version","alias_value":"2104.04558v1","created_at":"2026-07-05T04:44:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.04558","created_at":"2026-07-05T04:44:27Z"},{"alias_kind":"pith_short_12","alias_value":"TQ65GWNTVFC7","created_at":"2026-07-05T04:44:27Z"},{"alias_kind":"pith_short_16","alias_value":"TQ65GWNTVFC75JDG","created_at":"2026-07-05T04:44:27Z"},{"alias_kind":"pith_short_8","alias_value":"TQ65GWNT","created_at":"2026-07-05T04:44:27Z"}],"graph_snapshots":[{"event_id":"sha256:bb744be8550093e2cdbc94b07d250a32a003c150f1f7c9aa9821b2dba5dc6774","target":"graph","created_at":"2026-07-05T04:44:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2104.04558/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"What is the maximum number of holes enclosed by a $d$-dimensional polyomino built of $n$ tiles? Represent this number by $f_d(n)$. Recent results show that $f_2(n)/n$ converges to $1/2$. We prove that for all $d \\geq 2$ we have $f_d(n)/n \\to (d-1)/d$ as $n$ goes to infinity. We also construct polyominoes in $d$-dimensional tori with the maximal possible number of holes per tile. In our proofs, we use metaphors from error-correcting codes and dynamical systems.","authors_text":"Erika Roldan, Fedor Manin, Greg Malen","cross_cats":["math.AT","math.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-04-09T18:36:26Z","title":"High-dimensional holeyominoes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.04558","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:2f7154bd42d9133ade3f6c3461129d7ec775e030908da0dba9ee6bfd4a0daee2","target":"record","created_at":"2026-07-05T04:44:27Z","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":"5ac585232f9efd57c761e0cf2668acc1547a6369092a01c7b221fd0dbf703910","cross_cats_sorted":["math.AT","math.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-04-09T18:36:26Z","title_canon_sha256":"0d68dcefbdf56a5d936a14cf66067e2889b847169d32366f0b3f439889f841e8"},"schema_version":"1.0","source":{"id":"2104.04558","kind":"arxiv","version":1}},"canonical_sha256":"9c3dd359b3a945fea4661c2f92c695e0d50a683e23946fd8b24635b14e302757","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c3dd359b3a945fea4661c2f92c695e0d50a683e23946fd8b24635b14e302757","first_computed_at":"2026-07-05T04:44:27.736335Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:44:27.736335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y2LbBgVXJ9+y+3xqx6cAlZPhv07QnKcnvm47OJfcZc5QAPVXrzFLNt0a5kf00AN/2UXu3V7hJf4MvqrCCyebBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:44:27.736739Z","signed_message":"canonical_sha256_bytes"},"source_id":"2104.04558","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f7154bd42d9133ade3f6c3461129d7ec775e030908da0dba9ee6bfd4a0daee2","sha256:bb744be8550093e2cdbc94b07d250a32a003c150f1f7c9aa9821b2dba5dc6774"],"state_sha256":"9185066ae15c7a7a4d18825977ac10a17066439004113acfb97d3ec5ef32e64b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bWpOO56niXbivwkPUcboUBYsrK2UoiNdv/FPcKegiNiGQlw3G1AfDyzwvZpRLymYky8apEQoYfcua7cn8dSNAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-11T21:51:32.586087Z","bundle_sha256":"a7e5ee0da51185a07356fdedd749dcedb671592794c4992272b51e201a7dc7fb"}}