{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CZ76DXV2BBI2M7ZX57HJ5FT3XS","short_pith_number":"pith:CZ76DXV2","schema_version":"1.0","canonical_sha256":"167fe1deba0851a67f37efce9e967bbcaae65abea4d380f163eba8a9eca15490","source":{"kind":"arxiv","id":"2605.25907","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.25907","created_at":"2026-05-26T02:05:17.831328+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.25907v1","created_at":"2026-05-26T02:05:17.831328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25907","created_at":"2026-05-26T02:05:17.831328+00:00"},{"alias_kind":"pith_short_12","alias_value":"CZ76DXV2BBI2","created_at":"2026-05-26T02:05:17.831328+00:00"},{"alias_kind":"pith_short_16","alias_value":"CZ76DXV2BBI2M7ZX","created_at":"2026-05-26T02:05:17.831328+00:00"},{"alias_kind":"pith_short_8","alias_value":"CZ76DXV2","created_at":"2026-05-26T02:05:17.831328+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CZ76DXV2BBI2M7ZX57HJ5FT3XS","json":"https://pith.science/pith/CZ76DXV2BBI2M7ZX57HJ5FT3XS.json","graph_json":"https://pith.science/api/pith-number/CZ76DXV2BBI2M7ZX57HJ5FT3XS/graph.json","events_json":"https://pith.science/api/pith-number/CZ76DXV2BBI2M7ZX57HJ5FT3XS/events.json","paper":"https://pith.science/paper/CZ76DXV2"},"agent_actions":{"view_html":"https://pith.science/pith/CZ76DXV2BBI2M7ZX57HJ5FT3XS","download_json":"https://pith.science/pith/CZ76DXV2BBI2M7ZX57HJ5FT3XS.json","view_paper":"https://pith.science/paper/CZ76DXV2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.25907&json=true","fetch_graph":"https://pith.science/api/pith-number/CZ76DXV2BBI2M7ZX57HJ5FT3XS/graph.json","fetch_events":"https://pith.science/api/pith-number/CZ76DXV2BBI2M7ZX57HJ5FT3XS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CZ76DXV2BBI2M7ZX57HJ5FT3XS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CZ76DXV2BBI2M7ZX57HJ5FT3XS/action/storage_attestation","attest_author":"https://pith.science/pith/CZ76DXV2BBI2M7ZX57HJ5FT3XS/action/author_attestation","sign_citation":"https://pith.science/pith/CZ76DXV2BBI2M7ZX57HJ5FT3XS/action/citation_signature","submit_replication":"https://pith.science/pith/CZ76DXV2BBI2M7ZX57HJ5FT3XS/action/replication_record"}},"created_at":"2026-05-26T02:05:17.831328+00:00","updated_at":"2026-05-26T02:05:17.831328+00:00"}