{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:SVC6UUM62AJ6XNLU7GDU4GYOPJ","short_pith_number":"pith:SVC6UUM6","canonical_record":{"source":{"id":"1110.1268","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-05T06:38:07Z","cross_cats_sorted":[],"title_canon_sha256":"480c27528b8b05d2680e506ae983bb85c58922d53def65a9d79e5b66acd32432","abstract_canon_sha256":"9242d7ce4d16211e913dd09dcf5823dd6fdb84c25e89478581813420c40f026c"},"schema_version":"1.0"},"canonical_sha256":"9545ea519ed013ebb574f9874e1b0e7a58c6ebca0b71af5157dca8161a9d3e42","source":{"kind":"arxiv","id":"1110.1268","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.1268","created_at":"2026-05-18T04:11:32Z"},{"alias_kind":"arxiv_version","alias_value":"1110.1268v1","created_at":"2026-05-18T04:11:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1268","created_at":"2026-05-18T04:11:32Z"},{"alias_kind":"pith_short_12","alias_value":"SVC6UUM62AJ6","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SVC6UUM62AJ6XNLU","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SVC6UUM6","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:SVC6UUM62AJ6XNLU7GDU4GYOPJ","target":"record","payload":{"canonical_record":{"source":{"id":"1110.1268","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-05T06:38:07Z","cross_cats_sorted":[],"title_canon_sha256":"480c27528b8b05d2680e506ae983bb85c58922d53def65a9d79e5b66acd32432","abstract_canon_sha256":"9242d7ce4d16211e913dd09dcf5823dd6fdb84c25e89478581813420c40f026c"},"schema_version":"1.0"},"canonical_sha256":"9545ea519ed013ebb574f9874e1b0e7a58c6ebca0b71af5157dca8161a9d3e42","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:32.390009Z","signature_b64":"JQRRiAowdgr3XRWxuGJmg7YW/NYsgmEMSZCeMB4STf/vq9mQ9wBxk5vtdq2oHQ76qafMZSySLJUTGJ7ItlECCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9545ea519ed013ebb574f9874e1b0e7a58c6ebca0b71af5157dca8161a9d3e42","last_reissued_at":"2026-05-18T04:11:32.389332Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:32.389332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.1268","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:11:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KNjd4Rymm+5T/3cakejRdF9kaFR4NDCPt50180Zt0EI4lHiKfuLmH8tfDr9ljLLOTS4pd9zsQf31Y6aR6juMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:06:13.931302Z"},"content_sha256":"c07b1933aad0987a0ecd3e7f0e5ff90096154c9dcedcc841972564efdee2bdd8","schema_version":"1.0","event_id":"sha256:c07b1933aad0987a0ecd3e7f0e5ff90096154c9dcedcc841972564efdee2bdd8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:SVC6UUM62AJ6XNLU7GDU4GYOPJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Note on rainbow connection number of dense graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jiuying Dong, Xueliang Li","submitted_at":"2011-10-05T06:38:07Z","abstract_excerpt":"An edge-colored graph $G$ is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph $G$, denoted by $rc(G)$, is the smallest number of colors that are needed in order to make $G$ rainbow connected. Following an idea of Caro et al., in this paper we also investigate the rainbow connection number of dense graphs. We show that for $k\\geq 2$, if $G$ is a non-complete graph of order $n$ with minimum degree $\\delta (G)\\geq \\frac{n}{2}-1+log_{k}{n}$, or minimum degree-sum $\\sigma_{2}(G)\\geq n-2+2log_{k}{n}$, t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1268","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:11:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l3c0yw7ED0GN6jBBYT5HYklNaKKBdsxkgeqc8CxHQJngBEkU1qxZIkfzYzokt8+gJHww+Iazh3z3EX5n50hFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:06:13.931676Z"},"content_sha256":"a64f985fb879204a3937faa4519612e856bc7099b0f87f7b1cc08257eeb0f28b","schema_version":"1.0","event_id":"sha256:a64f985fb879204a3937faa4519612e856bc7099b0f87f7b1cc08257eeb0f28b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SVC6UUM62AJ6XNLU7GDU4GYOPJ/bundle.json","state_url":"https://pith.science/pith/SVC6UUM62AJ6XNLU7GDU4GYOPJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SVC6UUM62AJ6XNLU7GDU4GYOPJ/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-01T20:06:13Z","links":{"resolver":"https://pith.science/pith/SVC6UUM62AJ6XNLU7GDU4GYOPJ","bundle":"https://pith.science/pith/SVC6UUM62AJ6XNLU7GDU4GYOPJ/bundle.json","state":"https://pith.science/pith/SVC6UUM62AJ6XNLU7GDU4GYOPJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SVC6UUM62AJ6XNLU7GDU4GYOPJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:SVC6UUM62AJ6XNLU7GDU4GYOPJ","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":"9242d7ce4d16211e913dd09dcf5823dd6fdb84c25e89478581813420c40f026c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-05T06:38:07Z","title_canon_sha256":"480c27528b8b05d2680e506ae983bb85c58922d53def65a9d79e5b66acd32432"},"schema_version":"1.0","source":{"id":"1110.1268","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.1268","created_at":"2026-05-18T04:11:32Z"},{"alias_kind":"arxiv_version","alias_value":"1110.1268v1","created_at":"2026-05-18T04:11:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1268","created_at":"2026-05-18T04:11:32Z"},{"alias_kind":"pith_short_12","alias_value":"SVC6UUM62AJ6","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SVC6UUM62AJ6XNLU","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SVC6UUM6","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:a64f985fb879204a3937faa4519612e856bc7099b0f87f7b1cc08257eeb0f28b","target":"graph","created_at":"2026-05-18T04:11:32Z","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":"An edge-colored graph $G$ is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph $G$, denoted by $rc(G)$, is the smallest number of colors that are needed in order to make $G$ rainbow connected. Following an idea of Caro et al., in this paper we also investigate the rainbow connection number of dense graphs. We show that for $k\\geq 2$, if $G$ is a non-complete graph of order $n$ with minimum degree $\\delta (G)\\geq \\frac{n}{2}-1+log_{k}{n}$, or minimum degree-sum $\\sigma_{2}(G)\\geq n-2+2log_{k}{n}$, t","authors_text":"Jiuying Dong, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-05T06:38:07Z","title":"Note on rainbow connection number of dense graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1268","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:c07b1933aad0987a0ecd3e7f0e5ff90096154c9dcedcc841972564efdee2bdd8","target":"record","created_at":"2026-05-18T04:11:32Z","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":"9242d7ce4d16211e913dd09dcf5823dd6fdb84c25e89478581813420c40f026c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-05T06:38:07Z","title_canon_sha256":"480c27528b8b05d2680e506ae983bb85c58922d53def65a9d79e5b66acd32432"},"schema_version":"1.0","source":{"id":"1110.1268","kind":"arxiv","version":1}},"canonical_sha256":"9545ea519ed013ebb574f9874e1b0e7a58c6ebca0b71af5157dca8161a9d3e42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9545ea519ed013ebb574f9874e1b0e7a58c6ebca0b71af5157dca8161a9d3e42","first_computed_at":"2026-05-18T04:11:32.389332Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:32.389332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JQRRiAowdgr3XRWxuGJmg7YW/NYsgmEMSZCeMB4STf/vq9mQ9wBxk5vtdq2oHQ76qafMZSySLJUTGJ7ItlECCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:32.390009Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.1268","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c07b1933aad0987a0ecd3e7f0e5ff90096154c9dcedcc841972564efdee2bdd8","sha256:a64f985fb879204a3937faa4519612e856bc7099b0f87f7b1cc08257eeb0f28b"],"state_sha256":"8bfe43e76006d184b467dfb613391927caf60ab5ff6348db2dd8f0c34341f5a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mhMJfmUn6LGeEZL5uVdA0JyyNQgem1xwilRDheuWYRg7QYY+t/ePCi0TNFh00HCl93CBDZsEKaA5Br1l6OYsCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:06:13.933775Z","bundle_sha256":"a2c0fd3be7666e3fa5822ad14c99b84a90d99c0b0adf0ef9bc0b2b1098d33e43"}}