{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:H2TQTWMM3TZ5RUYHYQ5YVVIIMT","short_pith_number":"pith:H2TQTWMM","canonical_record":{"source":{"id":"1010.6139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-29T07:19:45Z","cross_cats_sorted":[],"title_canon_sha256":"f435de6154f3412168c33c3bfb6452ffe54663bf202813ca0cfe32be8d575f3f","abstract_canon_sha256":"b1fa2926507a85fb8211cf6f04c33339015a9ed328ff6f9ce86eb4d4ec9f7edf"},"schema_version":"1.0"},"canonical_sha256":"3ea709d98cdcf3d8d307c43b8ad50864c08db2beea83361b29e56151380a3d90","source":{"kind":"arxiv","id":"1010.6139","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.6139","created_at":"2026-05-18T04:38:07Z"},{"alias_kind":"arxiv_version","alias_value":"1010.6139v1","created_at":"2026-05-18T04:38:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.6139","created_at":"2026-05-18T04:38:07Z"},{"alias_kind":"pith_short_12","alias_value":"H2TQTWMM3TZ5","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"H2TQTWMM3TZ5RUYH","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"H2TQTWMM","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:H2TQTWMM3TZ5RUYHYQ5YVVIIMT","target":"record","payload":{"canonical_record":{"source":{"id":"1010.6139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-29T07:19:45Z","cross_cats_sorted":[],"title_canon_sha256":"f435de6154f3412168c33c3bfb6452ffe54663bf202813ca0cfe32be8d575f3f","abstract_canon_sha256":"b1fa2926507a85fb8211cf6f04c33339015a9ed328ff6f9ce86eb4d4ec9f7edf"},"schema_version":"1.0"},"canonical_sha256":"3ea709d98cdcf3d8d307c43b8ad50864c08db2beea83361b29e56151380a3d90","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:38:07.410646Z","signature_b64":"70Gt2HuTQ4p86lj4MzkHJu9klNqTGSEn0ES3KS0U5qFBj8ULjIawF9LEMV3g3EZJzk/MzHbAsgq77T+aWbCzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ea709d98cdcf3d8d307c43b8ad50864c08db2beea83361b29e56151380a3d90","last_reissued_at":"2026-05-18T04:38:07.410217Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:38:07.410217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.6139","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:38:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"adFK5+TuuL5t9hCCOkOfdBD/d85Z5HcHPBHEgfJxEn12HbUpRe6oNe5X4x0ZXU6QktHiLK7uD7OgPaXsaR7YBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:18:59.580875Z"},"content_sha256":"c683c5db7495d3f98244b4b8ab479976f19cd373457589dd5af936aa08d8985c","schema_version":"1.0","event_id":"sha256:c683c5db7495d3f98244b4b8ab479976f19cd373457589dd5af936aa08d8985c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:H2TQTWMM3TZ5RUYHYQ5YVVIIMT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On strong rainbow connection number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xueliang Li, Yuefang Sun","submitted_at":"2010-10-29T07:19:45Z","abstract_excerpt":"A path in an edge-colored graph, where adjacent edges may be colored the same, is a rainbow path if no two edges of it are colored the same. For any two vertices $u$ and $v$ of $G$, a rainbow $u-v$ geodesic in $G$ is a rainbow $u-v$ path of length $d(u,v)$, where $d(u,v)$ is the distance between $u$ and $v$. The graph $G$ is strongly rainbow connected if there exists a rainbow $u-v$ geodesic for any two vertices $u$ and $v$ in $G$. The strong rainbow connection number of $G$, denoted $src(G)$, is the minimum number of colors that are needed in order to make $G$ strong rainbow connected. In thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.6139","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:38:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9EYXIm5zGoB7WPbbcKJFAf1SunVB5RWoFQP3KPPT1JIejaf4Zi6JDyl8nXsYRwjTko796U7uWJRPp7jZ/W8/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:18:59.581214Z"},"content_sha256":"acf17eacff404ef63fba25a125e9630d687f568c4202fbec16546b0cbe872952","schema_version":"1.0","event_id":"sha256:acf17eacff404ef63fba25a125e9630d687f568c4202fbec16546b0cbe872952"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H2TQTWMM3TZ5RUYHYQ5YVVIIMT/bundle.json","state_url":"https://pith.science/pith/H2TQTWMM3TZ5RUYHYQ5YVVIIMT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H2TQTWMM3TZ5RUYHYQ5YVVIIMT/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:18:59Z","links":{"resolver":"https://pith.science/pith/H2TQTWMM3TZ5RUYHYQ5YVVIIMT","bundle":"https://pith.science/pith/H2TQTWMM3TZ5RUYHYQ5YVVIIMT/bundle.json","state":"https://pith.science/pith/H2TQTWMM3TZ5RUYHYQ5YVVIIMT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H2TQTWMM3TZ5RUYHYQ5YVVIIMT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:H2TQTWMM3TZ5RUYHYQ5YVVIIMT","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":"b1fa2926507a85fb8211cf6f04c33339015a9ed328ff6f9ce86eb4d4ec9f7edf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-29T07:19:45Z","title_canon_sha256":"f435de6154f3412168c33c3bfb6452ffe54663bf202813ca0cfe32be8d575f3f"},"schema_version":"1.0","source":{"id":"1010.6139","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.6139","created_at":"2026-05-18T04:38:07Z"},{"alias_kind":"arxiv_version","alias_value":"1010.6139v1","created_at":"2026-05-18T04:38:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.6139","created_at":"2026-05-18T04:38:07Z"},{"alias_kind":"pith_short_12","alias_value":"H2TQTWMM3TZ5","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"H2TQTWMM3TZ5RUYH","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"H2TQTWMM","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:acf17eacff404ef63fba25a125e9630d687f568c4202fbec16546b0cbe872952","target":"graph","created_at":"2026-05-18T04:38:07Z","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, where adjacent edges may be colored the same, is a rainbow path if no two edges of it are colored the same. For any two vertices $u$ and $v$ of $G$, a rainbow $u-v$ geodesic in $G$ is a rainbow $u-v$ path of length $d(u,v)$, where $d(u,v)$ is the distance between $u$ and $v$. The graph $G$ is strongly rainbow connected if there exists a rainbow $u-v$ geodesic for any two vertices $u$ and $v$ in $G$. The strong rainbow connection number of $G$, denoted $src(G)$, is the minimum number of colors that are needed in order to make $G$ strong rainbow connected. In thi","authors_text":"Xueliang Li, Yuefang Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-29T07:19:45Z","title":"On strong rainbow connection number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.6139","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:c683c5db7495d3f98244b4b8ab479976f19cd373457589dd5af936aa08d8985c","target":"record","created_at":"2026-05-18T04:38:07Z","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":"b1fa2926507a85fb8211cf6f04c33339015a9ed328ff6f9ce86eb4d4ec9f7edf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-29T07:19:45Z","title_canon_sha256":"f435de6154f3412168c33c3bfb6452ffe54663bf202813ca0cfe32be8d575f3f"},"schema_version":"1.0","source":{"id":"1010.6139","kind":"arxiv","version":1}},"canonical_sha256":"3ea709d98cdcf3d8d307c43b8ad50864c08db2beea83361b29e56151380a3d90","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ea709d98cdcf3d8d307c43b8ad50864c08db2beea83361b29e56151380a3d90","first_computed_at":"2026-05-18T04:38:07.410217Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:38:07.410217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"70Gt2HuTQ4p86lj4MzkHJu9klNqTGSEn0ES3KS0U5qFBj8ULjIawF9LEMV3g3EZJzk/MzHbAsgq77T+aWbCzDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:38:07.410646Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.6139","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c683c5db7495d3f98244b4b8ab479976f19cd373457589dd5af936aa08d8985c","sha256:acf17eacff404ef63fba25a125e9630d687f568c4202fbec16546b0cbe872952"],"state_sha256":"72b1a3a7e1b6d999b31ca1a3e8a982351ae74a94259ad91e359c0022f2512922"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bkEBk0jI0Z6yE6asx/KKtBMWzoJm70b5/gnPUcxYM4aZeU263qNjw+HuVlsPrDxRn65EUauYNTAcfmUmDAkGDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:18:59.583076Z","bundle_sha256":"3f5ab98af06e69e94123a6b1d37b473ca2897a148b47e0dac79dc52fbda16ea3"}}