{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4I4NTMJNXBZHRJQFNFMEF6NNTW","short_pith_number":"pith:4I4NTMJN","canonical_record":{"source":{"id":"1204.0392","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-02T12:51:34Z","cross_cats_sorted":[],"title_canon_sha256":"cc38d23e3ebfcebdc8589f8fa1a7bd05c51e34d8f540a46fa6bc009646ad867f","abstract_canon_sha256":"8059c52f9493a4e561beba123ac378a94463d7502498287ff95e97eb6a1c6405"},"schema_version":"1.0"},"canonical_sha256":"e238d9b12db87278a605695842f9ad9d91a53f575c37ee57ac9e4a3726bee91c","source":{"kind":"arxiv","id":"1204.0392","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0392","created_at":"2026-05-18T03:58:12Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0392v2","created_at":"2026-05-18T03:58:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0392","created_at":"2026-05-18T03:58:12Z"},{"alias_kind":"pith_short_12","alias_value":"4I4NTMJNXBZH","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4I4NTMJNXBZHRJQF","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4I4NTMJN","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4I4NTMJNXBZHRJQFNFMEF6NNTW","target":"record","payload":{"canonical_record":{"source":{"id":"1204.0392","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-02T12:51:34Z","cross_cats_sorted":[],"title_canon_sha256":"cc38d23e3ebfcebdc8589f8fa1a7bd05c51e34d8f540a46fa6bc009646ad867f","abstract_canon_sha256":"8059c52f9493a4e561beba123ac378a94463d7502498287ff95e97eb6a1c6405"},"schema_version":"1.0"},"canonical_sha256":"e238d9b12db87278a605695842f9ad9d91a53f575c37ee57ac9e4a3726bee91c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:12.289618Z","signature_b64":"7CdhQrnNMzUcbLpJqZOLqoSaANzEX9lIVjp4hPNQZ0m9BKfhfgp5Ur3zzVVPyEd011gNTX+m+PRub7eDEg/GCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e238d9b12db87278a605695842f9ad9d91a53f575c37ee57ac9e4a3726bee91c","last_reissued_at":"2026-05-18T03:58:12.289145Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:12.289145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.0392","source_version":2,"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-18T03:58:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ta2ptv6S97xFAtj3xAoHDok33tJy0wKPB1Bqcez2kX8z/ejWoIWP72Qiv9saWSYigkChTw5ecaMX/4yO81jvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:57:38.633853Z"},"content_sha256":"9af76b5738d2443340c0d172ba7ac28dd2ebfbf4b4a7ca4525c2a15e6e48adc5","schema_version":"1.0","event_id":"sha256:9af76b5738d2443340c0d172ba7ac28dd2ebfbf4b4a7ca4525c2a15e6e48adc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4I4NTMJNXBZHRJQFNFMEF6NNTW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A sharp upper bound for the rainbow 2-connection number of 2-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sujuan Liu, Xueliang Li","submitted_at":"2012-04-02T12:51:34Z","abstract_excerpt":"A path in an edge-colored graph is called {\\em rainbow} if no two edges of it are colored the same. For an $\\ell$-connected graph $G$ and an integer $k$ with $1\\leq k\\leq \\ell$, the {\\em rainbow $k$-connection number} $rc_k(G)$ of $G$ is defined to be the minimum number of colors required to color the edges of $G$ such that every two distinct vertices of $G$ are connected by at least $k$ internally disjoint rainbow paths. Fujita et. al. proposed a problem that what is the minimum constant $\\alpha>0$ such that for all 2-connected graphs $G$ on $n$ vertices, we have $rc_2(G)\\leq \\alpha n$. In th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0392","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-18T03:58:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nqgJxdGgayLo5WnRV4ZxyOfjG1O3vVbbL4iRW4sM8pDlTc0x2hd67/N8gjZXnzb2tNB+dIIx4udGlWHelM2UCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:57:38.634189Z"},"content_sha256":"8a3c1c2212b85efe803d5db0ad5e330ee56a2d044b21ece0c05b7ca42a2300d3","schema_version":"1.0","event_id":"sha256:8a3c1c2212b85efe803d5db0ad5e330ee56a2d044b21ece0c05b7ca42a2300d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4I4NTMJNXBZHRJQFNFMEF6NNTW/bundle.json","state_url":"https://pith.science/pith/4I4NTMJNXBZHRJQFNFMEF6NNTW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4I4NTMJNXBZHRJQFNFMEF6NNTW/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-02T03:57:38Z","links":{"resolver":"https://pith.science/pith/4I4NTMJNXBZHRJQFNFMEF6NNTW","bundle":"https://pith.science/pith/4I4NTMJNXBZHRJQFNFMEF6NNTW/bundle.json","state":"https://pith.science/pith/4I4NTMJNXBZHRJQFNFMEF6NNTW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4I4NTMJNXBZHRJQFNFMEF6NNTW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4I4NTMJNXBZHRJQFNFMEF6NNTW","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":"8059c52f9493a4e561beba123ac378a94463d7502498287ff95e97eb6a1c6405","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-02T12:51:34Z","title_canon_sha256":"cc38d23e3ebfcebdc8589f8fa1a7bd05c51e34d8f540a46fa6bc009646ad867f"},"schema_version":"1.0","source":{"id":"1204.0392","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0392","created_at":"2026-05-18T03:58:12Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0392v2","created_at":"2026-05-18T03:58:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0392","created_at":"2026-05-18T03:58:12Z"},{"alias_kind":"pith_short_12","alias_value":"4I4NTMJNXBZH","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4I4NTMJNXBZHRJQF","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4I4NTMJN","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:8a3c1c2212b85efe803d5db0ad5e330ee56a2d044b21ece0c05b7ca42a2300d3","target":"graph","created_at":"2026-05-18T03:58:12Z","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"},"paper":{"abstract_excerpt":"A path in an edge-colored graph is called {\\em rainbow} if no two edges of it are colored the same. For an $\\ell$-connected graph $G$ and an integer $k$ with $1\\leq k\\leq \\ell$, the {\\em rainbow $k$-connection number} $rc_k(G)$ of $G$ is defined to be the minimum number of colors required to color the edges of $G$ such that every two distinct vertices of $G$ are connected by at least $k$ internally disjoint rainbow paths. Fujita et. al. proposed a problem that what is the minimum constant $\\alpha>0$ such that for all 2-connected graphs $G$ on $n$ vertices, we have $rc_2(G)\\leq \\alpha n$. In th","authors_text":"Sujuan Liu, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-02T12:51:34Z","title":"A sharp upper bound for the rainbow 2-connection number of 2-connected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0392","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:9af76b5738d2443340c0d172ba7ac28dd2ebfbf4b4a7ca4525c2a15e6e48adc5","target":"record","created_at":"2026-05-18T03:58:12Z","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":"8059c52f9493a4e561beba123ac378a94463d7502498287ff95e97eb6a1c6405","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-02T12:51:34Z","title_canon_sha256":"cc38d23e3ebfcebdc8589f8fa1a7bd05c51e34d8f540a46fa6bc009646ad867f"},"schema_version":"1.0","source":{"id":"1204.0392","kind":"arxiv","version":2}},"canonical_sha256":"e238d9b12db87278a605695842f9ad9d91a53f575c37ee57ac9e4a3726bee91c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e238d9b12db87278a605695842f9ad9d91a53f575c37ee57ac9e4a3726bee91c","first_computed_at":"2026-05-18T03:58:12.289145Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:12.289145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7CdhQrnNMzUcbLpJqZOLqoSaANzEX9lIVjp4hPNQZ0m9BKfhfgp5Ur3zzVVPyEd011gNTX+m+PRub7eDEg/GCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:12.289618Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.0392","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9af76b5738d2443340c0d172ba7ac28dd2ebfbf4b4a7ca4525c2a15e6e48adc5","sha256:8a3c1c2212b85efe803d5db0ad5e330ee56a2d044b21ece0c05b7ca42a2300d3"],"state_sha256":"598179902f8eca26917c9c412efbc776d27161fff1a20413029b590902cd7347"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mJNj11wKSxJgjwC8gJ+BfO2/n53fA9cbD0Hmn9cbVInbTM4Y/6GRXKRR9qj0SQmrGkU1HogAUT4P3Q2BRw4+DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T03:57:38.636076Z","bundle_sha256":"25899782811cb48375d740072835ec0e6f2c9b999e523f3b7312425567db0ccf"}}