{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:I2DNUCTAN5YZVSAXJNM4IUKQD4","short_pith_number":"pith:I2DNUCTA","canonical_record":{"source":{"id":"1703.00236","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-01T11:22:52Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e8a7c7bbd78238542b50dbebb648e8f42096dfd98aff61da72049d0de674e823","abstract_canon_sha256":"bbb88ddc2a5c00a5ad43108bce27698254209c0c4cc075b916cbeab727f43b6c"},"schema_version":"1.0"},"canonical_sha256":"4686da0a606f719ac8174b59c451501f26ac221517ff9b5392692ec8dcc7c92f","source":{"kind":"arxiv","id":"1703.00236","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00236","created_at":"2026-05-18T00:26:01Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00236v4","created_at":"2026-05-18T00:26:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00236","created_at":"2026-05-18T00:26:01Z"},{"alias_kind":"pith_short_12","alias_value":"I2DNUCTAN5YZ","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"I2DNUCTAN5YZVSAX","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"I2DNUCTA","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:I2DNUCTAN5YZVSAXJNM4IUKQD4","target":"record","payload":{"canonical_record":{"source":{"id":"1703.00236","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-01T11:22:52Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e8a7c7bbd78238542b50dbebb648e8f42096dfd98aff61da72049d0de674e823","abstract_canon_sha256":"bbb88ddc2a5c00a5ad43108bce27698254209c0c4cc075b916cbeab727f43b6c"},"schema_version":"1.0"},"canonical_sha256":"4686da0a606f719ac8174b59c451501f26ac221517ff9b5392692ec8dcc7c92f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:01.004492Z","signature_b64":"1YNUTDr9OC6fyGWLcHHiwxkBnYxB55+ROjJ12hIyUT2t0bjBboy+qiKNQKb+LcLVHWYuf64ih49Ut0u1/VseBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4686da0a606f719ac8174b59c451501f26ac221517ff9b5392692ec8dcc7c92f","last_reissued_at":"2026-05-18T00:26:01.003792Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:01.003792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.00236","source_version":4,"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-18T00:26:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/LmPOMXc9JiKYmaczHxMf/fJO5xzpkbZw+0DRU0b2e1dRVMDdWiUaLP8eDycTcDAw552GSwkSWcXRD5tSqr2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:53:35.159759Z"},"content_sha256":"26d9dba01f1e339a76a9dfe1c4ff96e69030e6156daf7ff5713e1cddc31854a2","schema_version":"1.0","event_id":"sha256:26d9dba01f1e339a76a9dfe1c4ff96e69030e6156daf7ff5713e1cddc31854a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:I2DNUCTAN5YZVSAXJNM4IUKQD4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms and Bounds for Very Strong Rainbow Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Anita Das, Davis Issac, Erik Jan van Leeuwen, L. Sunil Chandran","submitted_at":"2017-03-01T11:22:52Z","abstract_excerpt":"A well-studied coloring problem is to assign colors to the edges of a graph $G$ so that, for every pair of vertices, all edges of at least one shortest path between them receive different colors. The minimum number of colors necessary in such a coloring is the strong rainbow connection number ($\\src(G)$) of the graph. When proving upper bounds on $\\src(G)$, it is natural to prove that a coloring exists where, for \\emph{every} shortest path between every pair of vertices in the graph, all edges of the path receive different colors. Therefore, we introduce and formally define this more restricte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00236","kind":"arxiv","version":4},"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-18T00:26:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/LfYFx+8Lh6ng2oOCuoXctBogSyo/t/igkstddfgrXvh4fc1+4b9KOhz+rSEq2O1AxR7JgQ+tK9mM/sdF1xvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:53:35.160432Z"},"content_sha256":"a46306c1e9a8956374dec3781dd3de89dd5a549fea9382de86f630c542c1c59a","schema_version":"1.0","event_id":"sha256:a46306c1e9a8956374dec3781dd3de89dd5a549fea9382de86f630c542c1c59a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I2DNUCTAN5YZVSAXJNM4IUKQD4/bundle.json","state_url":"https://pith.science/pith/I2DNUCTAN5YZVSAXJNM4IUKQD4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I2DNUCTAN5YZVSAXJNM4IUKQD4/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-05-31T22:53:35Z","links":{"resolver":"https://pith.science/pith/I2DNUCTAN5YZVSAXJNM4IUKQD4","bundle":"https://pith.science/pith/I2DNUCTAN5YZVSAXJNM4IUKQD4/bundle.json","state":"https://pith.science/pith/I2DNUCTAN5YZVSAXJNM4IUKQD4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I2DNUCTAN5YZVSAXJNM4IUKQD4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:I2DNUCTAN5YZVSAXJNM4IUKQD4","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":"bbb88ddc2a5c00a5ad43108bce27698254209c0c4cc075b916cbeab727f43b6c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-01T11:22:52Z","title_canon_sha256":"e8a7c7bbd78238542b50dbebb648e8f42096dfd98aff61da72049d0de674e823"},"schema_version":"1.0","source":{"id":"1703.00236","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00236","created_at":"2026-05-18T00:26:01Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00236v4","created_at":"2026-05-18T00:26:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00236","created_at":"2026-05-18T00:26:01Z"},{"alias_kind":"pith_short_12","alias_value":"I2DNUCTAN5YZ","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"I2DNUCTAN5YZVSAX","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"I2DNUCTA","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:a46306c1e9a8956374dec3781dd3de89dd5a549fea9382de86f630c542c1c59a","target":"graph","created_at":"2026-05-18T00:26: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":"A well-studied coloring problem is to assign colors to the edges of a graph $G$ so that, for every pair of vertices, all edges of at least one shortest path between them receive different colors. The minimum number of colors necessary in such a coloring is the strong rainbow connection number ($\\src(G)$) of the graph. When proving upper bounds on $\\src(G)$, it is natural to prove that a coloring exists where, for \\emph{every} shortest path between every pair of vertices in the graph, all edges of the path receive different colors. Therefore, we introduce and formally define this more restricte","authors_text":"Anita Das, Davis Issac, Erik Jan van Leeuwen, L. Sunil Chandran","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-01T11:22:52Z","title":"Algorithms and Bounds for Very Strong Rainbow Coloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00236","kind":"arxiv","version":4},"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:26d9dba01f1e339a76a9dfe1c4ff96e69030e6156daf7ff5713e1cddc31854a2","target":"record","created_at":"2026-05-18T00:26: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":"bbb88ddc2a5c00a5ad43108bce27698254209c0c4cc075b916cbeab727f43b6c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-01T11:22:52Z","title_canon_sha256":"e8a7c7bbd78238542b50dbebb648e8f42096dfd98aff61da72049d0de674e823"},"schema_version":"1.0","source":{"id":"1703.00236","kind":"arxiv","version":4}},"canonical_sha256":"4686da0a606f719ac8174b59c451501f26ac221517ff9b5392692ec8dcc7c92f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4686da0a606f719ac8174b59c451501f26ac221517ff9b5392692ec8dcc7c92f","first_computed_at":"2026-05-18T00:26:01.003792Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:01.003792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1YNUTDr9OC6fyGWLcHHiwxkBnYxB55+ROjJ12hIyUT2t0bjBboy+qiKNQKb+LcLVHWYuf64ih49Ut0u1/VseBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:01.004492Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.00236","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26d9dba01f1e339a76a9dfe1c4ff96e69030e6156daf7ff5713e1cddc31854a2","sha256:a46306c1e9a8956374dec3781dd3de89dd5a549fea9382de86f630c542c1c59a"],"state_sha256":"082f916e907a1594889c53e909d93bd79f72839d9ce9292bcdec6cd59249a271"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c4Uu4Y2F2C4FxCClfxyrt2i5AtS/sNL8JHf6veEFGNuLlwAQjTY3z/KrdNxiEcYovEPcN2zZyx6RNcHfA17NAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:53:35.163991Z","bundle_sha256":"85ae3b828d02423274bf4cd54db895129e21a4290df734624ee8f9795349e005"}}