{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:VB27FMHVFO7PSL75XMSJ7C2QUD","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":"10c4b3c4ede8aa5d19e89ebad78e2989c8f745ddde61964723555dcd356e8720","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-07-17T05:49:39Z","title_canon_sha256":"c9a81db8d85d6579f4b4ec588fd6e89b7e0cd8d56a6ba1c5caa7d75a13e46073"},"schema_version":"1.0","source":{"id":"2407.12323","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.12323","created_at":"2026-07-05T10:22:02Z"},{"alias_kind":"arxiv_version","alias_value":"2407.12323v2","created_at":"2026-07-05T10:22:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.12323","created_at":"2026-07-05T10:22:02Z"},{"alias_kind":"pith_short_12","alias_value":"VB27FMHVFO7P","created_at":"2026-07-05T10:22:02Z"},{"alias_kind":"pith_short_16","alias_value":"VB27FMHVFO7PSL75","created_at":"2026-07-05T10:22:02Z"},{"alias_kind":"pith_short_8","alias_value":"VB27FMHV","created_at":"2026-07-05T10:22:02Z"}],"graph_snapshots":[{"event_id":"sha256:0fd3fda6d27436dff016677f808a9e0296c5b8a0ceb07a52788751a6cdbd85f5","target":"graph","created_at":"2026-07-05T10:22:02Z","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/2407.12323/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An edge-colored multigraph $G$ is rainbow connected if every pair of vertices is joined by at least one rainbow path, i.e., a path where no two edges are of the same color.\n  In the context of multilayered networks we introduce the notion of multilayered random geometric graphs, from $h\\ge 2$ independent random geometric graphs $G(n,r)$ on the unit square. We define an edge-coloring by coloring the edges according to the copy of $G(n,r)$ they belong to and study the rainbow connectivity of the resulting edge-colored multigraph. We show that $r(n)=\\left(\\frac{\\log n}{n}\\right)^{\\frac{h-1}{2h}}$","authors_text":"Josep D\\'iaz, Maria Serna, Oriol Serra, \\\"Oznur Ya\\c{s}ar Diner","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-07-17T05:49:39Z","title":"Rainbow connectivity of multilayered random geometric graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.12323","kind":"arxiv","version":2},"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:edadc743d4cf51656b39711e86c43e01f5c47329cc91b1067f48819cd5467f2a","target":"record","created_at":"2026-07-05T10:22:02Z","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":"10c4b3c4ede8aa5d19e89ebad78e2989c8f745ddde61964723555dcd356e8720","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-07-17T05:49:39Z","title_canon_sha256":"c9a81db8d85d6579f4b4ec588fd6e89b7e0cd8d56a6ba1c5caa7d75a13e46073"},"schema_version":"1.0","source":{"id":"2407.12323","kind":"arxiv","version":2}},"canonical_sha256":"a875f2b0f52bbef92ffdbb249f8b50a0e21bee87f4b07a50cecb26f877aea276","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a875f2b0f52bbef92ffdbb249f8b50a0e21bee87f4b07a50cecb26f877aea276","first_computed_at":"2026-07-05T10:22:02.370921Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:22:02.370921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CshUFtPj9X4CTtqCmA+2R4AtSDq+Kl+xC3WVjHIEp+D+JR8ujS7f6Pb2XQs7L0NEwDKC2npkQW2FsoO6+c1CBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:22:02.371476Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.12323","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:edadc743d4cf51656b39711e86c43e01f5c47329cc91b1067f48819cd5467f2a","sha256:0fd3fda6d27436dff016677f808a9e0296c5b8a0ceb07a52788751a6cdbd85f5"],"state_sha256":"5a5f50564c5e50a6127682b1e125c2f48ad0b1eb8d9152c5f0ff3f210809cfd4"}