{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:EAED2GHS4TLSMAOWGTC277MGBH","short_pith_number":"pith:EAED2GHS","canonical_record":{"source":{"id":"1105.5704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-28T10:16:54Z","cross_cats_sorted":[],"title_canon_sha256":"50258fb61e4b0cf5860ec0c46ba674c4d6e551d7f498c95ac9e440917e73edf1","abstract_canon_sha256":"1f2014c12a1f90bb792f28d2791b5beeeb2b85bbb7f052d242004a088847d4a7"},"schema_version":"1.0"},"canonical_sha256":"20083d18f2e4d72601d634c5affd8609fff08f760902ff3be6904dcef2584315","source":{"kind":"arxiv","id":"1105.5704","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.5704","created_at":"2026-05-18T04:21:01Z"},{"alias_kind":"arxiv_version","alias_value":"1105.5704v1","created_at":"2026-05-18T04:21:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5704","created_at":"2026-05-18T04:21:01Z"},{"alias_kind":"pith_short_12","alias_value":"EAED2GHS4TLS","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"EAED2GHS4TLSMAOW","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"EAED2GHS","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:EAED2GHS4TLSMAOWGTC277MGBH","target":"record","payload":{"canonical_record":{"source":{"id":"1105.5704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-28T10:16:54Z","cross_cats_sorted":[],"title_canon_sha256":"50258fb61e4b0cf5860ec0c46ba674c4d6e551d7f498c95ac9e440917e73edf1","abstract_canon_sha256":"1f2014c12a1f90bb792f28d2791b5beeeb2b85bbb7f052d242004a088847d4a7"},"schema_version":"1.0"},"canonical_sha256":"20083d18f2e4d72601d634c5affd8609fff08f760902ff3be6904dcef2584315","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:01.756468Z","signature_b64":"BvD5dQCu+M4Eakeb7ci1w+nO8/Zhdm0w+uigqDPlNiSn1u1rc8gIsBCcesEjy8ZkNdfv4WulLyahJK5st6LLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20083d18f2e4d72601d634c5affd8609fff08f760902ff3be6904dcef2584315","last_reissued_at":"2026-05-18T04:21:01.755898Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:01.755898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.5704","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-18T04:21:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c7LHE6RoXFWAFxUDzDfOtdG8DjznjuqatYhNtLeItzGRDHmSkkzymK6184LGOuQHkgK8CbimCbWOZhVItjQ5DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T00:45:37.209823Z"},"content_sha256":"a5ae11fdfb5c14300fbb534f926a19f37cc5a04a75a0f4d706f5c4bbca6f849c","schema_version":"1.0","event_id":"sha256:a5ae11fdfb5c14300fbb534f926a19f37cc5a04a75a0f4d706f5c4bbca6f849c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:EAED2GHS4TLSMAOWGTC277MGBH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Rainbow Connection Number and Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Deepak Rajendraprasad, L.Sunil Chandran, Rogers Mathew","submitted_at":"2011-05-28T10:16:54Z","abstract_excerpt":"Rainbow connection number, $rc(G)$, of a connected graph $G$ is the minimum number of colours needed to colour its edges, so that every pair of vertices is connected by at least one path in which no two edges are coloured the same. In this paper we investigate the relationship of rainbow connection number with vertex and edge connectivity. It is already known that for a connected graph with minimum degree $\\delta$, the rainbow connection number is upper bounded by $3n/(\\delta + 1) + 3$ [Chandran et al., 2010]. This directly gives an upper bound of $3n/(\\lambda + 1) + 3$ and $3n/(\\kappa + 1) + "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5704","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":""},"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-18T04:21:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TXa8uoxNVG7TIjP0AErX4V5B0j84HdwPy/xHmLuvSxiMBWANEI0t8V92sVWMki7fy+mWJr/rqhyn0NOOzyTvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T00:45:37.210165Z"},"content_sha256":"c805603550d757a3e5342581b948937856c2ff56d42b44494bf299d42aa4ce29","schema_version":"1.0","event_id":"sha256:c805603550d757a3e5342581b948937856c2ff56d42b44494bf299d42aa4ce29"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EAED2GHS4TLSMAOWGTC277MGBH/bundle.json","state_url":"https://pith.science/pith/EAED2GHS4TLSMAOWGTC277MGBH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EAED2GHS4TLSMAOWGTC277MGBH/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-27T00:45:37Z","links":{"resolver":"https://pith.science/pith/EAED2GHS4TLSMAOWGTC277MGBH","bundle":"https://pith.science/pith/EAED2GHS4TLSMAOWGTC277MGBH/bundle.json","state":"https://pith.science/pith/EAED2GHS4TLSMAOWGTC277MGBH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EAED2GHS4TLSMAOWGTC277MGBH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:EAED2GHS4TLSMAOWGTC277MGBH","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":"1f2014c12a1f90bb792f28d2791b5beeeb2b85bbb7f052d242004a088847d4a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-28T10:16:54Z","title_canon_sha256":"50258fb61e4b0cf5860ec0c46ba674c4d6e551d7f498c95ac9e440917e73edf1"},"schema_version":"1.0","source":{"id":"1105.5704","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.5704","created_at":"2026-05-18T04:21:01Z"},{"alias_kind":"arxiv_version","alias_value":"1105.5704v1","created_at":"2026-05-18T04:21:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5704","created_at":"2026-05-18T04:21:01Z"},{"alias_kind":"pith_short_12","alias_value":"EAED2GHS4TLS","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"EAED2GHS4TLSMAOW","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"EAED2GHS","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:c805603550d757a3e5342581b948937856c2ff56d42b44494bf299d42aa4ce29","target":"graph","created_at":"2026-05-18T04:21:01Z","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":"Rainbow connection number, $rc(G)$, of a connected graph $G$ is the minimum number of colours needed to colour its edges, so that every pair of vertices is connected by at least one path in which no two edges are coloured the same. In this paper we investigate the relationship of rainbow connection number with vertex and edge connectivity. It is already known that for a connected graph with minimum degree $\\delta$, the rainbow connection number is upper bounded by $3n/(\\delta + 1) + 3$ [Chandran et al., 2010]. This directly gives an upper bound of $3n/(\\lambda + 1) + 3$ and $3n/(\\kappa + 1) + ","authors_text":"Deepak Rajendraprasad, L.Sunil Chandran, Rogers Mathew","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-28T10:16:54Z","title":"On Rainbow Connection Number and Connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5704","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:a5ae11fdfb5c14300fbb534f926a19f37cc5a04a75a0f4d706f5c4bbca6f849c","target":"record","created_at":"2026-05-18T04:21:01Z","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":"1f2014c12a1f90bb792f28d2791b5beeeb2b85bbb7f052d242004a088847d4a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-28T10:16:54Z","title_canon_sha256":"50258fb61e4b0cf5860ec0c46ba674c4d6e551d7f498c95ac9e440917e73edf1"},"schema_version":"1.0","source":{"id":"1105.5704","kind":"arxiv","version":1}},"canonical_sha256":"20083d18f2e4d72601d634c5affd8609fff08f760902ff3be6904dcef2584315","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20083d18f2e4d72601d634c5affd8609fff08f760902ff3be6904dcef2584315","first_computed_at":"2026-05-18T04:21:01.755898Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:21:01.755898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BvD5dQCu+M4Eakeb7ci1w+nO8/Zhdm0w+uigqDPlNiSn1u1rc8gIsBCcesEjy8ZkNdfv4WulLyahJK5st6LLAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:21:01.756468Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.5704","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5ae11fdfb5c14300fbb534f926a19f37cc5a04a75a0f4d706f5c4bbca6f849c","sha256:c805603550d757a3e5342581b948937856c2ff56d42b44494bf299d42aa4ce29"],"state_sha256":"38423d12ce0aff9888678f74c688c2caaba9c8a5a24179219bd83a55731c5d1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xrjnSFP7yfVoVxgdxD/00Gd5su3YcSlg79mGO4fRGKeYP0xsS4HB6AAYPSHosC6c1e4j+bKYoNVLaZlsnUnZDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T00:45:37.212012Z","bundle_sha256":"a35410b9a2fbcbc45eb30b97f0488aff54dcadec547fe0534cb53d6cf5fd6a45"}}