{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:6NTGA4GC6YMQGAAJ6WDJRGYTXM","short_pith_number":"pith:6NTGA4GC","canonical_record":{"source":{"id":"2408.09272","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-08-17T19:00:40Z","cross_cats_sorted":[],"title_canon_sha256":"1bac5062a1060689daa537422bc9c156c425dc47b1ec2b86049dbb91155e9f30","abstract_canon_sha256":"20717d8b44c9992de2ff0da86ec797efa79e563d976d8ef53cdbcdf9f4426fa1"},"schema_version":"1.0"},"canonical_sha256":"f3666070c2f619030009f586989b13bb08e9adf4e791f730a9dadf53b2d7936e","source":{"kind":"arxiv","id":"2408.09272","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.09272","created_at":"2026-07-05T09:45:13Z"},{"alias_kind":"arxiv_version","alias_value":"2408.09272v2","created_at":"2026-07-05T09:45:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.09272","created_at":"2026-07-05T09:45:13Z"},{"alias_kind":"pith_short_12","alias_value":"6NTGA4GC6YMQ","created_at":"2026-07-05T09:45:13Z"},{"alias_kind":"pith_short_16","alias_value":"6NTGA4GC6YMQGAAJ","created_at":"2026-07-05T09:45:13Z"},{"alias_kind":"pith_short_8","alias_value":"6NTGA4GC","created_at":"2026-07-05T09:45:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:6NTGA4GC6YMQGAAJ6WDJRGYTXM","target":"record","payload":{"canonical_record":{"source":{"id":"2408.09272","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-08-17T19:00:40Z","cross_cats_sorted":[],"title_canon_sha256":"1bac5062a1060689daa537422bc9c156c425dc47b1ec2b86049dbb91155e9f30","abstract_canon_sha256":"20717d8b44c9992de2ff0da86ec797efa79e563d976d8ef53cdbcdf9f4426fa1"},"schema_version":"1.0"},"canonical_sha256":"f3666070c2f619030009f586989b13bb08e9adf4e791f730a9dadf53b2d7936e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:45:13.470586Z","signature_b64":"pl8rj1Abo3xp5IgXNZ6db7Gyo9enMEd4RWfQxKaiVCku+G2tPgIqlzXnSmw2svB0BbmoM+CzfmP0v9OxmQjNAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3666070c2f619030009f586989b13bb08e9adf4e791f730a9dadf53b2d7936e","last_reissued_at":"2026-07-05T09:45:13.469958Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:45:13.469958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.09272","source_version":2,"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-05T09:45:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ykKvngRvXcULC4/YB0MszaDoVn6NDRMcMqhePvCcJ37C6PR//F8q7cEPohaZi6p0Ljmhxi1IL6bEUoJBZgrHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T02:41:51.793602Z"},"content_sha256":"af4e229f422a5ec25e31d0bf4454162d32ff1f72c67eb5ef1c2c27f62c1ef9b6","schema_version":"1.0","event_id":"sha256:af4e229f422a5ec25e31d0bf4454162d32ff1f72c67eb5ef1c2c27f62c1ef9b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:6NTGA4GC6YMQGAAJ6WDJRGYTXM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An upper bound on the per-tile entropy of ribbon tilings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Simon Blackburn, Vladislav Kargin, Yinsong Chen","submitted_at":"2024-08-17T19:00:40Z","abstract_excerpt":"This paper considers $n$-ribbon tilings of general regions and their per-tile entropy (the binary logarithm of the number of tilings divided by the number of tiles). We show that the per-tile entropy is bounded above by $\\log_2 n$. This bound improves the best previously known bounds of $n-1$ for general regions, and the asymptotic upper bound of $\\log_2 (en)$ for growing rectangles, due to Chen and Kargin."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.09272","kind":"arxiv","version":2},"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/2408.09272/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-05T09:45:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3P6Ivja2A/qeyePxQ6u/GD9pFhSCVqEXKyqfRhTmJe+Zd2hW4vBJeBkq4TtckMGMr+hN2FgL8gI8bQO57G6vCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T02:41:51.794381Z"},"content_sha256":"63d2c4dc80be945cc7f7620c925c2c737f180bfe19023a6dbe92d27ab24adf87","schema_version":"1.0","event_id":"sha256:63d2c4dc80be945cc7f7620c925c2c737f180bfe19023a6dbe92d27ab24adf87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6NTGA4GC6YMQGAAJ6WDJRGYTXM/bundle.json","state_url":"https://pith.science/pith/6NTGA4GC6YMQGAAJ6WDJRGYTXM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6NTGA4GC6YMQGAAJ6WDJRGYTXM/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-07T02:41:51Z","links":{"resolver":"https://pith.science/pith/6NTGA4GC6YMQGAAJ6WDJRGYTXM","bundle":"https://pith.science/pith/6NTGA4GC6YMQGAAJ6WDJRGYTXM/bundle.json","state":"https://pith.science/pith/6NTGA4GC6YMQGAAJ6WDJRGYTXM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6NTGA4GC6YMQGAAJ6WDJRGYTXM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:6NTGA4GC6YMQGAAJ6WDJRGYTXM","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":"20717d8b44c9992de2ff0da86ec797efa79e563d976d8ef53cdbcdf9f4426fa1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-08-17T19:00:40Z","title_canon_sha256":"1bac5062a1060689daa537422bc9c156c425dc47b1ec2b86049dbb91155e9f30"},"schema_version":"1.0","source":{"id":"2408.09272","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.09272","created_at":"2026-07-05T09:45:13Z"},{"alias_kind":"arxiv_version","alias_value":"2408.09272v2","created_at":"2026-07-05T09:45:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.09272","created_at":"2026-07-05T09:45:13Z"},{"alias_kind":"pith_short_12","alias_value":"6NTGA4GC6YMQ","created_at":"2026-07-05T09:45:13Z"},{"alias_kind":"pith_short_16","alias_value":"6NTGA4GC6YMQGAAJ","created_at":"2026-07-05T09:45:13Z"},{"alias_kind":"pith_short_8","alias_value":"6NTGA4GC","created_at":"2026-07-05T09:45:13Z"}],"graph_snapshots":[{"event_id":"sha256:63d2c4dc80be945cc7f7620c925c2c737f180bfe19023a6dbe92d27ab24adf87","target":"graph","created_at":"2026-07-05T09:45:13Z","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/2408.09272/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper considers $n$-ribbon tilings of general regions and their per-tile entropy (the binary logarithm of the number of tilings divided by the number of tiles). We show that the per-tile entropy is bounded above by $\\log_2 n$. This bound improves the best previously known bounds of $n-1$ for general regions, and the asymptotic upper bound of $\\log_2 (en)$ for growing rectangles, due to Chen and Kargin.","authors_text":"Simon Blackburn, Vladislav Kargin, Yinsong Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-08-17T19:00:40Z","title":"An upper bound on the per-tile entropy of ribbon tilings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.09272","kind":"arxiv","version":2},"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:af4e229f422a5ec25e31d0bf4454162d32ff1f72c67eb5ef1c2c27f62c1ef9b6","target":"record","created_at":"2026-07-05T09:45:13Z","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":"20717d8b44c9992de2ff0da86ec797efa79e563d976d8ef53cdbcdf9f4426fa1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-08-17T19:00:40Z","title_canon_sha256":"1bac5062a1060689daa537422bc9c156c425dc47b1ec2b86049dbb91155e9f30"},"schema_version":"1.0","source":{"id":"2408.09272","kind":"arxiv","version":2}},"canonical_sha256":"f3666070c2f619030009f586989b13bb08e9adf4e791f730a9dadf53b2d7936e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3666070c2f619030009f586989b13bb08e9adf4e791f730a9dadf53b2d7936e","first_computed_at":"2026-07-05T09:45:13.469958Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:45:13.469958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pl8rj1Abo3xp5IgXNZ6db7Gyo9enMEd4RWfQxKaiVCku+G2tPgIqlzXnSmw2svB0BbmoM+CzfmP0v9OxmQjNAA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:45:13.470586Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.09272","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af4e229f422a5ec25e31d0bf4454162d32ff1f72c67eb5ef1c2c27f62c1ef9b6","sha256:63d2c4dc80be945cc7f7620c925c2c737f180bfe19023a6dbe92d27ab24adf87"],"state_sha256":"5e96f4c289872d7e7a61363912ac318e5396d9f051d189a1c971af3f9d13bc5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iLYPgaRtqsCBFppQH3PO8vF0dA5sC8Juu1sb2W/tATKHIxyxW2ly3C/JIQDI6DZ+8hrZCqdVvhXatNYURvGOBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T02:41:51.797841Z","bundle_sha256":"865e29d91c24422549c0138c13682bb5299a57585fc41cac66e959fef2b6f3e2"}}