{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:EM2JHDH3SVVILTR4DYWSWZ7MIL","short_pith_number":"pith:EM2JHDH3","canonical_record":{"source":{"id":"2203.06675","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-03-13T15:09:36Z","cross_cats_sorted":["math.GN"],"title_canon_sha256":"2d19435c24703dedb25f527fa03d6f06bc5cf236b42f56623365e906d51f9f8c","abstract_canon_sha256":"d1a985a68bb38835d28129d857f2af8cd69e292bf539eee314257b941dd2d06e"},"schema_version":"1.0"},"canonical_sha256":"2334938cfb956a85ce3c1e2d2b67ec42c5ea72c6e4d3d1cc6dc68b63f399fc6e","source":{"kind":"arxiv","id":"2203.06675","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.06675","created_at":"2026-07-05T04:04:53Z"},{"alias_kind":"arxiv_version","alias_value":"2203.06675v1","created_at":"2026-07-05T04:04:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.06675","created_at":"2026-07-05T04:04:53Z"},{"alias_kind":"pith_short_12","alias_value":"EM2JHDH3SVVI","created_at":"2026-07-05T04:04:53Z"},{"alias_kind":"pith_short_16","alias_value":"EM2JHDH3SVVILTR4","created_at":"2026-07-05T04:04:53Z"},{"alias_kind":"pith_short_8","alias_value":"EM2JHDH3","created_at":"2026-07-05T04:04:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:EM2JHDH3SVVILTR4DYWSWZ7MIL","target":"record","payload":{"canonical_record":{"source":{"id":"2203.06675","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-03-13T15:09:36Z","cross_cats_sorted":["math.GN"],"title_canon_sha256":"2d19435c24703dedb25f527fa03d6f06bc5cf236b42f56623365e906d51f9f8c","abstract_canon_sha256":"d1a985a68bb38835d28129d857f2af8cd69e292bf539eee314257b941dd2d06e"},"schema_version":"1.0"},"canonical_sha256":"2334938cfb956a85ce3c1e2d2b67ec42c5ea72c6e4d3d1cc6dc68b63f399fc6e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:04:53.576559Z","signature_b64":"tY1Yq+sK4lCjEaMxctTmmLPYtNMi/6Hip23gMLYRnM5SYJ3gfCYMRo/WJfFJCLopzzTdGIoJTr6J7LTXvgwXCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2334938cfb956a85ce3c1e2d2b67ec42c5ea72c6e4d3d1cc6dc68b63f399fc6e","last_reissued_at":"2026-07-05T04:04:53.576136Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:04:53.576136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.06675","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:04:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G3tda/RUu/3+ZwVlDJJWtB5IKt7bc78uonQsvcE6MUW235CpKG3Ukfa8laRgoObHhdiG0fmngeuSk41P0kO/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T06:51:22.817829Z"},"content_sha256":"4c7e5faea233e1d3e1f1b7ade2a9e8652971a62aee363c954859feba42e09df8","schema_version":"1.0","event_id":"sha256:4c7e5faea233e1d3e1f1b7ade2a9e8652971a62aee363c954859feba42e09df8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:EM2JHDH3SVVILTR4DYWSWZ7MIL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clumsy Packing of Polyominoes in Finite Space","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.GN"],"primary_cat":"math.CO","authors_text":"Emma Miller, Mitchel O'Connor, Nathan Shank","submitted_at":"2022-03-13T15:09:36Z","abstract_excerpt":"Clumsy packing is considered an inefficient packing, meaning we find the minimum number of objects we can pack into a space so that we can not pack any more object. Thus we are effectively spacing out the objects as far apart as possible so that we can not fit another object. In this paper we consider clumsy packing of polyominoes in a finite spaces which must consider boundary conditions. We examine rectangle, $L$, $T$, and plus polyominoes of various sizes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.06675","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/2203.06675/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:04:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8qD8l1i27w0v36nMek/gLd2bjkC2WxMyoBTtcJJheCkiC4wGNwk1oDBEaYqbk1SMV+4g/SmrEx8yzbiyqGxbBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T06:51:22.818492Z"},"content_sha256":"a24ffb4c50056d7e2e934201451c40e9ef3d86622464905880d9127665706bf0","schema_version":"1.0","event_id":"sha256:a24ffb4c50056d7e2e934201451c40e9ef3d86622464905880d9127665706bf0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EM2JHDH3SVVILTR4DYWSWZ7MIL/bundle.json","state_url":"https://pith.science/pith/EM2JHDH3SVVILTR4DYWSWZ7MIL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EM2JHDH3SVVILTR4DYWSWZ7MIL/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-09T06:51:22Z","links":{"resolver":"https://pith.science/pith/EM2JHDH3SVVILTR4DYWSWZ7MIL","bundle":"https://pith.science/pith/EM2JHDH3SVVILTR4DYWSWZ7MIL/bundle.json","state":"https://pith.science/pith/EM2JHDH3SVVILTR4DYWSWZ7MIL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EM2JHDH3SVVILTR4DYWSWZ7MIL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:EM2JHDH3SVVILTR4DYWSWZ7MIL","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":"d1a985a68bb38835d28129d857f2af8cd69e292bf539eee314257b941dd2d06e","cross_cats_sorted":["math.GN"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-03-13T15:09:36Z","title_canon_sha256":"2d19435c24703dedb25f527fa03d6f06bc5cf236b42f56623365e906d51f9f8c"},"schema_version":"1.0","source":{"id":"2203.06675","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.06675","created_at":"2026-07-05T04:04:53Z"},{"alias_kind":"arxiv_version","alias_value":"2203.06675v1","created_at":"2026-07-05T04:04:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.06675","created_at":"2026-07-05T04:04:53Z"},{"alias_kind":"pith_short_12","alias_value":"EM2JHDH3SVVI","created_at":"2026-07-05T04:04:53Z"},{"alias_kind":"pith_short_16","alias_value":"EM2JHDH3SVVILTR4","created_at":"2026-07-05T04:04:53Z"},{"alias_kind":"pith_short_8","alias_value":"EM2JHDH3","created_at":"2026-07-05T04:04:53Z"}],"graph_snapshots":[{"event_id":"sha256:a24ffb4c50056d7e2e934201451c40e9ef3d86622464905880d9127665706bf0","target":"graph","created_at":"2026-07-05T04:04:53Z","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/2203.06675/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Clumsy packing is considered an inefficient packing, meaning we find the minimum number of objects we can pack into a space so that we can not pack any more object. Thus we are effectively spacing out the objects as far apart as possible so that we can not fit another object. In this paper we consider clumsy packing of polyominoes in a finite spaces which must consider boundary conditions. We examine rectangle, $L$, $T$, and plus polyominoes of various sizes.","authors_text":"Emma Miller, Mitchel O'Connor, Nathan Shank","cross_cats":["math.GN"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-03-13T15:09:36Z","title":"Clumsy Packing of Polyominoes in Finite Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.06675","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:4c7e5faea233e1d3e1f1b7ade2a9e8652971a62aee363c954859feba42e09df8","target":"record","created_at":"2026-07-05T04:04:53Z","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":"d1a985a68bb38835d28129d857f2af8cd69e292bf539eee314257b941dd2d06e","cross_cats_sorted":["math.GN"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-03-13T15:09:36Z","title_canon_sha256":"2d19435c24703dedb25f527fa03d6f06bc5cf236b42f56623365e906d51f9f8c"},"schema_version":"1.0","source":{"id":"2203.06675","kind":"arxiv","version":1}},"canonical_sha256":"2334938cfb956a85ce3c1e2d2b67ec42c5ea72c6e4d3d1cc6dc68b63f399fc6e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2334938cfb956a85ce3c1e2d2b67ec42c5ea72c6e4d3d1cc6dc68b63f399fc6e","first_computed_at":"2026-07-05T04:04:53.576136Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:04:53.576136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tY1Yq+sK4lCjEaMxctTmmLPYtNMi/6Hip23gMLYRnM5SYJ3gfCYMRo/WJfFJCLopzzTdGIoJTr6J7LTXvgwXCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:04:53.576559Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.06675","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c7e5faea233e1d3e1f1b7ade2a9e8652971a62aee363c954859feba42e09df8","sha256:a24ffb4c50056d7e2e934201451c40e9ef3d86622464905880d9127665706bf0"],"state_sha256":"207d75b310eb9dac54f8c6a521f7979d7179188c6c52904907388d99c2aceb6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4nofS5wO/LYicz2ieykRgtkyYGEf+p5ihrps64xtQA3wnhXEVccGAz8CAuPp7GUZLXz2uwfgER0Qmh8Ju/8iAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T06:51:22.821625Z","bundle_sha256":"00bd0cf8a2d22436e4cd92f2c9e1aa0d1b38a969b2426d7402471a06e7788c43"}}