{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:RIN5IPIAA2LKDGZY4SGLCBCJXU","short_pith_number":"pith:RIN5IPIA","canonical_record":{"source":{"id":"2605.28082","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T07:36:46Z","cross_cats_sorted":[],"title_canon_sha256":"c3291c353d3bc6351f8b238214ac52b409f1c90e75974329bb2ed00d2065cc5a","abstract_canon_sha256":"37eb68d772ecefe298d0e7e14e7d84c52e39c4178c68dca3eced6c19394b77bf"},"schema_version":"1.0"},"canonical_sha256":"8a1bd43d000696a19b38e48cb10449bd14e045dd3113ef938df95cded54bd292","source":{"kind":"arxiv","id":"2605.28082","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.28082","created_at":"2026-05-28T01:04:58Z"},{"alias_kind":"arxiv_version","alias_value":"2605.28082v1","created_at":"2026-05-28T01:04:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.28082","created_at":"2026-05-28T01:04:58Z"},{"alias_kind":"pith_short_12","alias_value":"RIN5IPIAA2LK","created_at":"2026-05-28T01:04:58Z"},{"alias_kind":"pith_short_16","alias_value":"RIN5IPIAA2LKDGZY","created_at":"2026-05-28T01:04:58Z"},{"alias_kind":"pith_short_8","alias_value":"RIN5IPIA","created_at":"2026-05-28T01:04:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:RIN5IPIAA2LKDGZY4SGLCBCJXU","target":"record","payload":{"canonical_record":{"source":{"id":"2605.28082","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T07:36:46Z","cross_cats_sorted":[],"title_canon_sha256":"c3291c353d3bc6351f8b238214ac52b409f1c90e75974329bb2ed00d2065cc5a","abstract_canon_sha256":"37eb68d772ecefe298d0e7e14e7d84c52e39c4178c68dca3eced6c19394b77bf"},"schema_version":"1.0"},"canonical_sha256":"8a1bd43d000696a19b38e48cb10449bd14e045dd3113ef938df95cded54bd292","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:04:58.087436Z","signature_b64":"RrK8velWFprtu/jTjKxUsLCEDpYi7raebQbUjT5UcInKOZ7H4h4cLZwRTjtXhbmVyedwJGERtmysVdQzp0YKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a1bd43d000696a19b38e48cb10449bd14e045dd3113ef938df95cded54bd292","last_reissued_at":"2026-05-28T01:04:58.087023Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:04:58.087023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.28082","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-28T01:04:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eCmxTAjTtaPziznDFUzJAy74nrT1sC0VyciC19NOiRNbaEKY7tiybFY+6mljAPNk9yklKrKHFsqjxq7B/KsHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T00:23:33.197239Z"},"content_sha256":"99494e0ffc6fd280899d7fad29cc2774e1f3d271a7cffea7fcc6e486bcfd4ec0","schema_version":"1.0","event_id":"sha256:99494e0ffc6fd280899d7fad29cc2774e1f3d271a7cffea7fcc6e486bcfd4ec0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:RIN5IPIAA2LKDGZY4SGLCBCJXU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two-disjoint-cycle-cover vertex pancyclicity of split-star networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chang Liu, Ruichao Niu, Yuefeng Yang","submitted_at":"2026-05-27T07:36:46Z","abstract_excerpt":"Let $r_1$ and $r_2$ be positive integers with $r_1 \\le r_2$. A graph $G$ is called $2$-DCC vertex $[r_1,r_2]$-pancyclic if, for any two distinct vertices of $G$ and any integer $\\ell \\in [r_1,r_2]$, there exist two vertex-disjoint cycles of lengths $\\ell$ and $|V(G)|-\\ell$, respectively, containing the two vertices separately. In this paper, we investigate the two-disjoint-cycle-cover vertex pancyclicity of the split-star network $S_n^2$. We prove that $S_n^2$ is $2$-DCC vertex $[3,n!/2]$-pancyclic for $n\\ge4$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.28082","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/2605.28082/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-05-28T01:04:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L3FW+9ZG9LzFxEaIieHnKsA4aRndrTtrxsbOecHZOmKhh8izv6vSQiyQRX2ZlAzXN/TfnDXRv7XpcNBJgl1nAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T00:23:33.197990Z"},"content_sha256":"178531a597bfde917fae392720094b465b668186ccf9e0b072424931a51376e1","schema_version":"1.0","event_id":"sha256:178531a597bfde917fae392720094b465b668186ccf9e0b072424931a51376e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RIN5IPIAA2LKDGZY4SGLCBCJXU/bundle.json","state_url":"https://pith.science/pith/RIN5IPIAA2LKDGZY4SGLCBCJXU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RIN5IPIAA2LKDGZY4SGLCBCJXU/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-07T00:23:33Z","links":{"resolver":"https://pith.science/pith/RIN5IPIAA2LKDGZY4SGLCBCJXU","bundle":"https://pith.science/pith/RIN5IPIAA2LKDGZY4SGLCBCJXU/bundle.json","state":"https://pith.science/pith/RIN5IPIAA2LKDGZY4SGLCBCJXU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RIN5IPIAA2LKDGZY4SGLCBCJXU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RIN5IPIAA2LKDGZY4SGLCBCJXU","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":"37eb68d772ecefe298d0e7e14e7d84c52e39c4178c68dca3eced6c19394b77bf","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T07:36:46Z","title_canon_sha256":"c3291c353d3bc6351f8b238214ac52b409f1c90e75974329bb2ed00d2065cc5a"},"schema_version":"1.0","source":{"id":"2605.28082","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.28082","created_at":"2026-05-28T01:04:58Z"},{"alias_kind":"arxiv_version","alias_value":"2605.28082v1","created_at":"2026-05-28T01:04:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.28082","created_at":"2026-05-28T01:04:58Z"},{"alias_kind":"pith_short_12","alias_value":"RIN5IPIAA2LK","created_at":"2026-05-28T01:04:58Z"},{"alias_kind":"pith_short_16","alias_value":"RIN5IPIAA2LKDGZY","created_at":"2026-05-28T01:04:58Z"},{"alias_kind":"pith_short_8","alias_value":"RIN5IPIA","created_at":"2026-05-28T01:04:58Z"}],"graph_snapshots":[{"event_id":"sha256:178531a597bfde917fae392720094b465b668186ccf9e0b072424931a51376e1","target":"graph","created_at":"2026-05-28T01:04:58Z","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/2605.28082/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $r_1$ and $r_2$ be positive integers with $r_1 \\le r_2$. A graph $G$ is called $2$-DCC vertex $[r_1,r_2]$-pancyclic if, for any two distinct vertices of $G$ and any integer $\\ell \\in [r_1,r_2]$, there exist two vertex-disjoint cycles of lengths $\\ell$ and $|V(G)|-\\ell$, respectively, containing the two vertices separately. In this paper, we investigate the two-disjoint-cycle-cover vertex pancyclicity of the split-star network $S_n^2$. We prove that $S_n^2$ is $2$-DCC vertex $[3,n!/2]$-pancyclic for $n\\ge4$.","authors_text":"Chang Liu, Ruichao Niu, Yuefeng Yang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T07:36:46Z","title":"Two-disjoint-cycle-cover vertex pancyclicity of split-star networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.28082","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:99494e0ffc6fd280899d7fad29cc2774e1f3d271a7cffea7fcc6e486bcfd4ec0","target":"record","created_at":"2026-05-28T01:04:58Z","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":"37eb68d772ecefe298d0e7e14e7d84c52e39c4178c68dca3eced6c19394b77bf","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T07:36:46Z","title_canon_sha256":"c3291c353d3bc6351f8b238214ac52b409f1c90e75974329bb2ed00d2065cc5a"},"schema_version":"1.0","source":{"id":"2605.28082","kind":"arxiv","version":1}},"canonical_sha256":"8a1bd43d000696a19b38e48cb10449bd14e045dd3113ef938df95cded54bd292","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a1bd43d000696a19b38e48cb10449bd14e045dd3113ef938df95cded54bd292","first_computed_at":"2026-05-28T01:04:58.087023Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T01:04:58.087023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RrK8velWFprtu/jTjKxUsLCEDpYi7raebQbUjT5UcInKOZ7H4h4cLZwRTjtXhbmVyedwJGERtmysVdQzp0YKCg==","signature_status":"signed_v1","signed_at":"2026-05-28T01:04:58.087436Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.28082","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99494e0ffc6fd280899d7fad29cc2774e1f3d271a7cffea7fcc6e486bcfd4ec0","sha256:178531a597bfde917fae392720094b465b668186ccf9e0b072424931a51376e1"],"state_sha256":"94ff3b2108825d5fc74cb083fce1e78c8077a212ce497bbf3b73010168d7ffed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"07Y2TCCP8nlSVYA5jk3XE59fQD/7PnyZSvh8bD9p8+3BmdXxhigCl+Nr8VvpGntQYv/gASY6Hjyv2uw75B17Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T00:23:33.202170Z","bundle_sha256":"0527c99849024dc5b5a93d36fe3145b71322cc0e0612acf632c7757059f622dc"}}