{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RLSCKBBABM6NY5M5YQLKAHHTUE","short_pith_number":"pith:RLSCKBBA","canonical_record":{"source":{"id":"1901.03980","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-13T13:26:44Z","cross_cats_sorted":["math.AC","math.NT"],"title_canon_sha256":"8fc1be13435028db54ebe11780001587dd0bda028d306ffd7c672ec9b61aa960","abstract_canon_sha256":"a9cedfac6416a45c6e6e9957c4222cf45d138da8f507f3609e07b43d6dbcb640"},"schema_version":"1.0"},"canonical_sha256":"8ae42504200b3cdc759dc416a01cf3a1347786cd9d23a89bf14e421d431dc2e0","source":{"kind":"arxiv","id":"1901.03980","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03980","created_at":"2026-05-17T23:47:07Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03980v3","created_at":"2026-05-17T23:47:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03980","created_at":"2026-05-17T23:47:07Z"},{"alias_kind":"pith_short_12","alias_value":"RLSCKBBABM6N","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RLSCKBBABM6NY5M5","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RLSCKBBA","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RLSCKBBABM6NY5M5YQLKAHHTUE","target":"record","payload":{"canonical_record":{"source":{"id":"1901.03980","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-13T13:26:44Z","cross_cats_sorted":["math.AC","math.NT"],"title_canon_sha256":"8fc1be13435028db54ebe11780001587dd0bda028d306ffd7c672ec9b61aa960","abstract_canon_sha256":"a9cedfac6416a45c6e6e9957c4222cf45d138da8f507f3609e07b43d6dbcb640"},"schema_version":"1.0"},"canonical_sha256":"8ae42504200b3cdc759dc416a01cf3a1347786cd9d23a89bf14e421d431dc2e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:07.139245Z","signature_b64":"3XKLfiKtuOOHkf4ZIoO7qgMxv/2L2jYoDBT6mZtas/IjliHdGwInEyLOrwsVYu2k+jk+Ct3Ml9CNNtK/Zvn7AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ae42504200b3cdc759dc416a01cf3a1347786cd9d23a89bf14e421d431dc2e0","last_reissued_at":"2026-05-17T23:47:07.138706Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:07.138706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.03980","source_version":3,"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:47:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OLddj2vsLtR/4kvFZUZACq8lkd0HdK2LB4QVday8zw1eRm/PKbZ/jewfcpcREXS3mR/tpjRNuqx0inDf4xLDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T07:51:59.241846Z"},"content_sha256":"ff146707cb54de56f9e338266c812259cd44a82c7b6e35d8e516eb0dcbcaf590","schema_version":"1.0","event_id":"sha256:ff146707cb54de56f9e338266c812259cd44a82c7b6e35d8e516eb0dcbcaf590"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RLSCKBBABM6NY5M5YQLKAHHTUE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On minimal product-one sequences of maximal length over Dihedral and Dicyclic groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.NT"],"primary_cat":"math.CO","authors_text":"Jun Seok Oh, Qinghai Zhong","submitted_at":"2019-01-13T13:26:44Z","abstract_excerpt":"Let $G$ be a finite group. By a sequence over $G$, we mean a finite unordered sequence of terms from $G$, where repetition is allowed, and we say that it is a product-one sequence if its terms can be ordered such that their product equals the identity element of $G$. The large Davenport constant $\\mathsf D (G)$ is the maximal length of a minimal product-one sequence, that is, a product-one sequence which cannot be factored into two non-trivial product-one subsequences. We provide explicit characterizations of all minimal product-one sequences of length $\\mathsf D (G)$ over Dihedral and Dicycli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03980","kind":"arxiv","version":3},"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:47:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ESEomWgQTuXiKylfWVKMi6T/mZ7MFAqahuWIYgfcbf4uKK2v9BAwf8Eu4Yt1YfTZZcvJ0vL0W4PpUYRChFQvBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T07:51:59.242214Z"},"content_sha256":"3c822e39c3ff3e3f290411f200442b0a2432c6dcd14ac5d8ca1c9b24d7b6c1e6","schema_version":"1.0","event_id":"sha256:3c822e39c3ff3e3f290411f200442b0a2432c6dcd14ac5d8ca1c9b24d7b6c1e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RLSCKBBABM6NY5M5YQLKAHHTUE/bundle.json","state_url":"https://pith.science/pith/RLSCKBBABM6NY5M5YQLKAHHTUE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RLSCKBBABM6NY5M5YQLKAHHTUE/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-12T07:51:59Z","links":{"resolver":"https://pith.science/pith/RLSCKBBABM6NY5M5YQLKAHHTUE","bundle":"https://pith.science/pith/RLSCKBBABM6NY5M5YQLKAHHTUE/bundle.json","state":"https://pith.science/pith/RLSCKBBABM6NY5M5YQLKAHHTUE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RLSCKBBABM6NY5M5YQLKAHHTUE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RLSCKBBABM6NY5M5YQLKAHHTUE","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":"a9cedfac6416a45c6e6e9957c4222cf45d138da8f507f3609e07b43d6dbcb640","cross_cats_sorted":["math.AC","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-13T13:26:44Z","title_canon_sha256":"8fc1be13435028db54ebe11780001587dd0bda028d306ffd7c672ec9b61aa960"},"schema_version":"1.0","source":{"id":"1901.03980","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03980","created_at":"2026-05-17T23:47:07Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03980v3","created_at":"2026-05-17T23:47:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03980","created_at":"2026-05-17T23:47:07Z"},{"alias_kind":"pith_short_12","alias_value":"RLSCKBBABM6N","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RLSCKBBABM6NY5M5","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RLSCKBBA","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:3c822e39c3ff3e3f290411f200442b0a2432c6dcd14ac5d8ca1c9b24d7b6c1e6","target":"graph","created_at":"2026-05-17T23:47:07Z","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":"Let $G$ be a finite group. By a sequence over $G$, we mean a finite unordered sequence of terms from $G$, where repetition is allowed, and we say that it is a product-one sequence if its terms can be ordered such that their product equals the identity element of $G$. The large Davenport constant $\\mathsf D (G)$ is the maximal length of a minimal product-one sequence, that is, a product-one sequence which cannot be factored into two non-trivial product-one subsequences. We provide explicit characterizations of all minimal product-one sequences of length $\\mathsf D (G)$ over Dihedral and Dicycli","authors_text":"Jun Seok Oh, Qinghai Zhong","cross_cats":["math.AC","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-13T13:26:44Z","title":"On minimal product-one sequences of maximal length over Dihedral and Dicyclic groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03980","kind":"arxiv","version":3},"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:ff146707cb54de56f9e338266c812259cd44a82c7b6e35d8e516eb0dcbcaf590","target":"record","created_at":"2026-05-17T23:47:07Z","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":"a9cedfac6416a45c6e6e9957c4222cf45d138da8f507f3609e07b43d6dbcb640","cross_cats_sorted":["math.AC","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-13T13:26:44Z","title_canon_sha256":"8fc1be13435028db54ebe11780001587dd0bda028d306ffd7c672ec9b61aa960"},"schema_version":"1.0","source":{"id":"1901.03980","kind":"arxiv","version":3}},"canonical_sha256":"8ae42504200b3cdc759dc416a01cf3a1347786cd9d23a89bf14e421d431dc2e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ae42504200b3cdc759dc416a01cf3a1347786cd9d23a89bf14e421d431dc2e0","first_computed_at":"2026-05-17T23:47:07.138706Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:07.138706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3XKLfiKtuOOHkf4ZIoO7qgMxv/2L2jYoDBT6mZtas/IjliHdGwInEyLOrwsVYu2k+jk+Ct3Ml9CNNtK/Zvn7AQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:07.139245Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.03980","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff146707cb54de56f9e338266c812259cd44a82c7b6e35d8e516eb0dcbcaf590","sha256:3c822e39c3ff3e3f290411f200442b0a2432c6dcd14ac5d8ca1c9b24d7b6c1e6"],"state_sha256":"478bb50d819cf5770fff01149957de41b6efcb5a2878e44cd4c89b9a154b0227"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4lEMoPjY09KPlsye+z3Qb4CjGSFoFNYzPDbi1pK888O66xRwIgmh1qy/4w0wZI6rhU19kLoOzt4mRCAHsT/KBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T07:51:59.244269Z","bundle_sha256":"5ca4007f68c57885efa796c3dfb18a33e79aa1db7d0f1c7546c1883b9a2b86dc"}}