{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UWTNF75HI3DAWBAQT22IBNDV2O","short_pith_number":"pith:UWTNF75H","canonical_record":{"source":{"id":"1503.07184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-24T20:17:32Z","cross_cats_sorted":[],"title_canon_sha256":"0e703344563b2d5c4a1301dfd9ef73b47e3187cf18ceaf376fe421b2db4078a0","abstract_canon_sha256":"4e09213bf06f7fb690c08ddce45a5e05d921d9869bca4126ed4f507dd5ed5e87"},"schema_version":"1.0"},"canonical_sha256":"a5a6d2ffa746c60b04109eb480b475d3a60ce301f71c0b7392cce5cb894b98f8","source":{"kind":"arxiv","id":"1503.07184","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07184","created_at":"2026-05-18T02:20:28Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07184v1","created_at":"2026-05-18T02:20:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07184","created_at":"2026-05-18T02:20:28Z"},{"alias_kind":"pith_short_12","alias_value":"UWTNF75HI3DA","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UWTNF75HI3DAWBAQ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UWTNF75H","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UWTNF75HI3DAWBAQT22IBNDV2O","target":"record","payload":{"canonical_record":{"source":{"id":"1503.07184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-24T20:17:32Z","cross_cats_sorted":[],"title_canon_sha256":"0e703344563b2d5c4a1301dfd9ef73b47e3187cf18ceaf376fe421b2db4078a0","abstract_canon_sha256":"4e09213bf06f7fb690c08ddce45a5e05d921d9869bca4126ed4f507dd5ed5e87"},"schema_version":"1.0"},"canonical_sha256":"a5a6d2ffa746c60b04109eb480b475d3a60ce301f71c0b7392cce5cb894b98f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:28.104871Z","signature_b64":"NTxaAmL2d8mTsHtZ1XzsImuCkwqNjUkWiQlXN45H7uOzQzGb3qNSamaYjYeeuDtXNSpYjgGzFFwRvE42Yun1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5a6d2ffa746c60b04109eb480b475d3a60ce301f71c0b7392cce5cb894b98f8","last_reissued_at":"2026-05-18T02:20:28.104144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:28.104144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.07184","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:20:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vik+uIvqEIXmEQjZ1Ia1qNbfDR1uL4uec5CrTNbPLGpxgreDjChAXXbwbWjMN6aKNnqQBHApvw1ZHrCE8Gc8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T22:05:42.411384Z"},"content_sha256":"0f217b67d5c53834d90842fd960e7e458cb1a9a8d2607d163e163edc76b42759","schema_version":"1.0","event_id":"sha256:0f217b67d5c53834d90842fd960e7e458cb1a9a8d2607d163e163edc76b42759"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UWTNF75HI3DAWBAQT22IBNDV2O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Automorphisms of $S_6$ and the Colored Cubes Puzzle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Condon, David Cervantes Nava, Ethan Berkove, Rachel Katz","submitted_at":"2015-03-24T20:17:32Z","abstract_excerpt":"Given a palette of six colors, a colored cube is a cube where each face is colored with exactly one color and each color appears on some face. Starting with an arbitrary collection of unit length colored cubes, one can try to arrange a subset of the collection into an $n \\times n \\times n$ cube where each face is a single color. This is the Colored Cubes Puzzle. In this paper, we determine minimum size sets of cubes required to complete an $n \\times n \\times n$ cube's frame, its corners and edges. We answer this problem for all $n$, and in particular show that for $n \\geq4$ one has the best po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07184","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:20:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hjjkRDT3gId0YzreF+R3aTFHLQ2jlzEoRY+exVNJ8MlwrxBMmA2GkraVQrsqYXTqq5HIoA/5ZVPe/NtKpUk4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T22:05:42.411739Z"},"content_sha256":"331373e775b60d404ac0bd35e94fd312678c2d2736eaa447a88fda4f4beb02d8","schema_version":"1.0","event_id":"sha256:331373e775b60d404ac0bd35e94fd312678c2d2736eaa447a88fda4f4beb02d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UWTNF75HI3DAWBAQT22IBNDV2O/bundle.json","state_url":"https://pith.science/pith/UWTNF75HI3DAWBAQT22IBNDV2O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UWTNF75HI3DAWBAQT22IBNDV2O/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-23T22:05:42Z","links":{"resolver":"https://pith.science/pith/UWTNF75HI3DAWBAQT22IBNDV2O","bundle":"https://pith.science/pith/UWTNF75HI3DAWBAQT22IBNDV2O/bundle.json","state":"https://pith.science/pith/UWTNF75HI3DAWBAQT22IBNDV2O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UWTNF75HI3DAWBAQT22IBNDV2O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UWTNF75HI3DAWBAQT22IBNDV2O","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":"4e09213bf06f7fb690c08ddce45a5e05d921d9869bca4126ed4f507dd5ed5e87","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-24T20:17:32Z","title_canon_sha256":"0e703344563b2d5c4a1301dfd9ef73b47e3187cf18ceaf376fe421b2db4078a0"},"schema_version":"1.0","source":{"id":"1503.07184","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07184","created_at":"2026-05-18T02:20:28Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07184v1","created_at":"2026-05-18T02:20:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07184","created_at":"2026-05-18T02:20:28Z"},{"alias_kind":"pith_short_12","alias_value":"UWTNF75HI3DA","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UWTNF75HI3DAWBAQ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UWTNF75H","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:331373e775b60d404ac0bd35e94fd312678c2d2736eaa447a88fda4f4beb02d8","target":"graph","created_at":"2026-05-18T02:20:28Z","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":"Given a palette of six colors, a colored cube is a cube where each face is colored with exactly one color and each color appears on some face. Starting with an arbitrary collection of unit length colored cubes, one can try to arrange a subset of the collection into an $n \\times n \\times n$ cube where each face is a single color. This is the Colored Cubes Puzzle. In this paper, we determine minimum size sets of cubes required to complete an $n \\times n \\times n$ cube's frame, its corners and edges. We answer this problem for all $n$, and in particular show that for $n \\geq4$ one has the best po","authors_text":"Daniel Condon, David Cervantes Nava, Ethan Berkove, Rachel Katz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-24T20:17:32Z","title":"Automorphisms of $S_6$ and the Colored Cubes Puzzle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07184","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:0f217b67d5c53834d90842fd960e7e458cb1a9a8d2607d163e163edc76b42759","target":"record","created_at":"2026-05-18T02:20:28Z","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":"4e09213bf06f7fb690c08ddce45a5e05d921d9869bca4126ed4f507dd5ed5e87","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-24T20:17:32Z","title_canon_sha256":"0e703344563b2d5c4a1301dfd9ef73b47e3187cf18ceaf376fe421b2db4078a0"},"schema_version":"1.0","source":{"id":"1503.07184","kind":"arxiv","version":1}},"canonical_sha256":"a5a6d2ffa746c60b04109eb480b475d3a60ce301f71c0b7392cce5cb894b98f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5a6d2ffa746c60b04109eb480b475d3a60ce301f71c0b7392cce5cb894b98f8","first_computed_at":"2026-05-18T02:20:28.104144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:28.104144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NTxaAmL2d8mTsHtZ1XzsImuCkwqNjUkWiQlXN45H7uOzQzGb3qNSamaYjYeeuDtXNSpYjgGzFFwRvE42Yun1AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:28.104871Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.07184","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f217b67d5c53834d90842fd960e7e458cb1a9a8d2607d163e163edc76b42759","sha256:331373e775b60d404ac0bd35e94fd312678c2d2736eaa447a88fda4f4beb02d8"],"state_sha256":"d26730aff048c8f358749105bebe9708e6f64a2b6dce634ef1ca00d82711a4bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VZKa5dIbro5ereoKEzn9G8fia5bBmn3/xz8WrMqQiEoGNhbsbYQY3UGpup2vmu/l8KzmGe/Pa/xPz2rBzcYdDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T22:05:42.413653Z","bundle_sha256":"9fcdd2d42332e66cd80c64a585eafee74721bbc8754e23d18aad51446be27be0"}}