{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:I2DNUCTAN5YZVSAXJNM4IUKQD4","short_pith_number":"pith:I2DNUCTA","schema_version":"1.0","canonical_sha256":"4686da0a606f719ac8174b59c451501f26ac221517ff9b5392692ec8dcc7c92f","source":{"kind":"arxiv","id":"1703.00236","version":4},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.00236","created_at":"2026-05-18T00:26:01.003903+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.00236v4","created_at":"2026-05-18T00:26:01.003903+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00236","created_at":"2026-05-18T00:26:01.003903+00:00"},{"alias_kind":"pith_short_12","alias_value":"I2DNUCTAN5YZ","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"I2DNUCTAN5YZVSAX","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"I2DNUCTA","created_at":"2026-05-18T12:31:21.493067+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I2DNUCTAN5YZVSAXJNM4IUKQD4","json":"https://pith.science/pith/I2DNUCTAN5YZVSAXJNM4IUKQD4.json","graph_json":"https://pith.science/api/pith-number/I2DNUCTAN5YZVSAXJNM4IUKQD4/graph.json","events_json":"https://pith.science/api/pith-number/I2DNUCTAN5YZVSAXJNM4IUKQD4/events.json","paper":"https://pith.science/paper/I2DNUCTA"},"agent_actions":{"view_html":"https://pith.science/pith/I2DNUCTAN5YZVSAXJNM4IUKQD4","download_json":"https://pith.science/pith/I2DNUCTAN5YZVSAXJNM4IUKQD4.json","view_paper":"https://pith.science/paper/I2DNUCTA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.00236&json=true","fetch_graph":"https://pith.science/api/pith-number/I2DNUCTAN5YZVSAXJNM4IUKQD4/graph.json","fetch_events":"https://pith.science/api/pith-number/I2DNUCTAN5YZVSAXJNM4IUKQD4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I2DNUCTAN5YZVSAXJNM4IUKQD4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I2DNUCTAN5YZVSAXJNM4IUKQD4/action/storage_attestation","attest_author":"https://pith.science/pith/I2DNUCTAN5YZVSAXJNM4IUKQD4/action/author_attestation","sign_citation":"https://pith.science/pith/I2DNUCTAN5YZVSAXJNM4IUKQD4/action/citation_signature","submit_replication":"https://pith.science/pith/I2DNUCTAN5YZVSAXJNM4IUKQD4/action/replication_record"}},"created_at":"2026-05-18T00:26:01.003903+00:00","updated_at":"2026-05-18T00:26:01.003903+00:00"}