{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CZ76DXV2BBI2M7ZX57HJ5FT3XS","short_pith_number":"pith:CZ76DXV2","canonical_record":{"source":{"id":"2605.25907","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-25T14:42:49Z","cross_cats_sorted":[],"title_canon_sha256":"fc6e88523890194f1ceea648436fdea54a0de600f8ee3b54929b97599a960fd0","abstract_canon_sha256":"ee1bc34ce369b189e896bc9666708d32969fc1b78568d23b66005b6c9ff09500"},"schema_version":"1.0"},"canonical_sha256":"167fe1deba0851a67f37efce9e967bbcaae65abea4d380f163eba8a9eca15490","source":{"kind":"arxiv","id":"2605.25907","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.25907","created_at":"2026-05-26T02:05:17Z"},{"alias_kind":"arxiv_version","alias_value":"2605.25907v1","created_at":"2026-05-26T02:05:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25907","created_at":"2026-05-26T02:05:17Z"},{"alias_kind":"pith_short_12","alias_value":"CZ76DXV2BBI2","created_at":"2026-05-26T02:05:17Z"},{"alias_kind":"pith_short_16","alias_value":"CZ76DXV2BBI2M7ZX","created_at":"2026-05-26T02:05:17Z"},{"alias_kind":"pith_short_8","alias_value":"CZ76DXV2","created_at":"2026-05-26T02:05:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CZ76DXV2BBI2M7ZX57HJ5FT3XS","target":"record","payload":{"canonical_record":{"source":{"id":"2605.25907","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-25T14:42:49Z","cross_cats_sorted":[],"title_canon_sha256":"fc6e88523890194f1ceea648436fdea54a0de600f8ee3b54929b97599a960fd0","abstract_canon_sha256":"ee1bc34ce369b189e896bc9666708d32969fc1b78568d23b66005b6c9ff09500"},"schema_version":"1.0"},"canonical_sha256":"167fe1deba0851a67f37efce9e967bbcaae65abea4d380f163eba8a9eca15490","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:05:17.831985Z","signature_b64":"oc3fLWBibTJ8FccYfX3C821Nq3isvKvexugPAjT2l17iq2vQxdPqTySx/LBNoqARwg1ss6ctwbkXm15MdivBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"167fe1deba0851a67f37efce9e967bbcaae65abea4d380f163eba8a9eca15490","last_reissued_at":"2026-05-26T02:05:17.831183Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:05:17.831183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.25907","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-26T02:05:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GkNJRYajGOPvLlZi6pULpcrV5JAkYrA0yfSZ/rFLNZtMcK3n6sWFDQSa1YBVGJ24l2a/4vMyC2SHzhTYGSNCDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T01:23:53.154341Z"},"content_sha256":"3c261e2524e5dded6ba67cc0c0fcf8cab73b8a3e265300c61f224b14ac443984","schema_version":"1.0","event_id":"sha256:3c261e2524e5dded6ba67cc0c0fcf8cab73b8a3e265300c61f224b14ac443984"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CZ76DXV2BBI2M7ZX57HJ5FT3XS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rainbow panconnectivity in a graph collection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lihua You, Menghan Ma, Xiaoxue Zhang","submitted_at":"2026-05-25T14:42:49Z","abstract_excerpt":"Let $\\mathbf{G}=\\{G_1,\\dots,G_{n-1}\\}$ be a collection of not necessarily distinct $n$-vertex graphs with the same vertex set $V$. A path $P$ with $V(P)\\subseteq V$ and $|E(P)|\\leq n-1$ is rainbow in $\\mathbf{G}$, if there exists an injection $\\phi\\colon E(P)\\to [n-1]$ such that $e\\in E(G_{\\phi(e)})$ for each $e\\in E(P)$. The graph collection $\\mathbf{G}$ is said to be \\emph{rainbow panconnected} if for every pair of vertices $x,y\\in V$, there exists a rainbow path of $k$ vertices joining $x$ and $y$ in $\\mathbf{G}$ for every integer $k\\in \\left[d_{\\mathbf{G}}(x,y)+1, n\\right]$, where $d_{\\mat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.25907","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.25907/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-26T02:05:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j+KoF0ldeeIGyCm6emnc4sGUneyG2+Ip6CLNObZM41XePcXxj12X1qDu18HCs3yvGK4JvSp8fRAFD6YaPOZwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T01:23:53.155098Z"},"content_sha256":"1bd29f3206029069b6588d840d4af82e914396f932a877b0840686a05f306576","schema_version":"1.0","event_id":"sha256:1bd29f3206029069b6588d840d4af82e914396f932a877b0840686a05f306576"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CZ76DXV2BBI2M7ZX57HJ5FT3XS/bundle.json","state_url":"https://pith.science/pith/CZ76DXV2BBI2M7ZX57HJ5FT3XS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CZ76DXV2BBI2M7ZX57HJ5FT3XS/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-12T01:23:53Z","links":{"resolver":"https://pith.science/pith/CZ76DXV2BBI2M7ZX57HJ5FT3XS","bundle":"https://pith.science/pith/CZ76DXV2BBI2M7ZX57HJ5FT3XS/bundle.json","state":"https://pith.science/pith/CZ76DXV2BBI2M7ZX57HJ5FT3XS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CZ76DXV2BBI2M7ZX57HJ5FT3XS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CZ76DXV2BBI2M7ZX57HJ5FT3XS","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":"ee1bc34ce369b189e896bc9666708d32969fc1b78568d23b66005b6c9ff09500","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-25T14:42:49Z","title_canon_sha256":"fc6e88523890194f1ceea648436fdea54a0de600f8ee3b54929b97599a960fd0"},"schema_version":"1.0","source":{"id":"2605.25907","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.25907","created_at":"2026-05-26T02:05:17Z"},{"alias_kind":"arxiv_version","alias_value":"2605.25907v1","created_at":"2026-05-26T02:05:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25907","created_at":"2026-05-26T02:05:17Z"},{"alias_kind":"pith_short_12","alias_value":"CZ76DXV2BBI2","created_at":"2026-05-26T02:05:17Z"},{"alias_kind":"pith_short_16","alias_value":"CZ76DXV2BBI2M7ZX","created_at":"2026-05-26T02:05:17Z"},{"alias_kind":"pith_short_8","alias_value":"CZ76DXV2","created_at":"2026-05-26T02:05:17Z"}],"graph_snapshots":[{"event_id":"sha256:1bd29f3206029069b6588d840d4af82e914396f932a877b0840686a05f306576","target":"graph","created_at":"2026-05-26T02:05:17Z","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.25907/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $\\mathbf{G}=\\{G_1,\\dots,G_{n-1}\\}$ be a collection of not necessarily distinct $n$-vertex graphs with the same vertex set $V$. A path $P$ with $V(P)\\subseteq V$ and $|E(P)|\\leq n-1$ is rainbow in $\\mathbf{G}$, if there exists an injection $\\phi\\colon E(P)\\to [n-1]$ such that $e\\in E(G_{\\phi(e)})$ for each $e\\in E(P)$. The graph collection $\\mathbf{G}$ is said to be \\emph{rainbow panconnected} if for every pair of vertices $x,y\\in V$, there exists a rainbow path of $k$ vertices joining $x$ and $y$ in $\\mathbf{G}$ for every integer $k\\in \\left[d_{\\mathbf{G}}(x,y)+1, n\\right]$, where $d_{\\mat","authors_text":"Lihua You, Menghan Ma, Xiaoxue Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-25T14:42:49Z","title":"Rainbow panconnectivity in a graph collection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.25907","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:3c261e2524e5dded6ba67cc0c0fcf8cab73b8a3e265300c61f224b14ac443984","target":"record","created_at":"2026-05-26T02:05:17Z","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":"ee1bc34ce369b189e896bc9666708d32969fc1b78568d23b66005b6c9ff09500","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-25T14:42:49Z","title_canon_sha256":"fc6e88523890194f1ceea648436fdea54a0de600f8ee3b54929b97599a960fd0"},"schema_version":"1.0","source":{"id":"2605.25907","kind":"arxiv","version":1}},"canonical_sha256":"167fe1deba0851a67f37efce9e967bbcaae65abea4d380f163eba8a9eca15490","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"167fe1deba0851a67f37efce9e967bbcaae65abea4d380f163eba8a9eca15490","first_computed_at":"2026-05-26T02:05:17.831183Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T02:05:17.831183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oc3fLWBibTJ8FccYfX3C821Nq3isvKvexugPAjT2l17iq2vQxdPqTySx/LBNoqARwg1ss6ctwbkXm15MdivBCg==","signature_status":"signed_v1","signed_at":"2026-05-26T02:05:17.831985Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.25907","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c261e2524e5dded6ba67cc0c0fcf8cab73b8a3e265300c61f224b14ac443984","sha256:1bd29f3206029069b6588d840d4af82e914396f932a877b0840686a05f306576"],"state_sha256":"8a6373d5c07b5a2ed71d2b56aeab0ac4de42fd4037a32b53133609f91421d0e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OulJJGtigqS1ZUaC1KL/JrPJvVKL413TzJZc3kBODlKOgzykh9OjFGCV7eIlDN+hpHXwNgvcsFFOxam+4ky8Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T01:23:53.161235Z","bundle_sha256":"e267ee8877074369b40b3327aa5d898bab7a6d7de2398a41c536507459c07607"}}