{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FNMPPDE54AZPQ63IX2FRKAFCLM","short_pith_number":"pith:FNMPPDE5","canonical_record":{"source":{"id":"1301.4583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-19T18:48:17Z","cross_cats_sorted":[],"title_canon_sha256":"5f8bed341f67a379ecd980d9fae58e389a6b05463c6f9532b7b53765db14b5f4","abstract_canon_sha256":"35f69943eed6cebc331d0767a550e582e586bb4759ff81d05d2bcd647af8382d"},"schema_version":"1.0"},"canonical_sha256":"2b58f78c9de032f87b68be8b1500a25b1b6ba52de5e37506759a8c43066f96aa","source":{"kind":"arxiv","id":"1301.4583","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4583","created_at":"2026-05-18T03:35:56Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4583v1","created_at":"2026-05-18T03:35:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4583","created_at":"2026-05-18T03:35:56Z"},{"alias_kind":"pith_short_12","alias_value":"FNMPPDE54AZP","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FNMPPDE54AZPQ63I","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FNMPPDE5","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FNMPPDE54AZPQ63IX2FRKAFCLM","target":"record","payload":{"canonical_record":{"source":{"id":"1301.4583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-19T18:48:17Z","cross_cats_sorted":[],"title_canon_sha256":"5f8bed341f67a379ecd980d9fae58e389a6b05463c6f9532b7b53765db14b5f4","abstract_canon_sha256":"35f69943eed6cebc331d0767a550e582e586bb4759ff81d05d2bcd647af8382d"},"schema_version":"1.0"},"canonical_sha256":"2b58f78c9de032f87b68be8b1500a25b1b6ba52de5e37506759a8c43066f96aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:56.325005Z","signature_b64":"ji+48H/GYAXf0WvsLaNPTg8DRxo/pJrwTBEXY4324/vKUVtMBKxLAUPxREKLqqqpVz1BAm4W2yLahQU+ja62Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b58f78c9de032f87b68be8b1500a25b1b6ba52de5e37506759a8c43066f96aa","last_reissued_at":"2026-05-18T03:35:56.324219Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:56.324219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.4583","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-18T03:35:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5vBwpsK9u3rJf+aqvCE5z9jwNi+VaIB+kjjsVC5VqrYkvgA1E/lvM7xXSCjgEvmwMoLlndhkxpxq60rfZ5qfCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T04:54:06.971376Z"},"content_sha256":"aece805dbff1d0f32154dad0e2bb3d2f58e73349db4512471563ee5276b8dae8","schema_version":"1.0","event_id":"sha256:aece805dbff1d0f32154dad0e2bb3d2f58e73349db4512471563ee5276b8dae8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FNMPPDE54AZPQ63IX2FRKAFCLM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distinguishing partitions of complete multipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Goff","submitted_at":"2013-01-19T18:48:17Z","abstract_excerpt":"A \\textit{distinguishing partition} of a group $X$ with automorphism group ${aut}(X)$ is a partition of $X$ that is fixed by no nontrivial element of ${aut}(X)$. In the event that $X$ is a complete multipartite graph with its automorphism group, the existence of a distinguishing partition is equivalent to the existence of an asymmetric hypergraph with prescribed edge sizes. An asymptotic result is proven on the existence of a distinguishing partition when $X$ is a complete multipartite graph with $m_1$ parts of size $n_1$ and $m_2$ parts of size $n_2$ for small $n_1$, $m_2$ and large $m_1$, $n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4583","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-18T03:35:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sUBh0uS3wJpklIO/WFLl2AK26EB0UmopXdvSr6OGma0NbIcc4cq807sOzui0R3l7tkEhKvccX4JhyVi+OXTiAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T04:54:06.971724Z"},"content_sha256":"68aefed8fb470064dd6cba8fdd080f26b4cb684af072de8cc5fadf278c3eaba0","schema_version":"1.0","event_id":"sha256:68aefed8fb470064dd6cba8fdd080f26b4cb684af072de8cc5fadf278c3eaba0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FNMPPDE54AZPQ63IX2FRKAFCLM/bundle.json","state_url":"https://pith.science/pith/FNMPPDE54AZPQ63IX2FRKAFCLM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FNMPPDE54AZPQ63IX2FRKAFCLM/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-25T04:54:06Z","links":{"resolver":"https://pith.science/pith/FNMPPDE54AZPQ63IX2FRKAFCLM","bundle":"https://pith.science/pith/FNMPPDE54AZPQ63IX2FRKAFCLM/bundle.json","state":"https://pith.science/pith/FNMPPDE54AZPQ63IX2FRKAFCLM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FNMPPDE54AZPQ63IX2FRKAFCLM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FNMPPDE54AZPQ63IX2FRKAFCLM","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":"35f69943eed6cebc331d0767a550e582e586bb4759ff81d05d2bcd647af8382d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-19T18:48:17Z","title_canon_sha256":"5f8bed341f67a379ecd980d9fae58e389a6b05463c6f9532b7b53765db14b5f4"},"schema_version":"1.0","source":{"id":"1301.4583","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4583","created_at":"2026-05-18T03:35:56Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4583v1","created_at":"2026-05-18T03:35:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4583","created_at":"2026-05-18T03:35:56Z"},{"alias_kind":"pith_short_12","alias_value":"FNMPPDE54AZP","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FNMPPDE54AZPQ63I","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FNMPPDE5","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:68aefed8fb470064dd6cba8fdd080f26b4cb684af072de8cc5fadf278c3eaba0","target":"graph","created_at":"2026-05-18T03:35:56Z","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":"A \\textit{distinguishing partition} of a group $X$ with automorphism group ${aut}(X)$ is a partition of $X$ that is fixed by no nontrivial element of ${aut}(X)$. In the event that $X$ is a complete multipartite graph with its automorphism group, the existence of a distinguishing partition is equivalent to the existence of an asymmetric hypergraph with prescribed edge sizes. An asymptotic result is proven on the existence of a distinguishing partition when $X$ is a complete multipartite graph with $m_1$ parts of size $n_1$ and $m_2$ parts of size $n_2$ for small $n_1$, $m_2$ and large $m_1$, $n","authors_text":"Michael Goff","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-19T18:48:17Z","title":"Distinguishing partitions of complete multipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4583","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:aece805dbff1d0f32154dad0e2bb3d2f58e73349db4512471563ee5276b8dae8","target":"record","created_at":"2026-05-18T03:35:56Z","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":"35f69943eed6cebc331d0767a550e582e586bb4759ff81d05d2bcd647af8382d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-19T18:48:17Z","title_canon_sha256":"5f8bed341f67a379ecd980d9fae58e389a6b05463c6f9532b7b53765db14b5f4"},"schema_version":"1.0","source":{"id":"1301.4583","kind":"arxiv","version":1}},"canonical_sha256":"2b58f78c9de032f87b68be8b1500a25b1b6ba52de5e37506759a8c43066f96aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b58f78c9de032f87b68be8b1500a25b1b6ba52de5e37506759a8c43066f96aa","first_computed_at":"2026-05-18T03:35:56.324219Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:56.324219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ji+48H/GYAXf0WvsLaNPTg8DRxo/pJrwTBEXY4324/vKUVtMBKxLAUPxREKLqqqpVz1BAm4W2yLahQU+ja62Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:56.325005Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.4583","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aece805dbff1d0f32154dad0e2bb3d2f58e73349db4512471563ee5276b8dae8","sha256:68aefed8fb470064dd6cba8fdd080f26b4cb684af072de8cc5fadf278c3eaba0"],"state_sha256":"8abf4e590524a239ede6e943852e8586af97e7809505e02225931911877fc7ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IQgVS4Jh7DocEg5MBAgWkCMBpMVnls6lADDAhdLyXkVy3fRQDtHMfXCJoOLPdwsSvExhgmM6VLiFucIGNyAeAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T04:54:06.973629Z","bundle_sha256":"b100ccad3fae791c27b9f5bc70ee42e45b8d162578b734c7a29c98abb05a5aa6"}}