{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TA4SMA3SWISTMBDO7HDWX3S4AV","short_pith_number":"pith:TA4SMA3S","canonical_record":{"source":{"id":"1811.11223","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-27T19:50:49Z","cross_cats_sorted":[],"title_canon_sha256":"f6fe27a43e4b37100a68318c170c0d522404f5698389ca89a9dc05c0a70d3db4","abstract_canon_sha256":"7ef80e3425a5979818b47874e216dc2a5c82c5fe47438bd7a125fb834a67e2d0"},"schema_version":"1.0"},"canonical_sha256":"9839260372b22536046ef9c76bee5c055f4dad579710b328df5a05eb534fdeb5","source":{"kind":"arxiv","id":"1811.11223","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11223","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11223v1","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11223","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"pith_short_12","alias_value":"TA4SMA3SWIST","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TA4SMA3SWISTMBDO","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TA4SMA3S","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TA4SMA3SWISTMBDO7HDWX3S4AV","target":"record","payload":{"canonical_record":{"source":{"id":"1811.11223","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-27T19:50:49Z","cross_cats_sorted":[],"title_canon_sha256":"f6fe27a43e4b37100a68318c170c0d522404f5698389ca89a9dc05c0a70d3db4","abstract_canon_sha256":"7ef80e3425a5979818b47874e216dc2a5c82c5fe47438bd7a125fb834a67e2d0"},"schema_version":"1.0"},"canonical_sha256":"9839260372b22536046ef9c76bee5c055f4dad579710b328df5a05eb534fdeb5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:44.439864Z","signature_b64":"TPlOtBDGiRlqEcTMevF19KXbaSfp3K9XfOSoukyY361G7ez1qkIOR5e3O4fmj6lU8W+VcEcrz0T83Fy//WOSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9839260372b22536046ef9c76bee5c055f4dad579710b328df5a05eb534fdeb5","last_reissued_at":"2026-05-17T23:59:44.439456Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:44.439456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.11223","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-17T23:59:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4m9nOsGPhxivJiEmLf1A7xvb3xeVrhWcj25bJoaZE9hONALpauCtN/31m08Wk+6hhY3ojIXTnJm/7ynk7r+3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T18:18:46.743432Z"},"content_sha256":"c4dc44524da26540d1565b2bf4d84c354d9ce84d9482bc89961f2215125ec947","schema_version":"1.0","event_id":"sha256:c4dc44524da26540d1565b2bf4d84c354d9ce84d9482bc89961f2215125ec947"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TA4SMA3SWISTMBDO7HDWX3S4AV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partial Difference Sets in $C_{2^n} \\times C_{2^n}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ken W. Smith, Martin E. Malandro","submitted_at":"2018-11-27T19:50:49Z","abstract_excerpt":"We give an algorithm for enumerating the regular nontrivial partial difference sets (PDS) in the group $G_n = C_{2^n}\\times C_{2^n}$. We use our algorithm to obtain all of these PDS in $G_n$ for $2\\leq n\\leq 9$, and we obtain partial results for $n=10$ and $n=11$. Most of these PDS are new. For $n\\le 4$ we also identify group-inequivalent PDS. Our approach involves constructing tree diagrams and canonical colorings of these diagrams. Both the total number and the number of group-inequivalent PDS in $G_n$ appear to grow super-exponentially in $n$. For $n=9$, a typical canonical coloring represe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11223","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-17T23:59:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d0OMBqbpZFHM7noWm67nrLFTLcR0sJFPCf5TcV3ZkeI/Px6CM1v4bdyWBsVy4aUuh6V4EnmDCSIjJxqRMwNkCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T18:18:46.743801Z"},"content_sha256":"6770f104679310f01a727626f8e207486618066e69a52d15a461cb9bb5796071","schema_version":"1.0","event_id":"sha256:6770f104679310f01a727626f8e207486618066e69a52d15a461cb9bb5796071"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TA4SMA3SWISTMBDO7HDWX3S4AV/bundle.json","state_url":"https://pith.science/pith/TA4SMA3SWISTMBDO7HDWX3S4AV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TA4SMA3SWISTMBDO7HDWX3S4AV/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-05-29T18:18:46Z","links":{"resolver":"https://pith.science/pith/TA4SMA3SWISTMBDO7HDWX3S4AV","bundle":"https://pith.science/pith/TA4SMA3SWISTMBDO7HDWX3S4AV/bundle.json","state":"https://pith.science/pith/TA4SMA3SWISTMBDO7HDWX3S4AV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TA4SMA3SWISTMBDO7HDWX3S4AV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TA4SMA3SWISTMBDO7HDWX3S4AV","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":"7ef80e3425a5979818b47874e216dc2a5c82c5fe47438bd7a125fb834a67e2d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-27T19:50:49Z","title_canon_sha256":"f6fe27a43e4b37100a68318c170c0d522404f5698389ca89a9dc05c0a70d3db4"},"schema_version":"1.0","source":{"id":"1811.11223","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11223","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11223v1","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11223","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"pith_short_12","alias_value":"TA4SMA3SWIST","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TA4SMA3SWISTMBDO","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TA4SMA3S","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:6770f104679310f01a727626f8e207486618066e69a52d15a461cb9bb5796071","target":"graph","created_at":"2026-05-17T23:59:44Z","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":"We give an algorithm for enumerating the regular nontrivial partial difference sets (PDS) in the group $G_n = C_{2^n}\\times C_{2^n}$. We use our algorithm to obtain all of these PDS in $G_n$ for $2\\leq n\\leq 9$, and we obtain partial results for $n=10$ and $n=11$. Most of these PDS are new. For $n\\le 4$ we also identify group-inequivalent PDS. Our approach involves constructing tree diagrams and canonical colorings of these diagrams. Both the total number and the number of group-inequivalent PDS in $G_n$ appear to grow super-exponentially in $n$. For $n=9$, a typical canonical coloring represe","authors_text":"Ken W. Smith, Martin E. Malandro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-27T19:50:49Z","title":"Partial Difference Sets in $C_{2^n} \\times C_{2^n}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11223","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:c4dc44524da26540d1565b2bf4d84c354d9ce84d9482bc89961f2215125ec947","target":"record","created_at":"2026-05-17T23:59:44Z","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":"7ef80e3425a5979818b47874e216dc2a5c82c5fe47438bd7a125fb834a67e2d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-27T19:50:49Z","title_canon_sha256":"f6fe27a43e4b37100a68318c170c0d522404f5698389ca89a9dc05c0a70d3db4"},"schema_version":"1.0","source":{"id":"1811.11223","kind":"arxiv","version":1}},"canonical_sha256":"9839260372b22536046ef9c76bee5c055f4dad579710b328df5a05eb534fdeb5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9839260372b22536046ef9c76bee5c055f4dad579710b328df5a05eb534fdeb5","first_computed_at":"2026-05-17T23:59:44.439456Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:44.439456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TPlOtBDGiRlqEcTMevF19KXbaSfp3K9XfOSoukyY361G7ez1qkIOR5e3O4fmj6lU8W+VcEcrz0T83Fy//WOSDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:44.439864Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.11223","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4dc44524da26540d1565b2bf4d84c354d9ce84d9482bc89961f2215125ec947","sha256:6770f104679310f01a727626f8e207486618066e69a52d15a461cb9bb5796071"],"state_sha256":"14e7f4783e1cb230bc3f1c150f20476ac3ae37b3d21331ba88c15961af027855"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wo0CzL6eXY+ZLn3xlWVgvarP6A9euJ/sqMf7wEBSOyy/Roh6aeM91GLarJ3qU3VZHeln8iAQjqZJBpkmeARTCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T18:18:46.746896Z","bundle_sha256":"ba2339b793478a20a29cf422bda0c8f51c8e07efe7d2d7033931055af4ad64c8"}}