{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PFA6I33YRP2FY3DCP4GVCEC2DR","short_pith_number":"pith:PFA6I33Y","schema_version":"1.0","canonical_sha256":"7941e46f788bf45c6c627f0d51105a1c68ba07e81d3d1fcc6baf66e9c4c79e18","source":{"kind":"arxiv","id":"1104.2074","version":1},"attestation_state":"computed","paper":{"title":"New Hardness Results in Rainbow Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Meghana Nasre, Prabhanjan Ananth","submitted_at":"2011-04-11T21:55:17Z","abstract_excerpt":"A path in an edge colored graph is said to be a rainbow path if no two edges on the path have the same color. An edge colored graph is (strongly) rainbow connected if there exists a (geodesic) rainbow path between every pair of vertices. The (strong) rainbow connectivity of a graph $G$, denoted by ($src(G)$, respectively) $rc(G)$ is the smallest number of colors required to edge color the graph such that the graph is (strong) rainbow connected. It is known that for \\emph{even} $k$ to decide whether the rainbow connectivity of a graph is at most $k$ or not is NP-hard. It was conjectured that fo"},"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":"1104.2074","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-11T21:55:17Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"1b3b7ee50f10910ded43998ca93b4bdaaac3893254d4a4508316fb568c3ea1d7","abstract_canon_sha256":"e5ca3d89961d24548e64acd99c88da942aad010b4a77997c38ee5806f4a36b33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:35.930293Z","signature_b64":"DxQ7hz4hWuNxxH6281VBhVpN0nQcQRpYfAwxC105gmQLfHnjLU5pmVszjHpBg9BphAK6FHpEZgh2MUuosUGWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7941e46f788bf45c6c627f0d51105a1c68ba07e81d3d1fcc6baf66e9c4c79e18","last_reissued_at":"2026-05-18T04:24:35.929756Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:35.929756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Hardness Results in Rainbow Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Meghana Nasre, Prabhanjan Ananth","submitted_at":"2011-04-11T21:55:17Z","abstract_excerpt":"A path in an edge colored graph is said to be a rainbow path if no two edges on the path have the same color. An edge colored graph is (strongly) rainbow connected if there exists a (geodesic) rainbow path between every pair of vertices. The (strong) rainbow connectivity of a graph $G$, denoted by ($src(G)$, respectively) $rc(G)$ is the smallest number of colors required to edge color the graph such that the graph is (strong) rainbow connected. It is known that for \\emph{even} $k$ to decide whether the rainbow connectivity of a graph is at most $k$ or not is NP-hard. It was conjectured that fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2074","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1104.2074","created_at":"2026-05-18T04:24:35.929845+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.2074v1","created_at":"2026-05-18T04:24:35.929845+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2074","created_at":"2026-05-18T04:24:35.929845+00:00"},{"alias_kind":"pith_short_12","alias_value":"PFA6I33YRP2F","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"PFA6I33YRP2FY3DC","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"PFA6I33Y","created_at":"2026-05-18T12:26:39.201973+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/PFA6I33YRP2FY3DCP4GVCEC2DR","json":"https://pith.science/pith/PFA6I33YRP2FY3DCP4GVCEC2DR.json","graph_json":"https://pith.science/api/pith-number/PFA6I33YRP2FY3DCP4GVCEC2DR/graph.json","events_json":"https://pith.science/api/pith-number/PFA6I33YRP2FY3DCP4GVCEC2DR/events.json","paper":"https://pith.science/paper/PFA6I33Y"},"agent_actions":{"view_html":"https://pith.science/pith/PFA6I33YRP2FY3DCP4GVCEC2DR","download_json":"https://pith.science/pith/PFA6I33YRP2FY3DCP4GVCEC2DR.json","view_paper":"https://pith.science/paper/PFA6I33Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.2074&json=true","fetch_graph":"https://pith.science/api/pith-number/PFA6I33YRP2FY3DCP4GVCEC2DR/graph.json","fetch_events":"https://pith.science/api/pith-number/PFA6I33YRP2FY3DCP4GVCEC2DR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PFA6I33YRP2FY3DCP4GVCEC2DR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PFA6I33YRP2FY3DCP4GVCEC2DR/action/storage_attestation","attest_author":"https://pith.science/pith/PFA6I33YRP2FY3DCP4GVCEC2DR/action/author_attestation","sign_citation":"https://pith.science/pith/PFA6I33YRP2FY3DCP4GVCEC2DR/action/citation_signature","submit_replication":"https://pith.science/pith/PFA6I33YRP2FY3DCP4GVCEC2DR/action/replication_record"}},"created_at":"2026-05-18T04:24:35.929845+00:00","updated_at":"2026-05-18T04:24:35.929845+00:00"}