{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:WU5PPEFNOHGURI4YLG6L5SERSG","short_pith_number":"pith:WU5PPEFN","canonical_record":{"source":{"id":"2501.10921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-01-19T02:48:29Z","cross_cats_sorted":[],"title_canon_sha256":"9aab21bbd45959afc0e660ad5ac5e3709f48223eed1e842fd2bddea2362bf779","abstract_canon_sha256":"96f9fd77a73e1f08db42f644db289bbcbed5719903cb33bcbe38833658eb515b"},"schema_version":"1.0"},"canonical_sha256":"b53af790ad71cd48a39859bcbec89191ab6d80345d04f8f0fb600ee06feea86d","source":{"kind":"arxiv","id":"2501.10921","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.10921","created_at":"2026-07-05T10:03:00Z"},{"alias_kind":"arxiv_version","alias_value":"2501.10921v1","created_at":"2026-07-05T10:03:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.10921","created_at":"2026-07-05T10:03:00Z"},{"alias_kind":"pith_short_12","alias_value":"WU5PPEFNOHGU","created_at":"2026-07-05T10:03:00Z"},{"alias_kind":"pith_short_16","alias_value":"WU5PPEFNOHGURI4Y","created_at":"2026-07-05T10:03:00Z"},{"alias_kind":"pith_short_8","alias_value":"WU5PPEFN","created_at":"2026-07-05T10:03:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:WU5PPEFNOHGURI4YLG6L5SERSG","target":"record","payload":{"canonical_record":{"source":{"id":"2501.10921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-01-19T02:48:29Z","cross_cats_sorted":[],"title_canon_sha256":"9aab21bbd45959afc0e660ad5ac5e3709f48223eed1e842fd2bddea2362bf779","abstract_canon_sha256":"96f9fd77a73e1f08db42f644db289bbcbed5719903cb33bcbe38833658eb515b"},"schema_version":"1.0"},"canonical_sha256":"b53af790ad71cd48a39859bcbec89191ab6d80345d04f8f0fb600ee06feea86d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:03:00.784058Z","signature_b64":"11udw+NJC6Ikfp/eD4MVV+Gf0Ab/67vHVaWUKhi8ZcTbbRitmyzwpoSt1v2W2UbrkROIfuOQ2xDZXHm3Yq/vDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b53af790ad71cd48a39859bcbec89191ab6d80345d04f8f0fb600ee06feea86d","last_reissued_at":"2026-07-05T10:03:00.783568Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:03:00.783568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.10921","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-05T10:03:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mSrZaaqwma656jJe2QvBDYcNp0Qv19E6j7v6bitF4QM1l01qF8OvG2sw3Q+BhfltUt6zQYTEAWv8LAtinoYrAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T23:22:09.731435Z"},"content_sha256":"39432226b5decb77e979c6b1c13f1eb557f93fce5e87649a43961650c9c09d94","schema_version":"1.0","event_id":"sha256:39432226b5decb77e979c6b1c13f1eb557f93fce5e87649a43961650c9c09d94"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:WU5PPEFNOHGURI4YLG6L5SERSG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semicomplete multipartite weakly distance-regular digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kaishun Wang, Shuang Li, Yuefeng Yang","submitted_at":"2025-01-19T02:48:29Z","abstract_excerpt":"A digraph is semicomplete multipartite if its underlying graph is a complete multipartite graph. As a special case of semicomplete multipartite digraphs, J{\\o}rgensen et al. \\cite{JG14} initiated the study of doubly regular team tournaments. As a natural extension, we introduce doubly regular team semicomplete multipartite digraphs and show that such digraphs fall into three types. Furthermore, we give a characterization of all semicomplete multipartite commutative weakly distance-regular digraphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.10921","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/2501.10921/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-05T10:03:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0cJLx9fa+h6nEeB6mSXxL52y/lQfvu/R/ji+RJcSpRvvVL33XgbQtIklQT84tL1UflwjRlb4m48yBpPlLpVFBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T23:22:09.732012Z"},"content_sha256":"eb202f70a2cc1a81352768e9d2a1b8a5d194207a7c885a36f489b2674bb7f3ee","schema_version":"1.0","event_id":"sha256:eb202f70a2cc1a81352768e9d2a1b8a5d194207a7c885a36f489b2674bb7f3ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WU5PPEFNOHGURI4YLG6L5SERSG/bundle.json","state_url":"https://pith.science/pith/WU5PPEFNOHGURI4YLG6L5SERSG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WU5PPEFNOHGURI4YLG6L5SERSG/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-08-21T23:22:09Z","links":{"resolver":"https://pith.science/pith/WU5PPEFNOHGURI4YLG6L5SERSG","bundle":"https://pith.science/pith/WU5PPEFNOHGURI4YLG6L5SERSG/bundle.json","state":"https://pith.science/pith/WU5PPEFNOHGURI4YLG6L5SERSG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WU5PPEFNOHGURI4YLG6L5SERSG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:WU5PPEFNOHGURI4YLG6L5SERSG","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":"96f9fd77a73e1f08db42f644db289bbcbed5719903cb33bcbe38833658eb515b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-01-19T02:48:29Z","title_canon_sha256":"9aab21bbd45959afc0e660ad5ac5e3709f48223eed1e842fd2bddea2362bf779"},"schema_version":"1.0","source":{"id":"2501.10921","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.10921","created_at":"2026-07-05T10:03:00Z"},{"alias_kind":"arxiv_version","alias_value":"2501.10921v1","created_at":"2026-07-05T10:03:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.10921","created_at":"2026-07-05T10:03:00Z"},{"alias_kind":"pith_short_12","alias_value":"WU5PPEFNOHGU","created_at":"2026-07-05T10:03:00Z"},{"alias_kind":"pith_short_16","alias_value":"WU5PPEFNOHGURI4Y","created_at":"2026-07-05T10:03:00Z"},{"alias_kind":"pith_short_8","alias_value":"WU5PPEFN","created_at":"2026-07-05T10:03:00Z"}],"graph_snapshots":[{"event_id":"sha256:eb202f70a2cc1a81352768e9d2a1b8a5d194207a7c885a36f489b2674bb7f3ee","target":"graph","created_at":"2026-07-05T10:03:00Z","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/2501.10921/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A digraph is semicomplete multipartite if its underlying graph is a complete multipartite graph. As a special case of semicomplete multipartite digraphs, J{\\o}rgensen et al. \\cite{JG14} initiated the study of doubly regular team tournaments. As a natural extension, we introduce doubly regular team semicomplete multipartite digraphs and show that such digraphs fall into three types. Furthermore, we give a characterization of all semicomplete multipartite commutative weakly distance-regular digraphs.","authors_text":"Kaishun Wang, Shuang Li, Yuefeng Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-01-19T02:48:29Z","title":"Semicomplete multipartite weakly distance-regular digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.10921","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:39432226b5decb77e979c6b1c13f1eb557f93fce5e87649a43961650c9c09d94","target":"record","created_at":"2026-07-05T10:03:00Z","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":"96f9fd77a73e1f08db42f644db289bbcbed5719903cb33bcbe38833658eb515b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-01-19T02:48:29Z","title_canon_sha256":"9aab21bbd45959afc0e660ad5ac5e3709f48223eed1e842fd2bddea2362bf779"},"schema_version":"1.0","source":{"id":"2501.10921","kind":"arxiv","version":1}},"canonical_sha256":"b53af790ad71cd48a39859bcbec89191ab6d80345d04f8f0fb600ee06feea86d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b53af790ad71cd48a39859bcbec89191ab6d80345d04f8f0fb600ee06feea86d","first_computed_at":"2026-07-05T10:03:00.783568Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:03:00.783568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"11udw+NJC6Ikfp/eD4MVV+Gf0Ab/67vHVaWUKhi8ZcTbbRitmyzwpoSt1v2W2UbrkROIfuOQ2xDZXHm3Yq/vDw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:03:00.784058Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.10921","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39432226b5decb77e979c6b1c13f1eb557f93fce5e87649a43961650c9c09d94","sha256:eb202f70a2cc1a81352768e9d2a1b8a5d194207a7c885a36f489b2674bb7f3ee"],"state_sha256":"49b72906143d810ce62e6994ca73293ba228e7335e03a0d3a3c53f6320d7751f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zc5ink88+YgevMM8tV4cI6nxVASWXNLOOP9CYAPdyJSMB1AsfKO8KfurtVFzaClzuaRRsH7AnXERJDSWyEOkBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T23:22:09.737392Z","bundle_sha256":"2dabe88dd26516a69324615ee7a42b16ed9209c141913393068e94a3339df88b"}}